Graph Theory Math Ia -

Unvisited min = E(630). Current = E. Neighbors: B(no), C(no), F(630+100=730 vs 810 → update F=730). Visited add E.

Unvisited min = C(530). Current = C. Neighbors: A(no), B(no), D(no), E(530+250=780 vs 630 no). Visited S,A,B,D,C.

| Edge | Weight | Edge | Weight | |------|--------|------|--------| | S–A | 200 | B–C | 180 | | S–B | 350 | C–D | 120 | | A–B | 150 | C–E | 250 | | A–C | 400 | D–F | 300 | | B–D | 220 | E–F | 100 | | B–E | 280 | F–T | 90 | | A–D | 310 | D–T | 500 (direct but long) | graph theory math ia

Destination T reached (820). Stop.

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. Unvisited min = E(630)

I used Google Maps for weights and could extend to Excel/Python.

Sorted edges: F–T(90), C–D(120), A–B(150), B–C(180), S–A(200), B–D(220), C–E(250), B–E(280), D–F(300), A–D(310), S–B(350), A–C(400), D–T(500). Visited add E

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.

Current = S (distance 0). Neighbors: A(200), B(350). Update: A=200, B=350. Visited = S.

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