1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
|
"""
Tests for Group Centrality Measures
"""
import pytest
import networkx as nx
class TestGroupBetweennessCentrality:
def test_group_betweenness_single_node(self):
"""
Group betweenness centrality for single node group
"""
G = nx.path_graph(5)
C = [1]
b = nx.group_betweenness_centrality(
G, C, weight=None, normalized=False, endpoints=False
)
b_answer = 3.0
assert b == b_answer
def test_group_betweenness_with_endpoints(self):
"""
Group betweenness centrality for single node group
"""
G = nx.path_graph(5)
C = [1]
b = nx.group_betweenness_centrality(
G, C, weight=None, normalized=False, endpoints=True
)
b_answer = 7.0
assert b == b_answer
def test_group_betweenness_normalized(self):
"""
Group betweenness centrality for group with more than
1 node and normalized
"""
G = nx.path_graph(5)
C = [1, 3]
b = nx.group_betweenness_centrality(
G, C, weight=None, normalized=True, endpoints=False
)
b_answer = 1.0
assert b == b_answer
def test_two_group_betweenness_value_zero(self):
"""
Group betweenness centrality value of 0
"""
G = nx.cycle_graph(7)
C = [[0, 1, 6], [0, 1, 5]]
b = nx.group_betweenness_centrality(G, C, weight=None, normalized=False)
b_answer = [0.0, 3.0]
assert b == b_answer
def test_group_betweenness_value_zero(self):
"""
Group betweenness centrality value of 0
"""
G = nx.cycle_graph(6)
C = [0, 1, 5]
b = nx.group_betweenness_centrality(G, C, weight=None, normalized=False)
b_answer = 0.0
assert b == b_answer
def test_group_betweenness_disconnected_graph(self):
"""
Group betweenness centrality in a disconnected graph
"""
G = nx.path_graph(5)
G.remove_edge(0, 1)
C = [1]
b = nx.group_betweenness_centrality(G, C, weight=None, normalized=False)
b_answer = 0.0
assert b == b_answer
def test_group_betweenness_node_not_in_graph(self):
"""
Node(s) in C not in graph, raises NodeNotFound exception
"""
with pytest.raises(nx.NodeNotFound):
b = nx.group_betweenness_centrality(nx.path_graph(5), [4, 7, 8])
def test_group_betweenness_directed_weighted(self):
"""
Group betweenness centrality in a directed and weighted graph
"""
G = nx.DiGraph()
G.add_edge(1, 0, weight=1)
G.add_edge(0, 2, weight=2)
G.add_edge(1, 2, weight=3)
G.add_edge(3, 1, weight=4)
G.add_edge(2, 3, weight=1)
G.add_edge(4, 3, weight=6)
G.add_edge(2, 4, weight=7)
C = [1, 2]
b = nx.group_betweenness_centrality(G, C, weight="weight", normalized=False)
b_answer = 5.0
assert b == b_answer
class TestProminentGroup:
np = pytest.importorskip("numpy")
pd = pytest.importorskip("pandas")
def test_prominent_group_single_node(self):
"""
Prominent group for single node
"""
G = nx.path_graph(5)
k = 1
b, g = nx.prominent_group(G, k, normalized=False, endpoints=False)
b_answer, g_answer = 4.0, [2]
assert b == b_answer and g == g_answer
def test_prominent_group_with_c(self):
"""
Prominent group without some nodes
"""
G = nx.path_graph(5)
k = 1
b, g = nx.prominent_group(G, k, normalized=False, C=[2])
b_answer, g_answer = 3.0, [1]
assert b == b_answer and g == g_answer
def test_prominent_group_normalized_endpoints(self):
"""
Prominent group with normalized result, with endpoints
"""
G = nx.cycle_graph(7)
k = 2
b, g = nx.prominent_group(G, k, normalized=True, endpoints=True)
b_answer, g_answer = 1.7, [2, 5]
assert b == b_answer and g == g_answer
def test_prominent_group_disconnected_graph(self):
"""
Prominent group of disconnected graph
"""
G = nx.path_graph(6)
G.remove_edge(0, 1)
k = 1
b, g = nx.prominent_group(G, k, weight=None, normalized=False)
b_answer, g_answer = 4.0, [3]
assert b == b_answer and g == g_answer
def test_prominent_group_node_not_in_graph(self):
"""
Node(s) in C not in graph, raises NodeNotFound exception
"""
with pytest.raises(nx.NodeNotFound):
b, g = nx.prominent_group(nx.path_graph(5), 1, C=[10])
def test_group_betweenness_directed_weighted(self):
"""
Group betweenness centrality in a directed and weighted graph
"""
G = nx.DiGraph()
G.add_edge(1, 0, weight=1)
G.add_edge(0, 2, weight=2)
G.add_edge(1, 2, weight=3)
G.add_edge(3, 1, weight=4)
G.add_edge(2, 3, weight=1)
G.add_edge(4, 3, weight=6)
G.add_edge(2, 4, weight=7)
k = 2
b, g = nx.prominent_group(G, k, weight="weight", normalized=False)
b_answer, g_answer = 5.0, [1, 2]
assert b == b_answer and g == g_answer
def test_prominent_group_greedy_algorithm(self):
"""
Group betweenness centrality in a greedy algorithm
"""
G = nx.cycle_graph(7)
k = 2
b, g = nx.prominent_group(G, k, normalized=True, endpoints=True, greedy=True)
b_answer, g_answer = 1.7, [6, 3]
assert b == b_answer and g == g_answer
class TestGroupClosenessCentrality:
def test_group_closeness_single_node(self):
"""
Group closeness centrality for a single node group
"""
G = nx.path_graph(5)
c = nx.group_closeness_centrality(G, [1])
c_answer = nx.closeness_centrality(G, 1)
assert c == c_answer
def test_group_closeness_disconnected(self):
"""
Group closeness centrality for a disconnected graph
"""
G = nx.Graph()
G.add_nodes_from([1, 2, 3, 4])
c = nx.group_closeness_centrality(G, [1, 2])
c_answer = 0
assert c == c_answer
def test_group_closeness_multiple_node(self):
"""
Group closeness centrality for a group with more than
1 node
"""
G = nx.path_graph(4)
c = nx.group_closeness_centrality(G, [1, 2])
c_answer = 1
assert c == c_answer
def test_group_closeness_node_not_in_graph(self):
"""
Node(s) in S not in graph, raises NodeNotFound exception
"""
with pytest.raises(nx.NodeNotFound):
c = nx.group_closeness_centrality(nx.path_graph(5), [6, 7, 8])
class TestGroupDegreeCentrality:
def test_group_degree_centrality_single_node(self):
"""
Group degree centrality for a single node group
"""
G = nx.path_graph(4)
d = nx.group_degree_centrality(G, [1])
d_answer = nx.degree_centrality(G)[1]
assert d == d_answer
def test_group_degree_centrality_multiple_node(self):
"""
Group degree centrality for group with more than
1 node
"""
G = nx.Graph()
G.add_nodes_from([1, 2, 3, 4, 5, 6, 7, 8])
G.add_edges_from(
[(1, 2), (1, 3), (1, 6), (1, 7), (1, 8), (2, 3), (2, 4), (2, 5)]
)
d = nx.group_degree_centrality(G, [1, 2])
d_answer = 1
assert d == d_answer
def test_group_in_degree_centrality(self):
"""
Group in-degree centrality in a DiGraph
"""
G = nx.DiGraph()
G.add_nodes_from([1, 2, 3, 4, 5, 6, 7, 8])
G.add_edges_from(
[(1, 2), (1, 3), (1, 6), (1, 7), (1, 8), (2, 3), (2, 4), (2, 5)]
)
d = nx.group_in_degree_centrality(G, [1, 2])
d_answer = 0
assert d == d_answer
def test_group_out_degree_centrality(self):
"""
Group out-degree centrality in a DiGraph
"""
G = nx.DiGraph()
G.add_nodes_from([1, 2, 3, 4, 5, 6, 7, 8])
G.add_edges_from(
[(1, 2), (1, 3), (1, 6), (1, 7), (1, 8), (2, 3), (2, 4), (2, 5)]
)
d = nx.group_out_degree_centrality(G, [1, 2])
d_answer = 1
assert d == d_answer
def test_group_degree_centrality_node_not_in_graph(self):
"""
Node(s) in S not in graph, raises NetworkXError
"""
with pytest.raises(nx.NetworkXError):
b = nx.group_degree_centrality(nx.path_graph(5), [6, 7, 8])
|
