joris
/
maximum-weight-matching
1
0
Fork 0
Code Pull Requests Activity
Python code for Maximum Weighted Matching in general graphs
9 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 23c3e35865 Eliminate edges with negative weight 
The base algorithm transparently ignores edges, but only if
the graph contains at least 1 edge with positive weight.
If ALL edges have negative weight, dual variables may be
initialized to negative values which leads to failure.
 		2023-02-13 22:17:48 +01:00
python Eliminate edges with negative weight 2023-02-13 22:17:48 +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.