This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 4. Problem #15, BHM Chapter 11. 5. Consider the example on page 5 oF the shortest path notes. or j = 1 , . . . , 6 , compute the values v j (5) = min 1 i 6 { v i (4) + c ij } . Do the values v j (5) dier From v j (4) ? Why? Now change c 36 From 3 to3 (the remaining data are unchanged). Redo the computation For the modifed graph (From scratch!). Are the v j (4) and v j (5) values dierent? Why? The Following problems are to be handed in. 1. Problem #7, BHM Chapter 11. 2. Problem #17, BHM Chapter 11. 3. Problem #18, BHM Chapter 11. 4. Problem #19, BHM Chapter 11. 5. Problem #22, BHM Chapter 11. 1...
View
Full
Document
 Spring '08
 TODD

Click to edit the document details