A Java-based console application that computes the shortest route and fare between two Delhi Metro stations using graph algorithms and heap data structures. It also displays an interactive metro map for enhanced user navigation.
- Simulates the Delhi Metro network using a weighted graph with 100+ nodes and edges.
- Computes shortest path and fare using Dijkstra’s Algorithm and Breadth-First Search (BFS).
- Each station node stores relevant data like station name, corridor, and inter-line connectivity.
- Includes an interactive metro map for better route planning and visualization.
- Language: Java
- Algorithms: Dijkstra, BFS, DFS
- Data Structures: Graphs, Heaps, OOP Concepts
Main.java– Contains core logic, including graph setup and route computation.Heap.java– Custom implementation of the Heap data structure used by Dijkstra.
- Any IDE (Eclipse, IntelliJ, NetBeans, or online editors like ideone.com).
- Basic knowledge of Java programming is recommended.
- Familiarity with graphs, heaps, and graph traversal algorithms (Dijkstra, BFS, DFS) is helpful.
- Understanding of the Java Collections Framework is a plus.
→ Quick Reference
- Clone this repository or download the code files.
- Open
Main.javain your Java IDE. - Run the program and input the source and destination station names when prompted.
- View the shortest route and fare.
- (Optional) Explore the integrated map for visual navigation.
This is not an Android application. It is a Java-based CLI project designed to demonstrate core algorithmic and data structure skills.