The algorithm is taken from “Efficient Algorithms for Finding Maximum Matching in Graphs” by Zvi Galil, ACM Computing Surveys, 1986. It is based on the “blossom” method for finding augmenting paths and the “primal-dual” method for finding a matching of maximum weight, both methods invented by Jack Edmonds.
| max_weight_matching(G[, maxcardinality]) | Compute a maximum-weighted matching in the undirected, weighted graph G. |