Modified_Label_Correcting_Algorithm

# Modified_Label_Correcting_Algorithm - Modified Label...

This preview shows pages 1–6. Sign up to view the full content.

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

View Full Document

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

View Full Document

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Modified Label Correcting Algorithm 2 The Modified Label Correcting Algorithm 3 Initialize ∞ ∞ d(1) := 0; d(j) := ∞ for j ≠ 1 1 2 5 4 3 6 7 2 3 3 1 6-2 3 2-4 4 3 ∞ ∞ ∞ ∞ In next slides: the number inside the node will be d(j). LIST := {1} 3 LIST := { 1 } An Example 3 Generic Step Take a node i from LIST ∞ ∞ ∞ ∞ ∞ ∞ 2 3 3 1 6-2 3 2-4 4 3 Update(i): for each arc (i,j) with d(j) > d(i) + c ij replace d(j) by d(i) + c ij . 3 LIST := {1} LIST := { } 6 LIST := { 2 } LIST := { 2, 3 } 3 LIST := { 2, 3, 4 } 4 An Example 3 Take a node i from LIST ∞ ∞ ∞ ∞ ∞ ∞ 2 3 3 1 6-2 3 2-4 4 3 Update(i): for each arc (i,j) with d(j) > d(i) + c ij replace d(j) by d(i) + c ij . 3 LIST := {1} LIST := { } 6 LIST := { 2 } LIST := { 2, 3 } 3 LIST := { 2, 3, 4 } 3 LIST := { 3, 4 } 4 5 LIST := { 3, 4, 5 } 5 An Example 3 Take a node i from LIST ∞ ∞ ∞ ∞ ∞ ∞ 2 3 3 1 6-2 3 2-4 4 3 Update(i): for each arc (i,j) with d(j) > d(i) + c ij replace d(j) by d(i) + c ij ....
View Full Document

{[ snackBarMessage ]}

### Page1 / 11

Modified_Label_Correcting_Algorithm - Modified Label...

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

View Full Document
Ask a homework question - tutors are online