Network flow stems from our original Bipartite Matching problem. This problem can model situations where objects need to be matched and when we need collections of pairs. We could also look for the largest matching set.