Mercurial > repos > shellac > sam_consensus_v3
comparison env/lib/python3.9/site-packages/networkx/algorithms/tests/test_hierarchy.py @ 0:4f3585e2f14b draft default tip
"planemo upload commit 60cee0fc7c0cda8592644e1aad72851dec82c959"
author | shellac |
---|---|
date | Mon, 22 Mar 2021 18:12:50 +0000 |
parents | |
children |
comparison
equal
deleted
inserted
replaced
-1:000000000000 | 0:4f3585e2f14b |
---|---|
1 import pytest | |
2 import networkx as nx | |
3 | |
4 | |
5 def test_hierarchy_exception(): | |
6 G = nx.cycle_graph(5) | |
7 pytest.raises(nx.NetworkXError, nx.flow_hierarchy, G) | |
8 | |
9 | |
10 def test_hierarchy_cycle(): | |
11 G = nx.cycle_graph(5, create_using=nx.DiGraph()) | |
12 assert nx.flow_hierarchy(G) == 0.0 | |
13 | |
14 | |
15 def test_hierarchy_tree(): | |
16 G = nx.full_rary_tree(2, 16, create_using=nx.DiGraph()) | |
17 assert nx.flow_hierarchy(G) == 1.0 | |
18 | |
19 | |
20 def test_hierarchy_1(): | |
21 G = nx.DiGraph() | |
22 G.add_edges_from([(0, 1), (1, 2), (2, 3), (3, 1), (3, 4), (0, 4)]) | |
23 assert nx.flow_hierarchy(G) == 0.5 | |
24 | |
25 | |
26 def test_hierarchy_weight(): | |
27 G = nx.DiGraph() | |
28 G.add_edges_from( | |
29 [ | |
30 (0, 1, {"weight": 0.3}), | |
31 (1, 2, {"weight": 0.1}), | |
32 (2, 3, {"weight": 0.1}), | |
33 (3, 1, {"weight": 0.1}), | |
34 (3, 4, {"weight": 0.3}), | |
35 (0, 4, {"weight": 0.3}), | |
36 ] | |
37 ) | |
38 assert nx.flow_hierarchy(G, weight="weight") == 0.75 |