Finds the maximum (potentially perfect) matching of a graph in polynomial time.