This preview shows page 1. Sign up to view the full content.
Unformatted text preview: s to t on the following graph. As we did in class, repeatedly nd the augmenting path and, if one exists, augment the ow. Start with any feasible (but suboptimal) ow. Next to each arc is its capacity. After you have found the optimal ow, determine a cut with minimum capacity. A B C 8 5 6 5 7 9 s t...
View
Full
Document
 Fall '08
 Staff
 Math

Click to edit the document details