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).
Unvisited min = E(630). Current = E. Neighbors: B(no), C(no), F(630+100=730 vs 810 → update F=730). Visited add E.
Destination T reached (820). Stop.
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.
(sort edges by weight, add if no cycle): 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.
I defined terms clearly, used consistent notation (( G=(V,E) )), and showed step-by-step tables. Neighbors: B(no), C(no), F(630+100=730 vs 810 → update
Unvisited min = B(350). Current = B. Neighbors: S(no), A(350+150=500 vs 200 no), C(350+180=530 vs 600 → update C=530), D(350+220=570 vs 510 no), E(350+280=630). Visited S,A,B.