adharshkamath / Edmonds-Algorithm

A Python implementation of Edmond's blossom algorithm to find maximum matchings in general graphs

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Edmonds-Algorithm

Code for the IT251 project - Implementing Edmonds blossom algorithm

To run the main file:

$ cd src
$ pip3 install -r requirements.txt
$ python3 main.py

Once the main file is run, a PNG image will be generated and opened, describing the input graph.

On closing this file, the algorithm will be run and the output graph will be generated and opened as another PNG image.

The edges in the matching will be colored red.

About

A Python implementation of Edmond's blossom algorithm to find maximum matchings in general graphs


Languages

Language:Python 100.0%