Delhi Metro Route Finder
A terminal-based graph algorithm implementation for finding optimal routes in the Delhi Metro system
About the Problem
This program solves metro route optimization using graph algorithms on real Delhi Metro data. Originally written in Java as a university coursework project, it's been translated to TypeScript and integrated into a web terminal interface.
The implementation demonstrates:
- Graph representation of metro networks with stations and lines
- BFS algorithm for shortest path calculation
- DFS with backtracking for finding all possible paths
- Connection hub analysis for transfer stations
- Interactive terminal interface with real Delhi Metro data
Technologies Used
- Java → TypeScript
- Graph Theory
- BFS Algorithm
- DFS with Backtracking
- xterm.js Terminal
Features
- Shortest path calculation
- All paths enumeration
- Connection hub detection
- Real Delhi Metro data
- Interactive terminal UI
Algorithm Details
- • Graph with stations as nodes
- • Adjacent stations connected by edges
- • BFS for shortest path: O(V + E)
- • DFS for all paths: exponential complexity
- • HashMap for O(1) station lookup