transport_network_pathfinder

This school project uses Dijkstra algorithm to find the shortest route in the parisian public transport network (Paris, France).

Installation

Simply download the files, open terminal and enter:

./make
./RATP

Test other (more efficient) algorithms Translate comments in English Add a simple graphical interface

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
data		data
Generic_connection_parser.hpp		Generic_connection_parser.hpp
Generic_mapper.hpp		Generic_mapper.hpp
Generic_station_parser.hpp		Generic_station_parser.hpp
Mapper.cpp		Mapper.cpp
Mapper.hpp		Mapper.hpp
README.md		README.md
main.cpp		main.cpp
makefile		makefile