Skip to content

A way to use graph concepts to find the smartest path in a metro network of a city.

License

Notifications You must be signed in to change notification settings

MasterCruelty/MetroFlowRouter

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

27 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Maintainability Rating Quality Gate Pass Lines of Code License image image CodeSize image image image image

MetroFlowRouter

What is it?

A funny tool to check information about a metro network of your favourites cities! This tool make use of graph concepts and it uses BFS to find the mininum path from a starting station to another one. You can use it for every city you want. The only thing you have to do is fill correctly the txt file such as Milan.txt or the other example text files. You must use the same layout.

Contribute

Feel free to contribute and improve the project. You can read the guidelines to contribute here

Usage Example

build metro.go
./metro Milan.txt

image image image image

About

A way to use graph concepts to find the smartest path in a metro network of a city.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages