A C++ implementation of Edmonds' blossom algorithm to find maximum matchings in general graphs
-
Updated
May 19, 2022 - C++
A C++ implementation of Edmonds' blossom algorithm to find maximum matchings in general graphs
Edmonds' blossom shrinking algorithm for finding best matching in general graphs
A C++ implementation of the blossom algorithm for maximum matching in general graphs.
Add a description, image, and links to the blossom-shrinking-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the blossom-shrinking-algorithm topic, visit your repo's landing page and select "manage topics."