joris
/
maximum-weight-matching
1
0
Fork 0
Code Pull Requests Activity
Python code for Maximum Weighted Matching in general graphs
8 Commits 1 Branch 2 Tags 1.5 MiB
Python 50.3%
C++ 47.8%
Shell 1.5%
Makefile 0.4%
Go to file
Joris van Rantwijk 99bc2912d8 Fix wrong assumption about subblossom labels 
When a blossom forms, the labels of sub-blossoms do NOT strictly alternate between S and T when walking around the blossom.
 		2023-02-13 22:06:13 +01:00
python Fix wrong assumption about subblossom labels 2023-02-13 22:06:13 +01:00
README.md Add README.md 2023-02-04 21:11:41 +01:00

README.md

Maximum Weighted Matching

An O(n**3) implementation of maximum weighted matching in general graphs.

This is currently work-in-progress.