DMOR-05-03 - UF-ESI-6314 DMOR-05-03.xls Problem Statement...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: UF-ESI-6314 DMOR-05-03.xls Problem Statement page 1 of 2 05-03. Find the shortest path from node 1 to all other nodes using Dijkstra's algorithm. that the numbers next to the arcs are the flow costs. Please show your work. Assume 2 5 1 7 5 3 4 6 4 7 2 6 4 3 2 8 5 7 Luther Setzer 1 NASA Pkwy E Stop NEM3, Kennedy Space Center, FL 32899 (321) 544-7435 UF-ESI-6314 Per DMOR Class Notes 4: DMOR-05-03.xls Solution page 2 of 2 Step 1: Choose a node j* such that u j* has not been permanently labeled, and such that u j* ≤ u k for all nodes k that have not been permanently labeled. Step 2: Examine all arcs (i , j* ). For each such arc, if u i > u j* + c ij* (where c ij is the cost of traveling on arc (i , j )), then we have a new best way of getting to node n from node i : use arc (i , j* )! Set u i = u j* + c ij* . Step 3: Permanently label node j*. If all nodes have been permanently labeled, then stop. Else, repeat Step 1. (We can actually stop in Step 1 if j* = 1.) 5 2 5 6 12 4 11 4 2 13 7 4 7 3 2 9 5 7 18 8 15 6 10 0 1 5 3 5 Luther Setzer 7 14 (321) 544-7435 1 NASA Pkwy E Stop NEM3, Kennedy Space Center, FL 32899 ...
View Full Document

Page1 / 2

DMOR-05-03 - UF-ESI-6314 DMOR-05-03.xls Problem Statement...

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