A C++ implementation of Edmonds' blossom algorithm to find maximum matchings in general graphs
The Edmonds Blossom (aka the Blossom Algorithm), written in Swift
An implementation of Edmonds Blossom algorithm for maximum matchings
Eleventh assignment for Software Engineering course @USI19/20.
Solutions for various Kattis programming challenges about optimisation algorithms
This repository implements Branch and Bound, Exhaustive Search, and Edmonds' Blossom Algorithm for the roommate matching problem. It simulates student compatibility data and evaluates efficiency. Blossom is the fastest, while Branch and Bound achieves comparable performance for mid-scale datasets with greater flexibility.
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."