MaxFlow

School project solving the problem of finding the maximum matching in a given bipartite graph. This is a solution using the Ford-Fulkerson algoritm and reducing the problem to an instance of the maximum-flow problem.