Delhi Metro Route Finder built using Python, Tkinter, Graphs, and Breadth-First Search (BFS) to find the shortest route between metro stations.
-
Updated
Jun 22, 2026 - Python
Delhi Metro Route Finder built using Python, Tkinter, Graphs, and Breadth-First Search (BFS) to find the shortest route between metro stations.
Metro Router is a graph-based route planning web app which models metro network as a weighted graph, supporting efficient route, distance, and interchange calculations to compute the optimal path between metro stations using Dijkstra's shortest path. It follows a modular architecture and simulate real-world metro navigation.
Official public branding repo for MetroYatra – India’s Metro Route Finder App/Website
🚇 Navigate India's metro systems effortlessly with MetroYatra, your go-to route planner for quick and reliable travel information.
Add a description, image, and links to the metro-route-finder topic page so that developers can more easily learn about it.
To associate your repository with the metro-route-finder topic, visit your repo's landing page and select "manage topics."