C++ implementation of algorithms for finding perfect matchings in general graphs
A python implementation of Edmonds blossom algorithm for maximum-cardinality matching.
Advance algorithm implementations
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 C++ implementation of Edmonds' blossom algorithm to find maximum matchings in general graphs
A Python implementation of Edmond's blossom algorithm to find maximum matchings in general graphs
A distributed blossom algorithm for minimum-weight perfect matching
A ReScript implementation of the blossom maximum-matching algorithm.
Minimum Weight Perfect Matching
A C++ implementation of the blossom algorithm for maximum matching in general graphs.
An implementation of the blossom algorithm for constructing maximum matchings on graphs.
AGT course project on maximum matching in bipartite and general graphs
maximum cardinality matching by Edmonds' algorithm, an implementation based on union find data structure
Standalone C++23 solver and interactive CLI for undirected vertex geography using exact matching-based evaluation.
The Edmonds Blossom (aka the Blossom Algorithm), written in Swift
Maximum weighted matching for Boost.org graph module
Interactive browser tutorial for the weighted blossom algorithm (Edmonds 1965, Galil 1986) — primal-dual maximum matching with step-by-step visualization, dual variables, and pseudocode highlighting.
To associate your repository with the blossom-algorithm topic, visit your repo's landing page and select "manage topics."