Skip to content

TanishqCh07/metro-path-navigator

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 

Repository files navigation

🛠️ 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 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! 🚇💻

About

Developed a Metro App using Java, implementing data structures like Graphs and Heaps to calculate the shortest routes and dynamically determine fare between stations. Applied algorithms such as Dijkstra’s, BFS, and DFS to optimize route navigation and integrated a visual metro map for an enhanced user experience.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages