This preview shows page 1. Sign up to view the full content.
Unformatted text preview: assume that one of the arc (i,j) in the minimum spanning tree of T is no longer available for G. Find the minimum spanning tree for the new graph G=(N, A\(i,j)) without running the minimum spanning tree algorithm again. 3. Section 8.2: Problem 1 4. Section 8.2: Problem 2 5. Use the algorithm for shortest path on acyclic graph to find the shortest path from node 1 to node 4 in Problem 4 (Section 8.2) 6. Section 8.2: Problem 5 7. Section 8.4: Problem 4 part(a) and part (b)...
View Full Document
- Spring '07
- Operations Research