I implemented a journey planner that uses Dijkstra’s algorithm to find the shortest path between two stations in the simulated network.
- Core features developed: Origin and destination selection UI, Graph‑based route finding using Dijkstra’s algorithm, Station‑by‑station journey itineraries, Transfer detection between connected corridors, Interactive map route highlighting, Handling disconnected stations and "Invalid journey" message.
I learned that finding a valid route is separate from estimating travel time; accurate travel‑time estimates need configured travel‑time data rather than assumptions.