The Augmenting Path Algorithm for Bipartite Matching

Описание: Find a maximum matching and a minimum vertex cover in a bipartite graph using M-augmenting paths. This algorithm will either output an M-augmenting path or a vertex cover with size equal to the size of the matching.