This preview shows page 1. Sign up to view the full content.
Unformatted text preview: tree (right)). The shortest path tree contains the edges that are needed to get via a shortest path to each node (starting from node 1). a. How much must the cost on edge { 1 , 2 } increase in order to force it out of the shortest path tree? How is the shortest path tree going to change? b. How much must the cost on edge { 4 , 6 } decrease so that it becomes part of a shortest path? How will this change alter the shortest path tree? 5. Winston, page 419, Problem 9....
View
Full
Document
This note was uploaded on 06/01/2008 for the course ENGRI 1101 taught by Professor Trotter during the Fall '05 term at Cornell.
 Fall '05
 TROTTER

Click to edit the document details