An open API service indexing awesome lists of open source software.

https://github.com/mastercruelty/metroflowrouter

A way to use graph concepts to find the smartest path in a metro network of a city.
https://github.com/mastercruelty/metroflowrouter

data-structures golang graph graph-algorithms metro subway-network

Last synced: 6 months ago
JSON representation

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

Awesome Lists containing this project

README

          

[![Maintainability Rating](https://sonarcloud.io/api/project_badges/measure?project=MasterCruelty_MetroFlowRouter&metric=sqale_rating)](https://sonarcloud.io/dashboard?id=MasterCruelty_MetroFlowRouter)
[![Quality Gate Pass](https://sonarcloud.io/api/project_badges/measure?project=MasterCruelty_MetroFlowRouter&metric=alert_status)](https://sonarcloud.io/dashboard?id=MasterCruelty_MetroFlowRouter)
[![Lines of Code](https://sonarcloud.io/api/project_badges/measure?project=MasterCruelty_MetroFlowRouter&metric=ncloc)](https://sonarcloud.io/dashboard?id=MasterCruelty_MetroFlowRouter)
![License](https://img.shields.io/github/license/MasterCruelty/MetroFlowRouter)
[![image](https://img.shields.io/github/stars/MasterCruelty/MetroFlowRouter)](https://github.com/MasterCruelty/MetroFlowRouter/stargazers)
[![image](https://img.shields.io/github/forks/MasterCruelty/MetroFlowRouter)](https://github.com/MasterCruelty/MetroFlowRouter/network/members)
![CodeSize](https://img.shields.io/github/languages/code-size/MasterCruelty/MetroFlowRouter)
[![image](https://img.shields.io/github/issues/MasterCruelty/MetroFlowRouter)](https://github.com/MasterCruelty/MetroFlowRouter/issues)
![image](https://img.shields.io/github/languages/top/MasterCruelty/MetroFlowRouter)
![image](https://img.shields.io/github/commit-activity/w/MasterCruelty/MetroFlowRouter)
![image](https://img.shields.io/github/contributors/MasterCruelty/MetroFlowRouter)

# 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](https://github.com/MasterCruelty/MetroFlowRouter/blob/main/CONTRIBUTING.md)

### Usage Example
```ruby
build metro.go
./metro Milan.txt
```
![image](https://github.com/MasterCruelty/MetroFlowRouter/assets/72561502/325612cf-8681-4c93-b765-54bdec61c65d)
![image](https://github.com/MasterCruelty/MetroFlowRouter/assets/72561502/cc1f225b-1f31-4883-9147-22a3f7e42c87)
![image](https://github.com/MasterCruelty/MetroFlowRouter/assets/72561502/6b12f9c5-857a-4986-b3f8-408e16bf323c)
![image](https://github.com/MasterCruelty/MetroFlowRouter/assets/72561502/0444addd-6629-48b6-958a-7b1507c2e43e)