Skip to content

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

Notifications You must be signed in to change notification settings

jerohnimaux/transport_network_pathfinder

Repository files navigation

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

TODO

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

About

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

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published