DMOR-05-03 - UF-ESI-6314...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
UF-ESI-6314 97dceb3f3177651aaf4d5146c382dd55d76f8aa3.xls Problem Statement page 1 of 2 Luther Setzer 1 NASA Pkwy E Stop NEM3, Kennedy Space Center, FL 32899 (321) 544-7435 05-03. Find the shortest path from node 1 to all other nodes using Dijkstra's algorithm. Assume that the numbers next to the arcs are the flow costs. Please show your work. 1 2 3 4 5 6 7 5 5 4 7 2 6 7 3 2 8 4
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
UF-ESI-6314 97dceb3f3177651aaf4d5146c382dd55d76f8aa3.xls Solution page 2 of 2 Luther Setzer 1 NASA Pkwy E Stop NEM3, Kennedy Space Center, FL 32899 (321) 544-7435 Per DMOR Class Notes 4: Step 3: Permanently label node j*. If all nodes have been permanently labeled, then stop.
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/25/2010 for the course ESI 6314 taught by Professor Vladimirlboginski during the Fall '09 term at University of Florida.

Page1 / 2

DMOR-05-03 - UF-ESI-6314...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online