Mercurial > repos > shellac > sam_consensus_v3
view env/lib/python3.9/site-packages/networkx/algorithms/assortativity/tests/test_neighbor_degree.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 networkx as nx from networkx.testing import almost_equal class TestAverageNeighbor: def test_degree_p4(self): G = nx.path_graph(4) answer = {0: 2, 1: 1.5, 2: 1.5, 3: 2} nd = nx.average_neighbor_degree(G) assert nd == answer D = G.to_directed() nd = nx.average_neighbor_degree(D) assert nd == answer D = G.to_directed() nd = nx.average_neighbor_degree(D) assert nd == answer D = G.to_directed() nd = nx.average_neighbor_degree(D, source="in", target="in") assert nd == answer def test_degree_p4_weighted(self): G = nx.path_graph(4) G[1][2]["weight"] = 4 answer = {0: 2, 1: 1.8, 2: 1.8, 3: 2} nd = nx.average_neighbor_degree(G, weight="weight") assert nd == answer D = G.to_directed() nd = nx.average_neighbor_degree(D, weight="weight") assert nd == answer D = G.to_directed() nd = nx.average_neighbor_degree(D, weight="weight") assert nd == answer nd = nx.average_neighbor_degree(D, source="out", target="out", weight="weight") assert nd == answer D = G.to_directed() nd = nx.average_neighbor_degree(D, source="in", target="in", weight="weight") assert nd == answer def test_degree_k4(self): G = nx.complete_graph(4) answer = {0: 3, 1: 3, 2: 3, 3: 3} nd = nx.average_neighbor_degree(G) assert nd == answer D = G.to_directed() nd = nx.average_neighbor_degree(D) assert nd == answer D = G.to_directed() nd = nx.average_neighbor_degree(D) assert nd == answer D = G.to_directed() nd = nx.average_neighbor_degree(D, source="in", target="in") assert nd == answer def test_degree_k4_nodes(self): G = nx.complete_graph(4) answer = {1: 3.0, 2: 3.0} nd = nx.average_neighbor_degree(G, nodes=[1, 2]) assert nd == answer def test_degree_barrat(self): G = nx.star_graph(5) G.add_edges_from([(5, 6), (5, 7), (5, 8), (5, 9)]) G[0][5]["weight"] = 5 nd = nx.average_neighbor_degree(G)[5] assert nd == 1.8 nd = nx.average_neighbor_degree(G, weight="weight")[5] assert almost_equal(nd, 3.222222, places=5)