Skip to content
New issue

Have a question about this project? # for a free GitHub account to open an issue and contact its maintainers and the community.

#

By clicking “#”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? # to your account

Add a Codacy badge to README.md #52

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Add a Codacy badge to README.md #52

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 3 additions & 0 deletions README.md
View file
Original file line number Diff line number Diff line change
@@ -1,4 +1,7 @@
# README #

[![Codacy Badge](https://api.codacy.com/project/badge/Grade/eaa944d0d9ac47e0a322592e648646fd)](https://www.codacy.com/app/lucaspg96/graphast?utm_source=github.com&utm_medium=referral&utm_content=InsightLab/graphast&utm_campaign=badger)


*Graphast* is a framework tool that allows users to compose a number of user-generated/populated network models, data importing/exporting services as well as query services, in order to quickly build applications on time-dependent road networks. The main goal is to allow users to prototype solutions to different types of problems on time-dependent road networks using nearest neighbor queries or optimal sequenced routes and a "plug-and-play" approach with a visual interface. Users can choose to combine facilities provided by the *Graphast* framework via a public API and/or build their own facilities, e.g., a new query processing algorithm, and incorporate those into *Graphast* for others to use them as well.