This project provides an efficient way to navigate the Delhi Metro system by calculating both the shortest and most economical routes between two stations. It also includes a feature to find the nearest metro station to popular tourist destinations like India Gate.
- Shortest Path: Finds the shortest route between two stations using Breadth-First Search (BFS).
- Most Economical Path: Calculates the most economical path based on Delhi Metro's fare system using Dijkstra's Algorithm.
- Tourist Support: Locates the nearest metro station to popular tourist spots, such as India Gate.
-
Compile the code:
g++ metro.cpp
-
Run the application:
./a.out
-
Follow the menu options to:
- Find the shortest path.
- Find the most economical path.
- Locate the nearest metro station to a tourist destination.
- C++ compiler (e.g., g++)
- Terminal or command line interface