# How to find the a minimum cost perfect matching

Crossposted on Wolfram Community

But the in-built FindIndependentEdgeSet seem treat weight graph as non-weight graph directly,this often make me depressed.I found a ready-made algorithm for min cost perfect matching here.But as this declaration

The code above is licensed for research purposes only.

I don't sure Wolfram Research will have impetus to add this feature for FindIndependentEdgeSet in future.Can anyone be willing to implement this algorithm in Mathematica or more high efficiency method to improve FindIndependentEdgeSet?As I know,Blossom V itself is very high-efficiency.

Also,I hope the answer can meet a additional demand,that is it can accept negative edge weight value.Then if we use the negative weight value,we can get a maximal cost perfect matching,which is promising.