{"id":20497774,"url":"https://github.com/vikas350/metroway---delhimetrosystem-cli-based-project","last_synced_at":"2025-08-20T03:55:05.686Z","repository":{"id":171866670,"uuid":"613047179","full_name":"Vikas350/MetroWay---DelhiMetroSystem-CLI-based-project","owner":"Vikas350","description":"MetroWay - an application meant for users, It helps you find \u0026 visualize the Shortest Path between Delhi Metro Stations, it uses Graph Data Structure \u0026 Dijkstra's Algorithm.","archived":false,"fork":false,"pushed_at":"2023-03-12T19:11:40.000Z","size":454,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-05T18:57:20.850Z","etag":null,"topics":["dijkstra-algorithm","graph","stl-containers"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Vikas350.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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-03-12T18:24:35.000Z","updated_at":"2024-05-02T12:18:48.000Z","dependencies_parsed_at":null,"dependency_job_id":"719ccc9a-e651-42bf-9146-472777ea70a4","html_url":"https://github.com/Vikas350/MetroWay---DelhiMetroSystem-CLI-based-project","commit_stats":null,"previous_names":["vikas350/metroway---delhimetrosystem-cli-based-project"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Vikas350/MetroWay---DelhiMetroSystem-CLI-based-project","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vikas350%2FMetroWay---DelhiMetroSystem-CLI-based-project","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vikas350%2FMetroWay---DelhiMetroSystem-CLI-based-project/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vikas350%2FMetroWay---DelhiMetroSystem-CLI-based-project/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vikas350%2FMetroWay---DelhiMetroSystem-CLI-based-project/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Vikas350","download_url":"https://codeload.github.com/Vikas350/MetroWay---DelhiMetroSystem-CLI-based-project/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vikas350%2FMetroWay---DelhiMetroSystem-CLI-based-project/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":271262058,"owners_count":24728976,"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","status":"online","status_checked_at":"2025-08-20T02:00:09.606Z","response_time":69,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["dijkstra-algorithm","graph","stl-containers"],"created_at":"2024-11-15T18:12:00.332Z","updated_at":"2025-08-20T03:55:05.631Z","avatar_url":"https://github.com/Vikas350.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 🚅 MetroWay - DelhiMetroSystem-CLI-based-project\n\n ![x](./pics/Logo.png)\n\n## ⚙️ Tech Stack Used\n - C++ language\n - Graph Data Structute\n - Dijkstra Algorithm (using Set data structure)\n - STL Containers (map, set, vector etc.)\n - C++ File handling (for creating .dot file)\n - Graphviz (for Creating Graph image or pdf using .dot file)\n \n ## 🔰 About\n - MetroWay is an application meant for users, It helps you find \u0026 visualize the Shortest Path between Delhi Metro Stations, it uses Graph Data Structure \u0026     Dijkstra's Algorithm.\n \n ## 🌟 Features\n - Find and Show the Shortest Distance between any 2 stations\n - Find and Show the Shortest Route from Source to Destination Station\n - Calculate the Fare using data of DMRC stored in .csv file\n - Also generate a graph png Image using .dot file for visualization\n \n ## 📄 Resources\n - [DMRC](https://www.delhimetrorail.com/)\n \n ## Highlights\n - Start\n ![a](./pics/start.png)\n \n - Run \n ![b](./pics/run.png)\n \n - Stations shown as Graph using Graphviz\n ![c](./path.png)\n \n ## Credit\n #### - Vikas Kushwaha\n #### - connect with me [LinkedIn](https://linkedin.com/in/vikas-kushwaha-165b95204)\n \n \n \n \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvikas350%2Fmetroway---delhimetrosystem-cli-based-project","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fvikas350%2Fmetroway---delhimetrosystem-cli-based-project","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvikas350%2Fmetroway---delhimetrosystem-cli-based-project/lists"}