1 / 11

OPIM 915 -- #7 Animation

OPIM 915 -- #7 Animation. Label Correcting Algorithm. An Example. . . 2. 4. 2. 3. 3. 3. 1. . . -2. 6. 1. 5. 7. 0. Initialize. 2. 3. 4. 3. d(1) := 0; d(j) :=  for j  1. -4. 3. 6. . . In next slides: the number inside the node will be d(j).

tevy
Télécharger la présentation

OPIM 915 -- #7 Animation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. OPIM 915 -- #7Animation Label Correcting Algorithm

  2. An Example   2 4 2 3 3 3 1   -2 6 1 5 7 0 Initialize 2 3 4 3 d(1) := 0; d(j) :=  for j  1 -4 3 6   In next slides: the number inside the node will be d(j). Violating arcs will be in thick lines.

  3. An Example 2  3  3 3 3 1 -2 6 0   Generic Step 2 3 4 3 An arc (i,j) is violating if d(j) > d(i) + cij. -4   Pick a violating arc (i,j) and replace d(j) by d(i) + cij.

  4. An Example 2  3  3 3 3 1 -2 6 0  6  Generic Step 2 3 4 3 An arc (i,j) is violating if d(j) > d(i) + cij. -4   Pick a violating arc (i,j) and replace d(j) by d(i) + cij.

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

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

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

  8. An Example 2 5  3  3 3 3 1 -2 6 0 6 4   Generic Step 2 3 4 3 An arc (i,j) is violating if d(j) > d(i) + cij. -4 3   6 Pick a violating arc (i,j) and replace d(j) by d(i) + cij.

  9. An Example 2 5  3  3 3 3 1 -2 6 0 6  4  Generic Step 2 3 4 3 An arc (i,j) is violating if d(j) > d(i) + cij. -4 3  2  6 Pick a violating arc (i,j) and replace d(j) by d(i) + cij.

  10. An Example 2 5  3  3 3 3 1 -2 6 0  6 4 9  Generic Step 2 3 4 3 An arc (i,j) is violating if d(j) > d(i) + cij. -4 3 2   6 Pick a violating arc (i,j) and replace d(j) by d(i) + cij.

  11. An Example 2 5  3  3 3 3 1 -2 6 0 4  6  9 Generic Step 2 3 4 3 An arc (i,j) is violating if d(j) > d(i) + cij. -4 2  3 6  Pick a violating arc (i,j) and replace d(j) by d(i) + cij. No arc is violating We now show the predecessor arcs. The distance labels are optimal

More Related