Graph Theory - Math Ia

(sort edges by weight, add if no cycle):

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

Unvisited min = D(510). Current = D. Neighbors: A(no), B(no), C(510+120=630 vs 530 no), F(510+300=810), T(510+500=1010). Update T tentative = 1010. Visited S,A,B,D. (sort edges by weight, add if no cycle):