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

A python implementation of Edmonds blossom algorithm for maximum-cardinality matching.

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

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.