Realization of the equivalent of the RATP application via the DJIKSTRA algorithm, by C ++.
Finding the optimal route to go from one station to another in the Paris metro network.
The code is in the ‘src’, ‘soluce’ is the main function.
There are 2 images, one is result of station of 1647 and 1649. The second is about makefile.
-
Notifications
You must be signed in to change notification settings - Fork 0
longyuz0426/dijkstra_application_cpp
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published