dilsonpereira / Minimum-Cost-Perfect-Matching

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

Date Created 2018-05-22 (6 years ago)

Commits 24 (last one 5 years ago)

Stargazers 68 (0 this week)

Watchers 3 (0 this week)

Forks 18

License mit

Ranking

RepositoryStats indexes 609,829 repositories, of these dilsonpereira/Minimum-Cost-Perfect-Matching is ranked #388,710 (36th percentile) for total stargazers, and #430,879 for total watchers. Github reports the primary language for this repository as C++, for repositories using this language it is ranked #21,742/32,640.

All Topics

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

Star History

Github stargazers over time

Watcher History

Github watchers over time, collection started in '23

Recent Commit History

0 commits on the default branch (master) since jan '22

No recent commits to this repository

Yearly Commits

Commits to the default branch (master) per year

Issue History

Languages

The only known language in this repository is C++

updated: 2024-12-11 @ 05:27pm, id: 134339080 / R_kgDOCAHaCA