maximum cardinality matching by Edmonds' algorithm, an implementation based on union find data structure

The Edmonds Blossom (aka the Blossom Algorithm), written in Swift

A C++ implementation of the blossom algorithm for maximum matching in general graphs.

Maximum weighted matching for Boost.org graph module

AGT course project on maximum matching in bipartite and general graphs

An implementation of the blossom algorithm for constructing maximum matchings on graphs.

A ReScript implementation of the blossom maximum-matching algorithm.

A Python implementation of Edmond's blossom algorithm to find maximum matchings in general graphs

A C++ implementation of Edmonds' blossom algorithm to find maximum matchings in general graphs

A distributed blossom algorithm for minimum-weight perfect 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 Edmonds blossom algorithm for maximum-cardinality matching.

Advance algorithm implementations

A Reason implementation of the blossom maximum-matching algorithm

C++ implementation of algorithms for finding perfect matchings in general graphs