Download presentation
Presentation is loading. Please wait.
Published byAmari Hargreaves Modified over 3 years ago
1
15.082 and 6.855J Modified Label Correcting Algorithm
2
2 The Modified Label Correcting Algorithm 3 Initialize d(1) := 0; d(j) := for j 1 1 2 5 4 36 7 2 3 3 1 6 -2 3 2 -4 43 0 In next slides: the number inside the node will be d(j). LIST := {1}
3
3 An Example 3 Generic Step Take a node i from LIST 0 2 3 3 1 6 -2 3 2 -4 43 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 } 0
4
4 An Example 3 Take a node i from LIST 0 2 3 3 1 6 -2 3 2 -4 43 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
5 An Example 3 Take a node i from LIST 0 2 3 3 1 6 -2 3 2 -4 43 Update(i): for each arc (i,j) with d(j) > d(i) + c ij replace d(j) by d(i) + c ij. 3 6 3 4 5 LIST := { 3, 4, 5 } 3 LIST := { 4, 5 }
6
6 An Example 3 Take a node i from LIST 0 2 3 3 1 6 -2 3 2 -4 43 Update(i): for each arc (i,j) with d(j) > d(i) + c ij replace d(j) by d(i) + c ij. 3 6 3 4 5 LIST := { 3, 4, 5 } LIST := { 4, 5 } 4 LIST := { 5 } 6 LIST := { 5, 6 }
7
7 An Example 3 Take a node i from LIST 0 2 3 3 1 6 -2 3 2 -4 43 Update(i): for each arc (i,j) with d(j) > d(i) + c ij replace d(j) by d(i) + c ij. 3 6 3 4 5 LIST := { 3, 4, 5 } LIST := { 4, 5 }LIST := { 5 } 6 LIST := { 5, 6 } 5 LIST := { 6 }
8
8 An Example 3 Take a node i from LIST 0 2 3 3 1 6 -2 3 2 -4 43 Update(i): for each arc (i,j) with d(j) > d(i) + c ij replace d(j) by d(i) + c ij. 3 6 3 4 5 LIST := { 3, 4, 5 } LIST := { 4, 5 }LIST := { 5 } 6 LIST := { 5, 6 }LIST := { 6 } 6 LIST := { } 2 LIST := { 3 } 9 LIST := { 3, 7 }
9
9 An Example 3 Take a node i from LIST 0 2 3 3 1 6 -2 3 2 -4 43 Update(i): for each arc (i,j) with d(j) > d(i) + c ij replace d(j) by d(i) + c ij. 3 6 3 4 5 LIST := { 3, 4, 5 } LIST := { 4, 5 }LIST := { 5 } 6 LIST := { 5, 6 }LIST := { 6 }LIST := { } 2 LIST := { 3 } 9 LIST := { 3, 7 } 2 LIST := { 7 }
10
10 An Example 3 Take a node i from LIST 0 2 3 3 1 6 -2 3 2 -4 43 Update(i): for each arc (i,j) with d(j) > d(i) + c ij replace d(j) by d(i) + c ij. 3 6 3 4 5 LIST := { 3, 4, 5 } LIST := { 4, 5 }LIST := { 5 } 6 LIST := { 5, 6 }LIST := { 6 }LIST := { } 2 LIST := { 3 } 9 LIST := { 3, 7 }LIST := { 7 } 9 LIST := { }
11
11 An Example 3 LIST is empty. The distance labels are optimal 0 2 3 3 1 6 -2 3 2 -4 43 3 6 3 4 5 LIST := { 3, 4, 5 } LIST := { 4, 5 }LIST := { 5 } 6 LIST := { 5, 6 }LIST := { 6 }LIST := { } 2 LIST := { 3 } 9 LIST := { 3, 7 }LIST := { 7 }LIST := { } Here are the predecessors
Similar presentations
© 2018 SlidePlayer.com Inc.
All rights reserved.
Ppt on satellites launched by india Download free ppt on p-block elements Download ppt on indus valley civilization pictures Ppt on united nations and its various organs Ppt online shopping projects Ppt on natural resources and their conservation Ppt on grooming and etiquettes of life Ppt on college website Ppt on preparedness for disaster in india Ppt on good manners for kindergarten