https://github.com/samarth-5/lucknow-metro-management-system
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).
https://github.com/samarth-5/lucknow-metro-management-system
arraylist graph hashmap-and-heaps java linked-list queues stack
Last synced: 5 months ago
JSON representation
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).
- Host: GitHub
- URL: https://github.com/samarth-5/lucknow-metro-management-system
- Owner: samarth-5
- Created: 2024-01-08T12:04:27.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2024-08-19T06:10:28.000Z (9 months ago)
- Last Synced: 2024-11-07T20:16:25.034Z (7 months ago)
- Topics: arraylist, graph, hashmap-and-heaps, java, linked-list, queues, stack
- Language: Java
- Homepage:
- Size: 7.81 KB
- Stars: 2
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Lucknow Metro Management Application
## Overview
The Lucknow Metro Management Application provides users with functionalities to:
- View a list of metro stations.
- Display the metro map.
- Calculate the shortest distance and time between two stations using Dijkstra's Algorithm.
- Explore routes using Breadth First Search (BFS) and Depth First Search (DFS).
The application is built in Java and uses various data structures and algorithms to ensure efficient performance.
## Features
- **Station Listing**: List all metro stations.
- **Metro Map**: Display a visual representation of the metro network.
- **Shortest Path Calculation**: Find the shortest path between stations using Dijkstra's Algorithm.
- **Route Exploration**: Use BFS and DFS to explore routes.
## Prerequisites
- Java Development Kit (JDK) 8 or higher
- Visual Studio Code (VS Code) with Java extensions installed
## Quick Start
**Clone the Repository**
Open a terminal and run the following command to clone the repository:
```bash
git clone
cd Lucknow-Metro-Management-Application