{"id":18778496,"url":"https://github.com/samarth-5/lucknow-metro-management-system","last_synced_at":"2026-03-06T04:34:46.751Z","repository":{"id":216096517,"uuid":"740466509","full_name":"samarth-5/Lucknow-Metro-Management-System","owner":"samarth-5","description":"This system takes the Source station and Destination station from the user as inputs. This code can display the Metro-Stations, Metro-Map, Shortest Distance between two stations in terms of both time as well as distance. I have used Dijkstra's Algorithm, Breadth First Search(BFS) and Depth First Search (DFS).","archived":false,"fork":false,"pushed_at":"2024-08-19T06:10:28.000Z","size":8,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-11-07T20:16:25.034Z","etag":null,"topics":["arraylist","graph","hashmap-and-heaps","java","linked-list","queues","stack"],"latest_commit_sha":null,"homepage":"","language":"Java","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/samarth-5.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":"2024-01-08T12:04:27.000Z","updated_at":"2024-08-19T20:56:21.000Z","dependencies_parsed_at":"2024-01-08T13:57:57.804Z","dependency_job_id":"c2c22b96-9ce4-476c-a3f5-3a0adeddc9d7","html_url":"https://github.com/samarth-5/Lucknow-Metro-Management-System","commit_stats":null,"previous_names":["samarth-5/lucknow-metro-management-system"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/samarth-5%2FLucknow-Metro-Management-System","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/samarth-5%2FLucknow-Metro-Management-System/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/samarth-5%2FLucknow-Metro-Management-System/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/samarth-5%2FLucknow-Metro-Management-System/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/samarth-5","download_url":"https://codeload.github.com/samarth-5/Lucknow-Metro-Management-System/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":231722236,"owners_count":18416604,"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":["arraylist","graph","hashmap-and-heaps","java","linked-list","queues","stack"],"created_at":"2024-11-07T20:16:26.473Z","updated_at":"2026-03-06T04:34:46.704Z","avatar_url":"https://github.com/samarth-5.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Lucknow Metro Management Application\n\n## Overview\n\nThe Lucknow Metro Management Application provides users with functionalities to:\n\n- View a list of metro stations.\n- Display the metro map.\n- Calculate the shortest distance and time between two stations using Dijkstra's Algorithm.\n- Explore routes using Breadth First Search (BFS) and Depth First Search (DFS).\n\nThe application is built in Java and uses various data structures and algorithms to ensure efficient performance.\n\n## Features\n\n- **Station Listing**: List all metro stations.\n- **Metro Map**: Display a visual representation of the metro network.\n- **Shortest Path Calculation**: Find the shortest path between stations using Dijkstra's Algorithm.\n- **Route Exploration**: Use BFS and DFS to explore routes.\n\n## Prerequisites\n\n- Java Development Kit (JDK) 8 or higher\n- Visual Studio Code (VS Code) with Java extensions installed\n\n## Quick Start\n\n **Clone the Repository**\n\n   Open a terminal and run the following command to clone the repository:\n\n   ```bash\n   git clone \u003crepository-url\u003e\n   cd Lucknow-Metro-Management-Application\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsamarth-5%2Flucknow-metro-management-system","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsamarth-5%2Flucknow-metro-management-system","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsamarth-5%2Flucknow-metro-management-system/lists"}