ton/ImageUtils
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

rm CondaPkg environment

Browse Source
This commit is contained in:
ton
2023-04-06 13:53:47 +07:00
parent 0a57ed7884
commit c43d949309
3329 changed files with 5725 additions and 447022 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
.CondaPkg/env/Lib/site-packages/networkx/algorithms/matching.py vendored
View File

@@ -391,8 +391,6 @@ def max_weight_matching(G, maxcardinality=False, weight="weight"):
class NoNode:
"""Dummy value which is different from any node."""
pass
class Blossom:
"""Representation of a non-trivial blossom or sub-blossom."""
@@ -806,7 +804,7 @@ def max_weight_matching(G, maxcardinality=False, weight="weight"):
# Swap matched/unmatched edges over an alternating path between two
# single vertices. The augmenting path runs through S-vertices v and w.
def augmentMatching(v, w):
for (s, j) in ((v, w), (w, v)):
for s, j in ((v, w), (w, v)):
# Match vertex s to vertex j. Then trace back from s
# until we find a single vertex, swapping matched and unmatched
# edges as we go.
@@ -863,7 +861,7 @@ def max_weight_matching(G, maxcardinality=False, weight="weight"):
jblossoms.append(blossomparent[jblossoms[-1]])
iblossoms.reverse()
jblossoms.reverse()
for (bi, bj) in zip(iblossoms, jblossoms):
for bi, bj in zip(iblossoms, jblossoms):
if bi != bj:
break
s += 2 * blossomdual[bi]
@@ -878,13 +876,12 @@ def max_weight_matching(G, maxcardinality=False, weight="weight"):
for b in blossomdual:
if blossomdual[b] > 0:
assert len(b.edges) % 2 == 1
for (i, j) in b.edges[1::2]:
for i, j in b.edges[1::2]:
assert mate[i] == j and mate[j] == i
# Ok.
# Main loop: continue until no further improvement is possible.
while 1:
# Each iteration of this loop is a "stage".
# A stage finds an augmenting path and uses that to improve
# the matching.
@@ -913,7 +910,6 @@ def max_weight_matching(G, maxcardinality=False, weight="weight"):
# Loop until we succeed in augmenting the matching.
augmented = 0
while 1:
# Each iteration of this loop is a "substage".
# A substage tries to find an augmenting path;
# if found, the path is used to improve the matching and
@@ -924,7 +920,6 @@ def max_weight_matching(G, maxcardinality=False, weight="weight"):
# Continue labeling until all vertices which are reachable
# through an alternating path have got a label.
while queue and not augmented:
# Take an S vertex from the queue.
v = queue.pop()
assert label[inblossom[v]] == 1
@@ -1042,7 +1037,7 @@ def max_weight_matching(G, maxcardinality=False, weight="weight"):
if deltatype == -1:
# No further improvement possible; max-cardinality optimum
# reached. Do a final delta update to make the optimum
# verifyable.
# verifiable.
assert maxcardinality
deltatype = 1
delta = max(0, min(dualvar.values()))