joris
/
maximum-weight-matching
1
0
Fork 0
Code Pull Requests Activity

Minor clarifications in comments

This commit is contained in:
Joris van Rantwijk 2023-05-10 20:54:29 +02:00
parent 91a392a0dc
commit be2b474873
1 changed files with 1 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
python/mwmatching.py
View File

@ -388,7 +388,6 @@ class _Blossom:
# "marker" is a temporary variable used to discover common # "marker" is a temporary variable used to discover common
# ancestors in the blossom tree. It is normally False, except # ancestors in the blossom tree. It is normally False, except
# when used by "trace_alternating_paths()". # when used by "trace_alternating_paths()".
# It is also used by "expand_zero_dual_blossoms()".
self.marker: bool = False self.marker: bool = False
def vertices(self) -> list[int]: def vertices(self) -> list[int]:
@ -1305,7 +1304,7 @@ class _MatchingContext:
by.label = _LABEL_T by.label = _LABEL_T
by.tree_edge = (x, y) by.tree_edge = (x, y)
# Assign label S to the blossom that contains the mate of vertex "y". # Assign label S to the blossom that is mated to the T-blossom.
z = self.vertex_mate[by.base_vertex] z = self.vertex_mate[by.base_vertex]
assert z != -1 assert z != -1
self.assign_label_s(z) self.assign_label_s(z)