A C++ implementation of Edmonds' blossom algorithm to find maximum matchings in general graphs
-
Updated
May 19, 2022 - C++
A C++ implementation of Edmonds' blossom algorithm to find maximum matchings in general graphs
Solutions for various Kattis programming challenges about optimisation algorithms
An implementation of Edmonds Blossom algorithm for maximum matchings
Eleventh assignment for Software Engineering course @USI19/20.
Add a description, image, and links to the edmonds-blossom-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the edmonds-blossom-algorithm topic, visit your repo's landing page and select "manage topics."