how to find the minimum-weight perfect matching if the graph is not bipartite in python

Question

the concept of perfect matching in wiki:

A perfect matching is a matching that matches all vertices of the graph. That is, a matching is perfect if every