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.