Question

Data Structures – Test D (Java)

5. Trace Dijkstra’s algorithm starting from for the graph represented in the handout.
   From the algorithm’s output, determine the shortest path from to $IIUl3PdhLQr2gaeIAAAAASUVORK5CYII=$?

Test B To AM 7 6 4 3 2 0 1 11 5 0 From 2 7 7 5 1 2 1 1 7 3 5 4 6 1 5 4 2 6 1 LO O H un 7

Answer 1

1 7 1 14 Distagce Steps 4a 3 12 13 12 paanent Stepr 1 2 ND 1 1 - l2

20,1,2,3,9, 5, , Step-1 Acls Co)-1,a3 Chaose Relas (0d0) ol Co) +colo,1) ol Ci)05 ) - ) - 0 Relas(o, 3w)ol Co) + eo(0,3) ol2)0+ n <boal(a) 1 TT(3) 0 olelete Step-2 a1,2,3 9, 5,6, AdsCi ,s chooze Relax (1,2 ) -)ok) + coC, 2) ol (2)6+ 7<do -12, T(2)- 1 ) 12, T) 1 os)= 7,T(s) -1 Relax(4,4,) olC)+ co C,4 <dl(4) 5-+ Relax(i,sco) it eoCi,s) <ol(s)51T 2 cdelete L. gtep--& 2, 3,4,5,6, chocy.e 5 Aols(s) 1, Rolarf 5,4,0) ) d(s)+co(5,4)< ol ( 7+1< 12 ol(4) 8, TT(4) S Relars (5,o) -ol(s) + cod(s,t) olelete s 8t ep 2,3,4, e, Chocxe 4, Aol(4)e Relar(4,6,) d toly6)< ol Ce) of C6) = 13 (6) -4 8 +5 < delete 시 2,, 6,7Chose 3. Steps a AdloC2)4,s7 bince and s arte ot n queee 0 coc not effeet Relax its oalue Relax (2,0) - d(3) + tal3)o( +13 13 oC7)= 12,TT7)3 cletete a Step 6 2,6, choose a, AoloC2) 4 dcoce xot cn queue 3 and ane Relars may not be applecable anol cocll not any effeet. et axe theo d clelete 2 gtee t e$6,t chocre 7, Aolat)54.3 effeet Qle 0ot in gueue lelete nce 4 Relas (,4-co) co 6, Aol(6) = Ses, 7}. teps choose at el ot affect Relas (6,1,0) Relcrs (,5,0) and Ae'ne e olelete empty. So Stop the pace egs, Stgce

be wul 9παρh faal V2 Vo V3 2 1 he shorctest path from 7Cro,va YoY7 ano to axt col be li+l = 12