#

general-graphs

Here are 3 public repositories matching this topic...

dilsonpereira / Minimum-Cost-Perfect-Matching

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

graphs combinatorial-optimization matching-algorithm edmonds-algorithm weighted-perfect-matching-algorithm general-graphs blossom-algorithm non-bipartite-matching maximum-cardinality-matching

Updated Jul 18, 2022
C++

Yorkyer / edmonds-blossom

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

suddhabrato / edmonds-blossom-algorithm

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

graph-theory general-graphs blossom-algorithm non-bipartite-matching maximum-cardinality-matching edmonds-blossom-algorithm blossom-shrinking-algorithm

Updated May 19, 2022
C++

Improve this page

Add a description, image, and links to the general-graphs topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the general-graphs topic, visit your repo's landing page and select "manage topics."