A python implementation of Edmonds blossom algorithm for maximum-cardinality matching.
-
Updated
Aug 23, 2023 - Python
A python implementation of Edmonds blossom algorithm for maximum-cardinality matching.
My solutions to Google's Foobar Challenge for coding data structures and algorithms. Includes my solution code, unit tests, background notes, design notes, and references.
A Python implementation of Edmond's blossom algorithm to find maximum matchings in general graphs
An implementation of the blossom algorithm for constructing maximum matchings on graphs.
maximum cardinality matching by Edmonds' algorithm, an implementation based on union find data structure
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."