Skip to content

A program in C using Dijkstra's algorithm to find the best way to go from one station to another

Notifications You must be signed in to change notification settings

Chadys/metro_project

Repository files navigation

Use the command make and then ./metro to start the program

There is another version of the program, simpler and quicker but searching only for one quickest path and not all.

You can access it with

git checkout uniline_station_version

and to go back to the first version you replace "uniline_station_version" by the branch's name "master"

About

A program in C using Dijkstra's algorithm to find the best way to go from one station to another

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published