Graph Theory Math Ia 👑 ✨

Unvisited min = A(200). Current = A. Neighbors: S(200+200 no better), B(200+150=350 vs current 350 tie), C(200+400=600), D(200+310=510). Update: C=600, D=510. Visited S,A.

1. Introduction Aim: To determine the most efficient (shortest) route for a delivery driver in a local suburban network using graph theory, and to compare the effectiveness of Dijkstra’s algorithm against simple visual inspection. graph theory math ia

Unvisited min = F(730). Current = F. Neighbors: D(no), E(no), T(730+90=820 vs 1010 → update T=820). Visited add F. Unvisited min = A(200)

I used Google Maps for weights and could extend to Excel/Python. B(200+150=350 vs current 350 tie)