项目作者： yfzhang229
项目描述 ：
maximum cardinality matching by Edmonds' algorithm, an implementation based on union find data structure
高级语言： Python
项目地址: git://github.com/yfzhang229/matching-project.git
Matching Project
Towards the maximum cardinality matching problem in general graphs, oue of the most remarkable work is the Edmonds’ blossom algorithm. An implementation with the union find data structure can obtain $O(mn\alpha(m,n))$ complexity.
