Content deleted Content added
Line 180:
===Bipartite matching===
The algorithm reduces to the standard algorithm for matching in bipartite graphs<ref name = "karp notes"/> when ''G'' is [[bipartite graph|bipartite]]. As there are no odd cycles in ''G'' in that case, blossoms will never be found and one can simply remove lines
===Weighted matching===
| |||