-
Notifications
You must be signed in to change notification settings - Fork 26
/
test_reportviews.py
244 lines (192 loc) · 6.23 KB
/
test_reportviews.py
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
import numpy as np
import pytest
import xgi
from xgi.exception import IDNotFound, XGIError
def test_neighbors(edgelist1, edgelist2):
el1 = edgelist1
el2 = edgelist2
H1 = xgi.Hypergraph(el1)
H2 = xgi.Hypergraph(el2)
assert H1.nodes.neighbors(1) == {2, 3}
assert H1.nodes.neighbors(4) == set()
assert H1.nodes.neighbors(6) == {5, 7, 8}
assert H2.nodes.neighbors(4) == {3, 5, 6}
assert H2.nodes.neighbors(1) == {2}
assert H1.edges.neighbors(0) == set()
assert H1.edges.neighbors(1) == set()
assert H1.edges.neighbors(2) == {3}
assert H1.edges.neighbors(3) == {2}
def test_edge_order(edgelist3):
H = xgi.Hypergraph(edgelist3)
with pytest.raises(TypeError):
H.edges()
assert len(H.edges.filterby("order", 1)) == 1
assert len(H.edges.filterby("order", 3)) == 0
ord2 = H.edges.filterby("order", 2)
assert len(ord2) == 2
assert (0 in ord2) and (2 in ord2)
H.add_edge([3, 7, 8, 9, 10])
assert len(H.edges.filterby("order", 4)) == 1
assert 3 in H.edges.filterby("order", 4)
H.add_node_to_edge(0, 7)
assert 0 not in H.edges.filterby("order", 2)
assert len(H.edges.filterby("order", 2)) == 1
assert 2 in H.edges.filterby("order", 2)
def test_node_degree(edgelist3):
H = xgi.Hypergraph(edgelist3)
with pytest.raises(TypeError):
H.edges()
assert H.degree() == {1: 1, 2: 1, 3: 2, 4: 2, 5: 1, 6: 1}
assert H.degree(1) == 1
assert H.degree(4) == 2
with pytest.raises(KeyError):
H.degree(-1)
assert len(H.nodes.filterby("degree", 1)) == 4
assert len(H.nodes.filterby("degree", 3)) == 0
deg2 = H.nodes.filterby("degree", 2)
assert len(deg2) == 2
assert (3 in deg2) and (4 in deg2)
H.add_edge([3, 7])
assert len(H.nodes.filterby("degree", 2)) == 1
assert len(H.nodes.filterby("degree", 3)) == 1
assert 3 in H.nodes.filterby("degree", 3)
assert 7 in H.nodes.filterby("degree", 1)
H.add_node_to_edge(0, 7)
assert 7 in H.nodes.filterby("degree", 2)
def test_size_degree(edgelist1, edgelist4):
H1 = xgi.Hypergraph(edgelist4)
H2 = xgi.Hypergraph(edgelist1)
assert H1.edges.size.asdict() == {0: 3, 1: 4, 2: 3}
assert H2.edges.size.asdict() == {0: 3, 1: 1, 2: 2, 3: 3}
assert H1.edges.order.asdict() == {0: 2, 1: 3, 2: 2}
assert H2.edges.order.asdict() == {0: 2, 1: 0, 2: 1, 3: 2}
def test_degree(edgelist1, edgelist4):
H1 = xgi.Hypergraph(edgelist4)
H2 = xgi.Hypergraph(edgelist1)
# test basic functionality
assert H1.degree(1) == 1
assert H1.degree(2) == 2
assert H1.degree(3) == 3
with pytest.raises(KeyError):
H1.degree(0)
# check len
assert len(H1.degree()) == 5
# test order
assert H2.nodes.degree(order=0).asdict() == {
1: 0,
2: 0,
3: 0,
4: 1,
5: 0,
6: 0,
7: 0,
8: 0,
}
assert H2.nodes.degree(order=1).asdict() == {
1: 0,
2: 0,
3: 0,
4: 0,
5: 1,
6: 1,
7: 0,
8: 0,
}
assert H2.nodes.degree(order=2).asdict() == {
1: 1,
2: 1,
3: 1,
4: 0,
5: 0,
6: 1,
7: 1,
8: 1,
}
# test weights
attr_dict1 = {0: {"weight": -2}, 1: {"weight": 4.0}, 2: {"weight": 0.3}}
xgi.set_edge_attributes(H1, attr_dict1)
assert H1.nodes.degree(weight="weight").asdict() == {
1: -2,
2: 2,
3: 2.3,
4: 4.3,
5: 4.3,
}
assert H1.nodes.degree(weight="weight", order=2).asdict() == {
1: -2,
2: -2,
3: -1.7,
4: 0.3,
5: 0.3,
}
def test_edge_members(edgelist3):
H = xgi.Hypergraph(edgelist3)
assert H.edges.members(0) == {1, 2, 3}
assert H.edges.members() == [{1, 2, 3}, {3, 4}, {4, 5, 6}]
assert H.edges.members(dtype=dict) == {0: {1, 2, 3}, 1: {3, 4}, 2: {4, 5, 6}}
with pytest.raises(XGIError):
H.edges.members(dtype=np.array)
with pytest.raises(TypeError):
H.edges.members(slice(1, 4, 1))
with pytest.raises(TypeError):
H.edges.members([1, 2])
with pytest.raises(IDNotFound):
H.edges.members("test")
def test_view_len(edgelist2):
H = xgi.Hypergraph(edgelist2)
nodes = H.nodes
assert len(nodes) == len(H._node)
H.add_node(10)
assert len(nodes) == len(H._node)
H.add_nodes_from(range(10, 20))
assert len(nodes) == len(H._node)
def test_bunch_view(edgelist1):
H = xgi.Hypergraph(edgelist1)
bunch_view = H.edges.from_view(H.edges, bunch=[1, 2])
assert len(bunch_view) == 2
assert (1 in bunch_view) and (2 in bunch_view)
assert 0 not in bunch_view
assert bunch_view.members(dtype=dict) == {1: {4}, 2: {5, 6}}
with pytest.raises(IDNotFound):
bunch_view.members(0)
def test_call_wrong_bunch():
H = xgi.Hypergraph()
with pytest.raises(IDNotFound):
H.nodes([0])
H.add_node(0)
assert len(H.nodes([0]))
with pytest.raises(TypeError):
H.nodes(0)
def test_call(edgelist1):
H = xgi.Hypergraph(edgelist1)
assert len(H.nodes([])) == 0
assert H.nodes(list(H.nodes)) == H.nodes
assert H.nodes(H.nodes) == H.nodes
def test_isolates(edgelist1):
H = xgi.Hypergraph(edgelist1)
assert list(H.nodes.isolates(ignore_singletons=False)) == []
assert list(H.nodes.isolates()) == [4]
H.remove_nodes_from(H.nodes.isolates())
assert 4 not in H
def test_singletons(edgelist1):
H = xgi.Hypergraph(edgelist1)
assert list(H.edges.singletons()) == [1]
H.remove_edge(1)
assert 1 not in H.edges
assert list(H.edges.singletons()) == []
def test_lookup(edgelist1):
H = xgi.Hypergraph(edgelist1)
assert list(H.edges.lookup([1, 2, 3])) == [0]
assert list(H.edges.lookup({1, 2, 3})) == [0]
assert list(H.edges.lookup({4})) == [1]
assert list(H.edges.lookup([4, 5])) == []
assert list(H.edges.lookup([3])) == []
assert list(H.edges.lookup([4])) == [1]
assert list(H.edges.lookup([1, 2])) == []
H = xgi.Hypergraph([["a", "b", "c"], ["a", "b", "e"], ["c", "d", "e"]])
assert set(H.nodes.lookup([0, 1])) == {"a", "b"}
def test_bool(edgelist1):
H = xgi.Hypergraph([])
assert bool(H.edges) is False
H = xgi.Hypergraph(edgelist1)
assert bool(H.edges) is True