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. Finally, I also give an interactive web-application built using Gradio which is deployed on Heroku. This web-app outputs a maximum matching given the adjacency matrix of a graph.

Web-app

Check out the MaxMatcher web-application at https://maxmatcher.herokuapp.com

GitHub repository

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