Recall last time we spoke about bipartite matching. The fundamental algorithmic idea was that of finding an augmenting path.
The proof that this leads to a maximum matching depended on the min-cut max-flow theorem, of which we proved a special case.
We'll now briefly talk about another problem that is solved using the same basic ideas.
