1
0
Fork 0
Python code for Maximum Weighted Matching in general graphs
Go to file
Joris van Rantwijk 4dc7befd9d Check that unmatched vertices have zero dual 2023-02-13 22:20:02 +01:00
python Check that unmatched vertices have zero dual 2023-02-13 22:20:02 +01:00
tests/generate Code to generate test graphs 2023-02-13 22:20:02 +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.