This project leverages real-time data from Ile-de-France Mobilités (IDFM) to provide an efficient metro navigation system for Paris and Bordeaux (using a simplified dataset). It utilizes graph algorithms to calculate shortest paths, visualize the minimum spanning tree of the metro network, and check network connectivity.
it
graph-algorithms
s6
subway
paris
dijkstra-algorithm
prim-algorithm
transportation-network
dijkstra-shortest-path
efrei
l3
2024
real-data
mastercamp
-
Updated
Jul 4, 2024 - Python