Network Flow. Bipartite matching is an example of Ford Fulkerson's algorithm for finding maximum flow. An example
Right-click 'Download' and select 'Save Link As' if the file opens in a new tab.
