Graph B Use the graph B above to trace the execution of Dijkstra’s algorithm as it...

Istart To z first we find weight of the edge between! fino nodes. А в c є € G H I 0 0 1 0 0 0 0 0 O 00 6 2 5 0 0 0 3 0 00 4 0 00 00 00 0 00 00 00 60 0 0 0 0 4 Oo oo 002 0 0 0 0 0 0 20 3 0 2 0 00 00 00 00 00 00 0 oo 81818181818 8 8 8

LE ✓ ✓ ✓vvvvv vertex L . Pistance selected 'A BICD E F G H I ⓇC 100 3000 40000 1000 TI 003 og 141800 16.3 10 9 4 80080 А 1630l748oo 800 TC,B,C,Q. AS 16 13/074811 8 oo {c.B, E.AIDI 6310748111810 7,B,E,A,PIFSH 6 307 48/108 lg. TC.B, E, A,D,F.HB 6 3 0 7 4 8/108 g SC, B, E, A,D,F,H.IS 6 3 0748101 89 fc, Bik, AP.F,4,5,6] - 63 10174810189 [6.B CC. BET - steps initially starting from a so vat distance from a to all other vertices is. c2 = 0, cx3 = 3 , c4c-, C P -0, ceza, cff=00, CG=00, CH=00 41:00. There is no edge between the node then write oo, and always choose the minimum distance steer Selected node vertices fs B, because distance is minimum je 3. so distance from a to all other vertices is with ter selected vertex B [email protected] > A=. (C,B)→B: 3 C. B 020, CO D =9, (C,D) E = 4, CC, B) F-8 [C, D G 200 (C,D) H=00 (6o1-00 is.

Step - Now selected vertex is E, because distance is minimum te a. so distance from a to all other vertices with selected vertices, B.4G is. abit)YA-6, C,BAHSB:3 6;BADJ6:0 CBE)-D 59C,B,A)%E246C,B,A)-8=8 (C.B, E) G =00, CIBIA) H=8,(C,B,A) I=00.

Similarly we can find all other vertices and always choose the minimum distance. :: Resulting vertex weighted graph 13

path | Above is to all from the shortest other vertices. a