Label_Correcting_Algorithm

# Label_Correcting_Algorithm - Label Correcting Algorithm An...

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

Label Correcting Algorithm

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

View Full Document
2 An Example Initialize d(1) := 0; d(j) := for j 1 1 2 4 5 3 6 7 2 3 3 1 6 -2 3 2 -4 4 3 0 In next slides: the number inside the node will be d(j). Violating arcs will be in thick lines.
3 An Example Generic Step An arc (i,j) is violating if d(j) > d(i) + c ij. 0 2 3 3 1 6 -2 3 2 -4 4 3 Pick a violating arc (i,j) and replace d(j) by d(i) + c ij . 3

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

View Full Document
4 An Example Generic Step An arc (i,j) is violating if d(j) > d(i) + c ij. 0 2 3 3 1 6 -2 3 2 -4 4 3 Pick a violating arc (i,j) and replace d(j) by d(i) + c ij . 3 6
5 An Example Generic Step An arc (i,j) is violating if d(j) > d(i) + c ij. 0 2 3 3 1 6 -2 3 2 -4 4 Pick a violating arc (i,j) and replace d(j) by d(i) + c ij . 3 6 3

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

View Full Document
6 An Example Generic Step An arc (i,j) is violating if d(j) > d(i) + c ij. 0 2 3 3 1 6 -2 3 2 -4 4 3 Pick a violating arc (i,j) and replace d(j) by d(i) + c ij . 3 6 3 5
7 An Example Generic Step An arc (i,j) is violating if d(j) > d(i) + c ij. 0 2 3 3 1 6 -2 3 2 -4 4 3 Pick a violating arc (i,j) and replace d(j) by d(i) + c

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.

## This note was uploaded on 04/15/2010 for the course INDUSTRIAL ie513 taught by Professor Zeynephuygur during the Spring '10 term at Bilkent University.

### Page1 / 11

Label_Correcting_Algorithm - Label Correcting Algorithm An...

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

View Full Document
Ask a homework question - tutors are online