Flow networks, maximum flow problem, Ford-Fulkerson algorithm, Edmonds-Karp algorithm, maximum bipartite matching
Understand when, why, and how to use the maximum flow algorithm.
Residual graphs, augmenting flows, and the min cut max flow theorem
Screencast Suthers 20 min
Ford-Fulkerson, Edmonds-Karp and Bipartite Matching.
Screencast Suthers 14 min
Flow networks, Ford-Fulkerson method, Maximum bipartite matching.
Textbook 29 pages
Flow networks, maximum flow problem, Ford-Fulkerson algorithm, Edmonds-Karp algorithm, maximum bipartite matching
Notes