Madrid Subway Network Optimization via Graph Theory
<> SourceObjective
Represent the Madrid Metro system as a mathematical graph to study urban transit connectivity and compute optimal routes between stations through weighted shortest-path search.
Implementation
Constructed a graph from structured station data, modelling each station as a vertex and each direct connection as a weighted edge. Edge weights were derived from Euclidean distance over station coordinates, while route optimization was performed using Dijkstra’s algorithm. The system was exposed through a Streamlit web interface with interactive route visualization.
Outcome
Produced an end-to-end route optimization tool that allows users to query stations, analyse neighbouring connections, compute shortest paths, estimate total route distance, and visualize the resulting journey over an interactive map.