1
0
Fork 0
Python code for Maximum Weighted Matching in general graphs
Go to file
Joris van Rantwijk 37aa0c605b Read from stdin when no input file specified 2023-02-22 23:20:43 +01:00
python Read from stdin when no input file specified 2023-02-22 23:20:43 +01:00
tests/generate Add generators: chain, hardcard.f, t.f, tt.f 2023-02-22 23:20:17 +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.