A Second Course in Algorithms (Lecture 2: Augmenting Path Algorithms for Maximum Flow)
Proof of the max-flow/min-cut theorem. Augmenting on shortest paths (Edmonds-Karp). The blocking flow approach (Dinic).
Full course playlist: • A Second Course in Algorithms (Stanford CS...
Lecture notes: http://timroughgarden.org/w16/l/l2.pdf