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, Operations Research, Optimization, Englishlanguage films, min c1

Click to edit the document details