Topic 20 B Residuals Augmenting Flows

Topic 20 B: Residual, Augmenting, Min/Max
Residual graphs, augmenting flows, and the min cut max flow theorem. More on Midway island.
Lecture by Dan Suthers for University of Hawaii Information and Computer Sciences course 311 on Algorithms. (Inverted course: lectures are online and problem solving in class.)
Based on Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms, Third Edition, The MIT Press, 2009.