#
blossom-shrinking-algorithm
Here are 3 public repositories matching this topic...
A C++ implementation of Edmonds' blossom algorithm to find maximum matchings in general graphs
graph-theorygeneral-graphsblossom-algorithmnon-bipartite-matchingmaximum-cardinality-matchingedmonds-blossom-algorithmblossom-shrinking-algorithm
- Updated
May 19, 2022 - C++
A C++ implementation of the blossom algorithm for maximum matching in general graphs.
- Updated
Nov 29, 2023 - C++
Edmonds' blossom shrinking algorithm for finding best matching in general graphs
- Updated
Dec 19, 2021 - C++
Improve this page
Add a description, image, and links to theblossom-shrinking-algorithm topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with theblossom-shrinking-algorithm topic, visit your repo's landing page and select "manage topics."