1
0
Fork 0
Commit Graph

34 Commits

Author SHA1 Message Date
Joris van Rantwijk 118007e953 Add testcases that are sensitive to specific bugs 2023-02-13 22:20:02 +01:00
Joris van Rantwijk 8f81154169 Test coverage of verification routine 2023-02-13 22:20:02 +01:00
Joris van Rantwijk 4dc7befd9d Check that unmatched vertices have zero dual 2023-02-13 22:20:02 +01:00
Joris van Rantwijk be0f5c3881 Raise MatchingFailed when verify fails 2023-02-13 22:20:02 +01:00
Joris van Rantwijk f1a60febe7 Improve test coverage to 100% 2023-02-13 22:20:02 +01:00
Joris van Rantwijk fa524ce754 Simplify deletion of expanded blossoms 2023-02-13 22:20:02 +01:00
Joris van Rantwijk a1836a585f Improve test coverage 2023-02-13 22:20:02 +01:00
Joris van Rantwijk a0ed8716ae Remove distracting comment 2023-02-13 22:20:02 +01:00
Joris van Rantwijk 38374e293f Code to generate test graphs 2023-02-13 22:20:02 +01:00
Joris van Rantwijk 4203b1e5cc Optimize deletion of expanded blossoms 2023-02-13 22:20:02 +01:00
Joris van Rantwijk 6d46a9d89a Minor cleanups 2023-02-13 22:20:02 +01:00
Joris van Rantwijk 8bef12559a Improve performance of verification code 2023-02-13 22:20:02 +01:00
Joris van Rantwijk 291d3ead8b Mark static methods 2023-02-13 22:20:02 +01:00
Joris van Rantwijk d1b79c1cde Clean up trace_alternating_paths() 2023-02-13 22:20:02 +01:00
Joris van Rantwijk f491d6dcec Object oriented blossoms, first attempt 2023-02-13 22:20:02 +01:00
Joris van Rantwijk b42440784f Clean up explicit-stack recursion 2023-02-13 22:20:02 +01:00
Joris van Rantwijk fc31657a56 Avoid redundant calls to edge_slack_2x() 2023-02-13 22:20:02 +01:00
Joris van Rantwijk 14b5a032a7 Move least-slack edge tracking to separate class 2023-02-13 22:20:02 +01:00
Joris van Rantwijk 0ad3020425 Use (x, y) instead of (i, j) 2023-02-13 22:20:02 +01:00
Joris van Rantwijk d063bbd45a Merge StageData and PartialMatching 2023-02-13 22:20:02 +01:00
Joris van Rantwijk 8950096df9 minor cleanup 2023-02-13 22:20:02 +01:00
Joris van Rantwijk 4f62a15c06 Use (i, j) instead of (v, w) 2023-02-13 22:20:02 +01:00
Joris van Rantwijk 0f7423e2b8 Simplify naming related to double weights 2023-02-13 22:20:02 +01:00
Joris van Rantwijk d4bfb712d2 Add a few tests for maximum cardinality 2023-02-13 22:20:02 +01:00
Joris van Rantwijk 7617e68d59 Add command-line runner 2023-02-13 22:20:02 +01:00
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