Skip to content

CodeBurnerrr/Metro-Route-Optimizer

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 

Repository files navigation

Metro-Route-Optimizer

Welcome to the Metro Route Optimizer repository—a Python application that computes the shortest path between metro stations using Dijkstra's Algorithm.

Overview

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.

Features

  1. Shortest Path Calculation: Implements Dijkstra's Algorithm for efficient route finding.
  2. Flexible Metro System Design: Accommodates metro networks from multiple cities.
  3. Dynamic Adjacency Matrix Construction: Automatically builds adjacency matrices for various metro stations.

Installation

Prerequisites:

  1. Python (3.8 or above recommended)
  2. pip (Python package installer)

Steps:

  1. Clone the repository:
    git clone https://github.com/CodeBurnerrr/Metro-Route-Optimizer.git
    
  2. Navigate to the project directory:
    cd Metro-Route-Optimizer
    

Usage

  1. Start the application by running:
python main.py
  1. Follow the on-screen prompts to choose a city and source station.
  2. The application will compute and display the shortest paths to all other stations.

License

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

Authors

About

No description, website, or topics provided.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages