Publisher review:Maximum cardinality matching in general graphs script implements Edmonds' blossom-contraction algorithm for maximum cardinality matching. This is an implementation of Edmonds' blossom-contraction algorithm for maximum cardinality matching in general graphs.
Maximum cardinality matching in general graphs 1.1 is a Python script for Programming Methods and Algorithms scripts design by David Eppstein.
It runs on following operating system: Windows / Linux / Mac OS / BSD / Solaris.
implements Edmonds' blossom-contraction algorithm for maximum cardinality matching.
Operating system:Windows / Linux / Mac OS / BSD / Solaris