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.