1
0
Fork 0
Python code for Maximum Weighted Matching in general graphs
Go to file
Joris van Rantwijk a3f29f0988 Run Python unittests in workflow 2023-04-14 15:09:20 +02:00
.github/workflows Run Python unittests in workflow 2023-04-14 15:09:20 +02:00
doc/figures Start writing algorithm description 2023-04-10 13:16:08 +02:00
python Fix mistaken comments about run times 2023-04-10 12:56:56 +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
Algorithm.md Add implementation notes to algorithm description 2023-04-14 00:06:01 +02: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.