GitHub topics: general-graphs
dilsonpereira/Minimum-Cost-Perfect-Matching
C++ implementation of algorithms for finding perfect matchings in general graphs
Language: C++ - Size: 30.3 KB - Last synced at: almost 2 years ago - Pushed at: almost 3 years ago - Stars: 52 - Forks: 17
yorkyer/edmonds-blossom
A python implementation of Edmonds blossom algorithm for maximum-cardinality matching.
Language: Python - Size: 12.7 KB - Last synced at: over 1 year ago - Pushed at: over 1 year ago - Stars: 8 - Forks: 6
suddhabrato/edmonds-blossom-algorithm
A C++ implementation of Edmonds' blossom algorithm to find maximum matchings in general graphs
Language: C++ - Size: 1.99 MB - Last synced at: about 2 years ago - Pushed at: about 3 years ago - Stars: 2 - Forks: 1
