Dijkstra’s Algorithm - Table Fi Mietonsmnn seranemetentommee Steps a Geatea aie Start ertexiefirstrow ES OTE res] a +Other vertices asthe columns (order doesnt matter) | ____ [Complete fist row 7 eee ence P| . eebSetnetunaacrarace | Of & © < Setintentimtnaecm | | eed eee ns nos eft. ‘+ Copy down the boxed number jit ‘+ Forthe other vertices add the boxed numbertothe | | 2) distance from the row vertex to the column vertex. Big bsu ‘+ Choose the smaller number fom the total or the umber above 4 4+ Haverteris not connectes put 2 cross {baw 2 box around the smallest unboxed number © Complete further rows | "> Repeat step 3, Uni the destination vertex value has box around it 5 Bae enti the shore path ands erth + "Start the box vale forthe destaton vet {Srna in up the aur to he st ruber hati —| the some ate boxed umber katte ow forts number and draw ‘rant! ine the co ots ert -) | + Srewaverialineup he earn. repeat unt he Sortsveached >) | + Thehorarta nes represen the shortest path {The dstnaton boxed number the sets engthDilkstra’s Algorithm Questions Heffernan 2006 Question 2 ow shows the dtanes, nmses nga sees of acs oaeins aE Ge=N pack bythe sea “he network be >| re ora eee ath between te office and the amenities Bock tF? a. Whatiethe lent ofthe shortest1am 2007 Quest per ocurrs al ca AGT te aN cll s @a7 4 xn ew x — | ie s 6a WM . x ee lf) © G41 We ol sip g@ os | oj 6 6) A) @e s@ i. 4} FO € @G Gu #@ : if? © 8 @ G1 Seo