The Metro App

Navigating complex metro networks can be confusing for commuters, especially when determining the shortest travel route and estimating fares across multiple stations. Manual planning is inefficient and prone to errors.

Modeled the metro network as a weighted graph and implemented Dijkstra's, Breadth-First Search, and Depth-First Search algorithms to compute optimal routes. Integrated the routing engine with a full-stack application that dynamically calculates fares based on travel distance.

Delivered a responsive metro navigation application that generates the shortest route, estimates travel fares, and improves commuter experience through efficient graph-based pathfinding algorithms.