A C++ implementation of the famous blossom algorithm for maximum matchings in general graphs. It was developed by Jack Edmonds in 1961, a detailed description can be found here.
For the algorithm a custom Graph class is used, which stores undirected graphs.
(c) Mia Muessig