https://github.com/eshaagarwa/metro_app
A simple Java project using 🕸️ Graph and 🏔️ Heap data structures and 🧭 Dijkstra's algorithm, 🔍 DFS, 🧭 BFS, etc., algorithms to display the 🚇 shortest distance/path in Metro.
https://github.com/eshaagarwa/metro_app
dijkstra-algorithm dsa-algorithm graph heapsort-algorithm java
Last synced: 8 months ago
JSON representation
A simple Java project using 🕸️ Graph and 🏔️ Heap data structures and 🧭 Dijkstra's algorithm, 🔍 DFS, 🧭 BFS, etc., algorithms to display the 🚇 shortest distance/path in Metro.
- Host: GitHub
- URL: https://github.com/eshaagarwa/metro_app
- Owner: eshaagarwa
- Created: 2023-03-24T19:56:36.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2024-09-20T16:46:53.000Z (about 1 year ago)
- Last Synced: 2024-12-28T14:51:49.508Z (10 months ago)
- Topics: dijkstra-algorithm, dsa-algorithm, graph, heapsort-algorithm, java
- Language: Java
- Homepage:
- Size: 15.6 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
🛠️ Navigating the Metro with Java: **Metro App Project** 🛠️
🎉 Hello there! I’m excited to present **Metro App**, a simple yet powerful **Java project** that demonstrates the use of **data structures** to solve a real-world problem 🚇. This project allows users to input the source and destination metro stations and displays both the **fare** and the **shortest route** between them. The application also features a metro map to enhance commuters' navigation experience 🌍.
🚀 **Project Features Overview** 🚀
🌐 **Metro App Functionality** 🌐
- **Shortest Path Calculation**: By using different algorithms like **Dijkstra**, **BFS (Breadth-First Search)**, and **DFS (Depth-First Search)**, the shortest metro route between the source and destination stations is determined.
- **Fare Calculation**: The fare is dynamically calculated based on the total distance between the two stations.
- **Metro Map for Navigation**: A visual metro map aids in commuter navigation.
🛠️ **Core Concepts Used** 🛠️
The idea is implemented using **Graph** and **Heap** data structures:
- **Nodes**: Represent each metro station, containing information such as its name, metro corridor, and connecting lines.
- **Edges**: Represent the distance between two metro stations and the fare calculation based on the distance.
📜 **Main Algorithms & Files** 📜
- **Main.java**: Contains the primary code for executing the project logic.
- **Heap.java**: Implements the **heap** data structure used for optimizing path-finding algorithms.
🛠️ **Technologies Used** 🛠️
- **Java**: For building the entire metro app and implementing data structures.
- **Graph**: Represents metro stations and connections.
- **Heap**: Optimizes the shortest path algorithm.
🚀 **Requirements** 🚀
- **IDE**: You can run the project on any IDE like **Eclipse**, **NetBeans**, or **VSCode**.
- **Java Knowledge**: You’ll need some basic understanding of **Java** programming, especially data structures.
- **Optional**: Knowledge of the **Java Collection Framework** will make things easier. If you are unfamiliar, check out [GeeksforGeeks](https://www.geeksforgeeks.org/collections-in-java-2/) to get started!
🌟 **All Set for Your Journey!** 🌟
Dive into this **Metro App** project and explore how graph theory and Java come together to solve practical problems. Happy coding! 🚇💻