Yorkyer / edmonds-blossom Star 14 Code Issues Pull requests Discussions A python implementation of Edmonds blossom algorithm for maximum-cardinality matching. graph-matching matching-algorithm edmonds-algorithm general-graphs blossom-algorithm non-bipartite-matching maximum-cardinality-matching Updated Aug 23, 2023 Python
dilsonpereira / BipartiteMatching Star 4 Code Issues Pull requests Python implementation of algorithms for maximum cardinality matching and maximum cost assignment in bipartite graphs assignment-problem maximum-cardinality-matching primal-dual-algorithm bipartite-matching maximum-cost-matching Updated Jul 25, 2019 Python
yfzhang229 / matching-project Star 0 Code Issues Pull requests maximum cardinality matching by Edmonds' algorithm, an implementation based on union find data structure union blossom-algorithm maximum-cardinality-matching Updated Jun 14, 2020 Python