C++ implementation of algorithms for finding perfect matchings in general graphs
-
Updated
Jul 18, 2022 - C++
C++ implementation of algorithms for finding perfect matchings in general graphs
Advance algorithm implementations
A C++ implementation of Edmonds' blossom algorithm to find maximum matchings in general graphs
A C++ implementation of the blossom algorithm for maximum matching in general graphs.
Maximum weighted matching for Boost.org graph module
Add a description, image, and links to the blossom-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the blossom-algorithm topic, visit your repo's landing page and select "manage topics."