{"id":26218454,"url":"https://github.com/mastercruelty/metroflowrouter","last_synced_at":"2025-04-15T23:48:53.309Z","repository":{"id":208067009,"uuid":"720747424","full_name":"MasterCruelty/MetroFlowRouter","owner":"MasterCruelty","description":"A way to use graph concepts to find the smartest path in a metro network of a city.","archived":false,"fork":false,"pushed_at":"2025-01-07T23:18:09.000Z","size":1138,"stargazers_count":6,"open_issues_count":2,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-29T02:51:29.210Z","etag":null,"topics":["data-structures","golang","graph","graph-algorithms","metro","subway-network"],"latest_commit_sha":null,"homepage":"","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/MasterCruelty.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-11-19T13:33:55.000Z","updated_at":"2025-01-07T23:18:12.000Z","dependencies_parsed_at":"2024-01-13T17:05:40.734Z","dependency_job_id":"f0171b56-b6b5-4713-8c9c-9ad34784a8ea","html_url":"https://github.com/MasterCruelty/MetroFlowRouter","commit_stats":null,"previous_names":["mastercruelty/metroflowrouter"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MasterCruelty%2FMetroFlowRouter","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MasterCruelty%2FMetroFlowRouter/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MasterCruelty%2FMetroFlowRouter/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MasterCruelty%2FMetroFlowRouter/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MasterCruelty","download_url":"https://codeload.github.com/MasterCruelty/MetroFlowRouter/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":249173060,"owners_count":21224481,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["data-structures","golang","graph","graph-algorithms","metro","subway-network"],"created_at":"2025-03-12T13:17:07.385Z","updated_at":"2025-04-15T23:48:53.292Z","avatar_url":"https://github.com/MasterCruelty.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"[![Maintainability Rating](https://sonarcloud.io/api/project_badges/measure?project=MasterCruelty_MetroFlowRouter\u0026metric=sqale_rating)](https://sonarcloud.io/dashboard?id=MasterCruelty_MetroFlowRouter)\n[![Quality Gate Pass](https://sonarcloud.io/api/project_badges/measure?project=MasterCruelty_MetroFlowRouter\u0026metric=alert_status)](https://sonarcloud.io/dashboard?id=MasterCruelty_MetroFlowRouter)\n[![Lines of Code](https://sonarcloud.io/api/project_badges/measure?project=MasterCruelty_MetroFlowRouter\u0026metric=ncloc)](https://sonarcloud.io/dashboard?id=MasterCruelty_MetroFlowRouter)\n![License](https://img.shields.io/github/license/MasterCruelty/MetroFlowRouter)\n[![image](https://img.shields.io/github/stars/MasterCruelty/MetroFlowRouter)](https://github.com/MasterCruelty/MetroFlowRouter/stargazers)\n[![image](https://img.shields.io/github/forks/MasterCruelty/MetroFlowRouter)](https://github.com/MasterCruelty/MetroFlowRouter/network/members)\n![CodeSize](https://img.shields.io/github/languages/code-size/MasterCruelty/MetroFlowRouter)\n[![image](https://img.shields.io/github/issues/MasterCruelty/MetroFlowRouter)](https://github.com/MasterCruelty/MetroFlowRouter/issues)\n![image](https://img.shields.io/github/languages/top/MasterCruelty/MetroFlowRouter)\n![image](https://img.shields.io/github/commit-activity/w/MasterCruelty/MetroFlowRouter)\n![image](https://img.shields.io/github/contributors/MasterCruelty/MetroFlowRouter)\n\n# MetroFlowRouter\n\n### What is it?\nA funny tool to check information about a metro network of your favourites cities!\nThis tool make use of graph concepts and it uses BFS to find the mininum path from a starting station to another one.\nYou 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.\n\n\n### Contribute\nFeel free to contribute and improve the project. You can read the guidelines to contribute [here](https://github.com/MasterCruelty/MetroFlowRouter/blob/main/CONTRIBUTING.md)\n\n### Usage Example\n```ruby\nbuild metro.go\n./metro Milan.txt\n```\n![image](https://github.com/MasterCruelty/MetroFlowRouter/assets/72561502/325612cf-8681-4c93-b765-54bdec61c65d)\n![image](https://github.com/MasterCruelty/MetroFlowRouter/assets/72561502/cc1f225b-1f31-4883-9147-22a3f7e42c87)\n![image](https://github.com/MasterCruelty/MetroFlowRouter/assets/72561502/6b12f9c5-857a-4986-b3f8-408e16bf323c)\n![image](https://github.com/MasterCruelty/MetroFlowRouter/assets/72561502/0444addd-6629-48b6-958a-7b1507c2e43e)                  \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmastercruelty%2Fmetroflowrouter","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmastercruelty%2Fmetroflowrouter","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmastercruelty%2Fmetroflowrouter/lists"}