This project is a map-based route optimization system built using Python, OSMnx, NetworkX, and Folium. The system finds the shortest path and second shortest path between two locations, calculates ...

Bellman-Ford vector updates: $D_x(y) = \min_v { c(x, v) + D_v(y) }$. Split-horizon routing updates preventing loop formation.