Unformatted text preview: source vertex s in a general weighted directed graph G = ( V, E ) (with no negative edge weights). ( 20 points ) 2. Problem 7.32, page 252. ( 20 points ) 3. Problem 7.39, page 253. (Note: The sought optimal path may start at any vertex and end at any other vertex.) ( 25 points ) 4. Problem 7.65, page 257. ( 20 points ) Total Points : 85...
View Full Document
- Spring '11
- Graph Theory, Analysis of algorithms, Shortest path problem, log |V, single-source shortest path