This preview shows page 1. Sign up to view the full content.
Unformatted text preview: with nonnegative edge lengths. Problem 3. (16 pts total) In the ﬂow network shown below, the number beside an edge denotes its corresponding capacity. Find the maximum ﬂow 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 ﬁnal ﬂow 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
- Fall '09
- Electrical Engineering