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

Fix mistaken comments about run times

This commit is contained in:
Joris van Rantwijk 2023-04-09 21:18:56 +02:00
parent 0e79e1d2f6
commit d4b8cf2067
1 changed files with 1 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
python/mwmatching.py
View File

@ -558,7 +558,7 @@ class _MatchingContext:
Multiplication by 2 ensures that the return value is an integer
if all edge weights are integers.
This function is called O(m) times per stage.
This function is called O(n**2) times per stage.
"""
(x, y, w) = self.graph.edges[e]
assert self.vertex_top_blossom[x] is not self.vertex_top_blossom[y]
@ -692,7 +692,6 @@ class _MatchingContext:
"""Update least-slack edge tracking after merging sub-blossoms
into a new S-blossom.
This function takes time O(n) per call.
This function takes total time O(n**2) per stage.
"""
num_vertex = self.graph.num_vertex
@ -913,7 +912,6 @@ class _MatchingContext:
Assign label S to the new blossom.
Relabel all T-sub-blossoms as S and add their vertices to the queue.
This function takes time O(n) per call.
This function takes total time O(n**2) per stage.
"""