#
general-graphs
Here are 3 public repositories matching this topic...
C++ implementation of algorithms for finding perfect matchings in general graphs
graphscombinatorial-optimizationmatching-algorithmedmonds-algorithmweighted-perfect-matching-algorithmgeneral-graphsblossom-algorithmnon-bipartite-matchingmaximum-cardinality-matching
- Updated
Jul 18, 2022 - C++
A python implementation of Edmonds blossom algorithm for maximum-cardinality matching.
graph-matchingmatching-algorithmedmonds-algorithmgeneral-graphsblossom-algorithmnon-bipartite-matchingmaximum-cardinality-matching
- Updated
Aug 23, 2023 - Python
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++
Improve this page
Add a description, image, and links to thegeneral-graphs topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with thegeneral-graphs topic, visit your repo's landing page and select "manage topics."