Question

Dijkstra's algorithm

QUESTION 2 Consider the following weighted undirected graph: 10 We would like to find the shortest path from the node A to each other node. 1) What is the order in which nodes will be processed, using Dijkstra's algorithm? 2) What is the final found shortest path from A to each node? A.d = 0 B.d = C.d = D.d = E.d = F.d = G.d = H.d = I.d = 2.

Answer 1

Dijkktra's algurithm: ). Coreate Set SptSet (shortert path troe set) that Kaops in shorteRt path tree. track of ventiles încluded Asign a dietane valee to all vegticer în te input Traph. Initidize all dietane values as INFINITÉ. Aseign dirtante valece as O for the SOLoce veottee is picked fiorst So that twhile I). Spt Set doest include all veetilon Sptset a). Pick a vertere e which is not theore in har minimumm diftemce value and b). Include l to Spt Set C): Opdate dztanle valcce ob all ad jacent ventics ofcl Update the distame valees, Pterate thaough all adjalent veticoe. For if sum ob distamie. valeie of u (from SOUTC) and weight of edge u-v, is lees them the dirtane valece of v, adjacont vester u, every then update the distanie value o6 V.

Tijustras algorithm. (uning): 10 6. 4- Here A is the staatling node (oUTca) లాల్ 8. 8. 8. ది లి 12 :7! 16 12 12 15 14 16 «12 15 14 13 12 15 S14? 13 12 15 (A,C,B, D, G,F1, Ht 15 12 0 14 13 {A,C, 6,D, G, F,4,4 15 12 o 1Q: An8: 20: Ans : A → A = 0 A - B =6 A H - 14 AI = 13 15 12 C. Ln