This application solves two major problems: finding the distance of a given route and finding the routes between two cities that satisfy certain conditions. Naturally, these problems lend themselves to graph processing algorithms Cities are represented in the form of a graph.
-
Notifications
You must be signed in to change notification settings - Fork 0
This application solves two major problems: finding the distance of a given route and finding the routes between two cities that satisfy certain conditions. Naturally, these problems lend themselves to graph processing algorithms. See the Readme file for more information and instructions on how to run.
kiptoomm/TrainsRoute
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This application solves two major problems: finding the distance of a given route and finding the routes between two cities that satisfy certain conditions. Naturally, these problems lend themselves to graph processing algorithms. See the Readme file for more information and instructions on how to run.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published