mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-30 16:31:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge remote-tracking branch 'origin/master'

Browse Source 
# Conflicts:
#	graphs/edmonds_blossom_algorithm.py
This commit is contained in:
Tarun Vishwakarma 2024-10-14 21:25:07 +05:30
commit ebb8055450
1 changed files with 21 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

31
graphs/edmonds_blossom_algorithm.py
View File

@ -113,9 +113,9 @@ class EdmondsBlossomAlgorithm:
parent[y] = current # Update the parent
augmenting_path_found = True
# Augment along this path
EdmondsBlossomAlgorithm.update_matching(match,
parent,
y)
EdmondsBlossomAlgorithm.update_matching(
match, parent, y
)
break
# Case 2: y is matched;
@ -129,14 +129,25 @@ class EdmondsBlossomAlgorithm:
else:
# Case 3: Both current and y have a parent;
# check for a cycle/blossom
base_u = EdmondsBlossomAlgorithm.find_base(base, parent,
current, y)
base_u = EdmondsBlossomAlgorithm.find_base(
base, parent, current, y
)
if base_u != EdmondsBlossomAlgorithm.UNMATCHED:
EdmondsBlossomAlgorithm.contract_blossom(BlossomData(
BlossomAuxData(queue, parent,
base, in_blossom,
match, in_queue),
current, y, base_u))
EdmondsBlossomAlgorithm.contract_blossom(
BlossomData(
BlossomAuxData(
queue,
parent,
base,
in_blossom,
match,
in_queue,
),
current,
y,
base_u,
)
)
# Create result list of matched pairs
matching_result: list[list[int]] = []