Matching can be seen as a special case: unit capacities, introduce a source to all L nodes, sink from all R nodes.
The matching algorithm we discussed is just one of the basic maximum flow algorithms running on this graph.
