#

non-bipartite-matching

Here is 1 public repository matching this topic...

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

Improve this page

Add a description, image, and links to the non-bipartite-matching 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 non-bipartite-matching topic, visit your repo's landing page and select "manage topics."