Metro is a route planning application for RER and metro in Paris to determine an optimal route between two stations. From a departure station and an arrival station, the program displays in textual and graphical form, the shortest path between these stations. This is determined by Dijkstra's algorithm (1959).
-
Notifications
You must be signed in to change notification settings - Fork 0
Metro is a route planning application for RER and metro in Paris to determine an optimal route between two stations. From a departure station and an arrival station, the program displays in textual and graphical form, the shortest path between these stations. This is determined by Dijkstra's algorithm (1959).
alexandre-lefranc/Metro
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Metro is a route planning application for RER and metro in Paris to determine an optimal route between two stations. From a departure station and an arrival station, the program displays in textual and graphical form, the shortest path between these stations. This is determined by Dijkstra's algorithm (1959).
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published