This project simulates a metro system using a graph-based structure for representing metro stations and routes. It also uses a heap (priority queue) to find the shortest route between stations using Dijkstra's algorithm.
- Graph Representation: Stations and routes are represented as a graph with an adjacency list.
- Shortest Path Calculation: Dijkstra’s algorithm is used to calculate the shortest path between stations.
- Heap (Priority Queue): A heap is used to optimize the shortest path algorithm.
- Main.cpp: The entry point of the program where user interaction happens.
- Station.cpp: Defines the
Stationclass, representing each metro station. - Route.cpp: Defines the
Routeclass, managing the routes between stations. - Graph.cpp: Implements a graph structure to store stations and routes, and provides the shortest path calculation.
- Heap.cpp: Implements a heap (priority queue) used in Dijkstra’s algorithm to process stations efficiently.
You need a C++ compiler installed on your machine. You can use g++, which is available in the GCC compiler collection.
- Clone the repository:
git clone https://github.com/[your-username]/metro-app-cpp.git