Mercurial > repos > shellac > sam_consensus_v3
view 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 |
line wrap: on
line source
import pytest import networkx as nx def test_hierarchy_exception(): G = nx.cycle_graph(5) pytest.raises(nx.NetworkXError, nx.flow_hierarchy, G) def test_hierarchy_cycle(): G = nx.cycle_graph(5, create_using=nx.DiGraph()) assert nx.flow_hierarchy(G) == 0.0 def test_hierarchy_tree(): G = nx.full_rary_tree(2, 16, create_using=nx.DiGraph()) assert nx.flow_hierarchy(G) == 1.0 def test_hierarchy_1(): G = nx.DiGraph() G.add_edges_from([(0, 1), (1, 2), (2, 3), (3, 1), (3, 4), (0, 4)]) assert nx.flow_hierarchy(G) == 0.5 def test_hierarchy_weight(): G = nx.DiGraph() G.add_edges_from( [ (0, 1, {"weight": 0.3}), (1, 2, {"weight": 0.1}), (2, 3, {"weight": 0.1}), (3, 1, {"weight": 0.1}), (3, 4, {"weight": 0.3}), (0, 4, {"weight": 0.3}), ] ) assert nx.flow_hierarchy(G, weight="weight") == 0.75