Welcome to the Metro Route Optimizer repository—a Python application that computes the shortest path between metro stations using Dijkstra's Algorithm.
The Metro Route Optimizer is a Python-based application designed to efficiently calculate the shortest routes within metro networks across various cities. This flexible system dynamically constructs adjacency matrices, allowing for easy adaptations to different metro systems.
- Shortest Path Calculation: Implements Dijkstra's Algorithm for efficient route finding.
- Flexible Metro System Design: Accommodates metro networks from multiple cities.
- Dynamic Adjacency Matrix Construction: Automatically builds adjacency matrices for various metro stations.
- Python (3.8 or above recommended)
- pip (Python package installer)
- Clone the repository:
git clone https://github.com/CodeBurnerrr/Metro-Route-Optimizer.git
- Navigate to the project directory:
cd Metro-Route-Optimizer
- Start the application by running:
python main.py
- Follow the on-screen prompts to choose a city and source station.
- The application will compute and display the shortest paths to all other stations.
This project is licensed under the MIT License - see the LICENSE file for details.
- Dhruv Mehta - CodeBurnerrr
- Janvi Kapadia - janvikapadia