maximum-weight-matching

joris

Fork 0

Commit Graph

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	3a347e8edb	Rename Python module to max_weight_matching	2023-02-13 22:06:13 +01:00

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

3a347e8edb

Rename Python module to max_weight_matching

2023-02-13 22:06:13 +01:00

3 Commits