1
0
Fork 0
Python code for Maximum Weighted Matching in general graphs
Go to file
Joris van Rantwijk caac6825a6 Expand zero-dual blossom before assigning label T 2023-04-09 21:19:41 +02:00
python Expand zero-dual blossom before assigning label T 2023-04-09 21:19:41 +02:00
tests Minor fix language in docstring 2023-03-13 21:56:46 +01:00
.gitignore Add .gitignore 2023-03-12 12:17:38 +01:00
README.md Add README.md 2023-02-04 21:11:41 +01:00
pylintrc Pylint cleanups 2023-03-12 12:16:29 +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.