GitHub / adharshkamath / Edmonds-Algorithm
A Python implementation of Edmond's blossom algorithm to find maximum matchings in general graphs
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/adharshkamath%2FEdmonds-Algorithm
Stars: 5
Forks: 1
Open issues: 0
License: None
Language: Python
Size: 328 KB
Dependencies parsed at: Pending
Created at: about 5 years ago
Updated at: about 4 years ago
Pushed at: almost 5 years ago
Last synced at: about 2 years ago
Topics: blossom, blossom-algorithm, edmonds-algorithm, graph, graph-matching, matching, matching-algorithm
Loading...