The GraphMatching library provides efficient algorithms for maximum cardinality and weighted matchings in undirected graphs.
GraphMatching
There was an error while loading. Please reload this page.