An implementation of the blossom algorithm for constructing maximum matchings on graphs.
-
Updated
May 23, 2020 - Python
An implementation of the blossom algorithm for constructing maximum matchings on graphs.
A Python implementation of Edmond's blossom algorithm to find maximum matchings in general graphs
An implementation of Edmonds Blossom algorithm for maximum matchings
Add a description, image, and links to the blossom topic page so that developers can more easily learn about it.
To associate your repository with the blossom topic, visit your repo's landing page and select "manage topics."