A DSA-focused Java project that simulates the Delhi Metro network using graphs and heaps. Computes shortest routes and fares between stations using Dijkstra and BFS algorithms. Includes a CLI interface and interactive map for route visualization.