1
0
Fork 0
Commit Graph

9 Commits

Author SHA1 Message Date
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
Joris van Rantwijk 99bc2912d8 Fix wrong assumption about subblossom labels
When a blossom forms, the labels of sub-blossoms do NOT strictly alternate between S and T when walking around the blossom.
2023-02-13 22:06:13 +01:00
Joris van Rantwijk 575d33c90f Unit tests ported over from old code
These tests probably don't provide good coverage for the new code.
But it's a start.
2023-02-13 22:06:13 +01:00
Joris van Rantwijk 3a347e8edb Rename Python module to max_weight_matching 2023-02-13 22:06:13 +01:00
Joris van Rantwijk f76623dd5f Fix bugs and cleanup 2023-02-13 22:05:08 +01:00
Joris van Rantwijk 5827c0ccfa Fix multiple bugs and cleanup 2023-02-13 22:03:02 +01:00
Joris van Rantwijk 8d5087060f Fix bug in trace_alternating_paths 2023-02-13 22:02:00 +01:00
Joris van Rantwijk 780ccd009d Finished Python code - untested 2023-02-13 22:01:45 +01:00
Joris van Rantwijk 817f1bd4e8 Add README.md 2023-02-04 21:11:41 +01:00