Maximum Matching

An overview

I give a Python implementation of Blossoms algorithm to find maximum matching in any undirected graph. I also write down unit tests to test the various functions in the algorithm.

GitHub repository

The code for this project and notes about the theory behind the algorithm can be found at https://github.com/nivbhaskhar/MaximumMatching