Blossom algorithm: Difference between revisions

Content deleted Content added
m Finding an augmenting path: Commented out the line that does nothing in find_augmenting_path algorithm, re-numbered lines
Finding an augmenting path: Added a more descriptive comment in the first if statement of the find_augmenting_path algorithm
Line 107:
B09 '''while''' there exists an unmarked edge ''e'' = { ''v'', ''w'' } '''do'''
B10 '''if''' ''w'' is not in ''F'' '''then'''
// Update''w'' is matched, so add ''e'' and ''w'''s matched edge to ''F''.
B11 ''x'' ← vertex matched to ''w'' in ''M''
B12 add edges { ''v'', ''w'' } and { ''w'', ''x'' } to the tree of ''v''