Path Finder - Metro Rail Route Finder

This project is a Metro Rail Route Finder written in C++. It helps users find the shortest and most economical paths for their metro journeys.

Prerequisites

Before running the project, you need to install Graphviz.

# Install Graphviz
# Replace with the appropriate installation command for your system
# Example for Linux:
sudo apt-get install graphviz

Usage

execute the following

make 
./metro

Program flow

1. Login
2. Sign up
3. Exit
Enter your choice (1-3): 1
Enter your username: harsh
Enter your password: 123
Login successful!
Welcome harsh!
Press 0 to logout at any point
Welcome to the metro path finder

***** Metro Rail Route Finder *****
1. Find Shortest Path
2. Find Most Economical Path
3. Recharge Metro Card
Enter your choice: 1
Enter Source and Destination Stations:
Graph visualization created successfully.
Graph loaded successfully in village_map.png
Shortest Path from Noida City Centre to Noida Sector 18:
Noida City Centre -> Noida Golf Course -> Botanical Garden -> Noida Sector 18
done!!
Welcome to the metro path finder

***** Metro Rail Route Finder *****
1. Find Shortest Path
2. Find Most Economical Path
3. Recharge Metro Card
Enter your choice: 0
Logging out. Goodbye!
1. Login
2. Sign up
3. Exit
Enter your choice (1-3): 3
Exiting the program. Goodbye!

Generated Images:

• Shortest Path
• Village Map

License

This project is licensed under the MIT License. See the LICENSE file for details.

Acknowledgments

Special thanks to the authors of Graphviz.

Note

this program has source and destination places hardcoded in the source code for simplicity