#undirected-graph #maximum #matching #algorithm

blossom

Implementation of the Blossom algorithm to get a maximum matching in an undirected graph

10 releases

0.4.0 Nov 26, 2020
0.3.3 Dec 26, 2017
0.3.1 Nov 26, 2017
0.2.0 Nov 20, 2017
0.1.2 Jul 17, 2017

#1098 in Algorithms

MIT license

34KB
895 lines

blossom

Rust crate to obtain maximum matchings in undirected graphs

No runtime deps