Mercurial > repos > shellac > sam_consensus_v3

comparison env/lib/python3.9/site-packages/networkx/algorithms/assortativity/tests/test_neighbor_degree.py @ 0:4f3585e2f14b draft default tip

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
"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 networkx as nx
2 from networkx.testing import almost_equal
3
4
5 class TestAverageNeighbor:
6 def test_degree_p4(self):
7 G = nx.path_graph(4)
8 answer = {0: 2, 1: 1.5, 2: 1.5, 3: 2}
9 nd = nx.average_neighbor_degree(G)
10 assert nd == answer
11
12 D = G.to_directed()
13 nd = nx.average_neighbor_degree(D)
14 assert nd == answer
15
16 D = G.to_directed()
17 nd = nx.average_neighbor_degree(D)
18 assert nd == answer
19
20 D = G.to_directed()
21 nd = nx.average_neighbor_degree(D, source="in", target="in")
22 assert nd == answer
23
24 def test_degree_p4_weighted(self):
25 G = nx.path_graph(4)
26 G[1][2]["weight"] = 4
27 answer = {0: 2, 1: 1.8, 2: 1.8, 3: 2}
28 nd = nx.average_neighbor_degree(G, weight="weight")
29 assert nd == answer
30
31 D = G.to_directed()
32 nd = nx.average_neighbor_degree(D, weight="weight")
33 assert nd == answer
34
35 D = G.to_directed()
36 nd = nx.average_neighbor_degree(D, weight="weight")
37 assert nd == answer
38 nd = nx.average_neighbor_degree(D, source="out", target="out", weight="weight")
39 assert nd == answer
40
41 D = G.to_directed()
42 nd = nx.average_neighbor_degree(D, source="in", target="in", weight="weight")
43 assert nd == answer
44
45 def test_degree_k4(self):
46 G = nx.complete_graph(4)
47 answer = {0: 3, 1: 3, 2: 3, 3: 3}
48 nd = nx.average_neighbor_degree(G)
49 assert nd == answer
50
51 D = G.to_directed()
52 nd = nx.average_neighbor_degree(D)
53 assert nd == answer
54
55 D = G.to_directed()
56 nd = nx.average_neighbor_degree(D)
57 assert nd == answer
58
59 D = G.to_directed()
60 nd = nx.average_neighbor_degree(D, source="in", target="in")
61 assert nd == answer
62
63 def test_degree_k4_nodes(self):
64 G = nx.complete_graph(4)
65 answer = {1: 3.0, 2: 3.0}
66 nd = nx.average_neighbor_degree(G, nodes=[1, 2])
67 assert nd == answer
68
69 def test_degree_barrat(self):
70 G = nx.star_graph(5)
71 G.add_edges_from([(5, 6), (5, 7), (5, 8), (5, 9)])
72 G[0][5]["weight"] = 5
73 nd = nx.average_neighbor_degree(G)[5]
74 assert nd == 1.8
75 nd = nx.average_neighbor_degree(G, weight="weight")[5]
76 assert almost_equal(nd, 3.222222, places=5)