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

6
.CondaPkg/env/Lib/site-packages/networkx/algorithms/triads.py vendored
View File

@@ -384,7 +384,7 @@ def triads_by_type(G):
- 210: 1 -> 2 <-> 3, 1 <-> 3
- 300: 1 <-> 2 <-> 3, 1 <-> 3
Refer to the :doc:`example gallery <auto_examples/graph/plot_triad_types>`
Refer to the :doc:`example gallery </auto_examples/graph/plot_triad_types>`
for visual examples of the triad types.
Parameters
@@ -490,7 +490,7 @@ def triad_type(G):
elif e1[1] == e2[0] or e2[1] == e1[0]:
return "021C"
elif num_edges == 3:
for (e1, e2, e3) in permutations(G.edges(), 3):
for e1, e2, e3 in permutations(G.edges(), 3):
if set(e1) == set(e2):
if e3[0] in e1:
return "111U"
@@ -502,7 +502,7 @@ def triad_type(G):
# e3 == (e1[0], e2[1]) and e2 == (e1[1], e3[1]):
return "030T"
elif num_edges == 4:
for (e1, e2, e3, e4) in permutations(G.edges(), 4):
for e1, e2, e3, e4 in permutations(G.edges(), 4):
if set(e1) == set(e2):
# identify pair of symmetric edges (which necessarily exists)
if set(e3) == set(e4):