We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
The GraphMatching library provides efficient algorithms for maximum cardinality and weighted matchings in undirected graphs.
GraphMatching