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

Minor comment cleanup

This commit is contained in:
Joris van Rantwijk 2024-11-24 13:59:28 +01:00
parent 02917b2caf
commit 087799cdca
1 changed files with 2 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
python/mwmatching/algorithm.py
View File

@ -1688,24 +1688,16 @@ class MatchingContext:
(p, q, _w) = edges[e] (p, q, _w) = edges[e]
y = p if p != x else q y = p if p != x else q
# Consider the edge between vertices "x" and "y".
# Update delta2 or delta3 tracking accordingly.
#
# We don't actually use the edge right now to extend
# the alternating tree or create a blossom or alternating path.
# If appropriate, insert this edge into delta2 or delta3
# tracking.
# Insert this edge into delta2 or delta3 tracking
# Try to pull this edge into an alternating tree.
# Ignore edges that are internal to a blossom. # Ignore edges that are internal to a blossom.
by = self.top_level_blossom(y) by = self.top_level_blossom(y)
if bx is by: if bx is by:
continue continue
if by.label == LABEL_S: if by.label == LABEL_S:
# Edge between S-vertices.
self.delta3_add_edge(e) self.delta3_add_edge(e)
else: else:
# Edge to T-vertex or unlabeled vertex.
self.delta2_add_edge(e, y, by) self.delta2_add_edge(e, y, by)
self.scan_queue.clear() self.scan_queue.clear()