https://github.com/adharshkamath/edmonds-algorithm
A Python implementation of Edmond's blossom algorithm to find maximum matchings in general graphs
https://github.com/adharshkamath/edmonds-algorithm
blossom blossom-algorithm edmonds-algorithm graph graph-matching matching matching-algorithm
Last synced: 4 months ago
JSON representation
A Python implementation of Edmond's blossom algorithm to find maximum matchings in general graphs
- Host: GitHub
- URL: https://github.com/adharshkamath/edmonds-algorithm
- Owner: adharshkamath
- Created: 2020-03-10T14:31:20.000Z (almost 6 years ago)
- Default Branch: master
- Last Pushed: 2020-08-08T07:22:08.000Z (over 5 years ago)
- Last Synced: 2025-07-03T06:07:35.865Z (6 months ago)
- Topics: blossom, blossom-algorithm, edmonds-algorithm, graph, graph-matching, matching, matching-algorithm
- Language: Python
- Homepage:
- Size: 328 KB
- Stars: 8
- Watchers: 0
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# 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.