Python simulation of the London Underground network that finds the fastest route between stations using weighted graph algorithms. Includes dynamic connections and optimization for travel time and network efficiency.
🧭 Overview
This project simulates the London Underground network and calculates the fastest route between stations using graph theory and pathfinding algorithms. Each station is represented as a node, and connections are weighted by travel time. The model includes a probability-based system for adding random connections to simulate real-world dynamic routes and delays.
⚙️ Features
🗺️ Graph-based network model representing Tube stations and connections
⚡ Fastest route calculation using Dijkstra’s or A* algorithms
🔁 Dynamic edge generation with a small chance of additional connections between nodes
⏱️ Optimized for travel time and efficiency
📊 Route visualization and detailed path output
🧠 Technical Details
Language: Python
Core Concepts: Graph Theory, Pathfinding, Network Optimization
Algorithms Used: Dijkstra’s Algorithm, A* Search
Libraries:
networkx for graph construction and traversal
matplotlib (optional) for visualizing the network and paths
random for dynamic edge simulation