6ehw4 - with nonnegative edge lengths. Problem 3. (16 pts...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
National Taiwan University Handout #19 Department of Electrical Engineering December 31, 2009 Algorithms, Fall 2009 Yao-Wen Chang Name: Student ID: Web ID: Problem 1. (8 pts total) Does either Prim’s or Kruskal’s minimum-spanning-tree algorithm work if there are negative edge weights? Justify your answer. Problem 2. (16 pts total) A longest path is a directed path from node s to node t with the maximum length. Give a linear-time algorithm for determining a longest path in an acyclic graph
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: with nonnegative edge lengths. Problem 3. (16 pts total) In the flow network shown below, the number beside an edge denotes its corresponding capacity. Find the maximum flow from node a to g in the network. Show every augmentation path (but you do not need to show the whole network to save time) and explain why the final flow that you obtained is maximum. a 3 3 3 2 5 4 2 1 6 5 6 b c d e f g...
View Full Document

Ask a homework question - tutors are online