Maximum Matching for General Weighted Graph
Blossom's algorithm
Maximum Matching
Computes the maximum matching for unweighted graph and maximum matching for (un)weighted bipartite graph efficiently.