Spaces:
Running
Running
File size: 13,223 Bytes
b200bda |
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 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 |
import pytest
import networkx as nx
from networkx.utils import edges_equal
class TestSubGraphView:
gview = staticmethod(nx.subgraph_view)
graph = nx.Graph
hide_edges_filter = staticmethod(nx.filters.hide_edges)
show_edges_filter = staticmethod(nx.filters.show_edges)
@classmethod
def setup_class(cls):
cls.G = nx.path_graph(9, create_using=cls.graph())
cls.hide_edges_w_hide_nodes = {(3, 4), (4, 5), (5, 6)}
def test_hidden_nodes(self):
hide_nodes = [4, 5, 111]
nodes_gone = nx.filters.hide_nodes(hide_nodes)
gview = self.gview
G = gview(self.G, filter_node=nodes_gone)
assert self.G.nodes - G.nodes == {4, 5}
assert self.G.edges - G.edges == self.hide_edges_w_hide_nodes
if G.is_directed():
assert list(G[3]) == []
assert list(G[2]) == [3]
else:
assert list(G[3]) == [2]
assert set(G[2]) == {1, 3}
pytest.raises(KeyError, G.__getitem__, 4)
pytest.raises(KeyError, G.__getitem__, 112)
pytest.raises(KeyError, G.__getitem__, 111)
assert G.degree(3) == (3 if G.is_multigraph() else 1)
assert G.size() == (7 if G.is_multigraph() else 5)
def test_hidden_edges(self):
hide_edges = [(2, 3), (8, 7), (222, 223)]
edges_gone = self.hide_edges_filter(hide_edges)
gview = self.gview
G = gview(self.G, filter_edge=edges_gone)
assert self.G.nodes == G.nodes
if G.is_directed():
assert self.G.edges - G.edges == {(2, 3)}
assert list(G[2]) == []
assert list(G.pred[3]) == []
assert list(G.pred[2]) == [1]
assert G.size() == 7
else:
assert self.G.edges - G.edges == {(2, 3), (7, 8)}
assert list(G[2]) == [1]
assert G.size() == 6
assert list(G[3]) == [4]
pytest.raises(KeyError, G.__getitem__, 221)
pytest.raises(KeyError, G.__getitem__, 222)
assert G.degree(3) == 1
def test_shown_node(self):
induced_subgraph = nx.filters.show_nodes([2, 3, 111])
gview = self.gview
G = gview(self.G, filter_node=induced_subgraph)
assert set(G.nodes) == {2, 3}
if G.is_directed():
assert list(G[3]) == []
else:
assert list(G[3]) == [2]
assert list(G[2]) == [3]
pytest.raises(KeyError, G.__getitem__, 4)
pytest.raises(KeyError, G.__getitem__, 112)
pytest.raises(KeyError, G.__getitem__, 111)
assert G.degree(3) == (3 if G.is_multigraph() else 1)
assert G.size() == (3 if G.is_multigraph() else 1)
def test_shown_edges(self):
show_edges = [(2, 3), (8, 7), (222, 223)]
edge_subgraph = self.show_edges_filter(show_edges)
G = self.gview(self.G, filter_edge=edge_subgraph)
assert self.G.nodes == G.nodes
if G.is_directed():
assert G.edges == {(2, 3)}
assert list(G[3]) == []
assert list(G[2]) == [3]
assert list(G.pred[3]) == [2]
assert list(G.pred[2]) == []
assert G.size() == 1
else:
assert G.edges == {(2, 3), (7, 8)}
assert list(G[3]) == [2]
assert list(G[2]) == [3]
assert G.size() == 2
pytest.raises(KeyError, G.__getitem__, 221)
pytest.raises(KeyError, G.__getitem__, 222)
assert G.degree(3) == 1
class TestSubDiGraphView(TestSubGraphView):
gview = staticmethod(nx.subgraph_view)
graph = nx.DiGraph
hide_edges_filter = staticmethod(nx.filters.hide_diedges)
show_edges_filter = staticmethod(nx.filters.show_diedges)
hide_edges = [(2, 3), (8, 7), (222, 223)]
excluded = {(2, 3), (3, 4), (4, 5), (5, 6)}
def test_inoutedges(self):
edges_gone = self.hide_edges_filter(self.hide_edges)
hide_nodes = [4, 5, 111]
nodes_gone = nx.filters.hide_nodes(hide_nodes)
G = self.gview(self.G, filter_node=nodes_gone, filter_edge=edges_gone)
assert self.G.in_edges - G.in_edges == self.excluded
assert self.G.out_edges - G.out_edges == self.excluded
def test_pred(self):
edges_gone = self.hide_edges_filter(self.hide_edges)
hide_nodes = [4, 5, 111]
nodes_gone = nx.filters.hide_nodes(hide_nodes)
G = self.gview(self.G, filter_node=nodes_gone, filter_edge=edges_gone)
assert list(G.pred[2]) == [1]
assert list(G.pred[6]) == []
def test_inout_degree(self):
edges_gone = self.hide_edges_filter(self.hide_edges)
hide_nodes = [4, 5, 111]
nodes_gone = nx.filters.hide_nodes(hide_nodes)
G = self.gview(self.G, filter_node=nodes_gone, filter_edge=edges_gone)
assert G.degree(2) == 1
assert G.out_degree(2) == 0
assert G.in_degree(2) == 1
assert G.size() == 4
# multigraph
class TestMultiGraphView(TestSubGraphView):
gview = staticmethod(nx.subgraph_view)
graph = nx.MultiGraph
hide_edges_filter = staticmethod(nx.filters.hide_multiedges)
show_edges_filter = staticmethod(nx.filters.show_multiedges)
@classmethod
def setup_class(cls):
cls.G = nx.path_graph(9, create_using=cls.graph())
multiedges = {(2, 3, 4), (2, 3, 5)}
cls.G.add_edges_from(multiedges)
cls.hide_edges_w_hide_nodes = {(3, 4, 0), (4, 5, 0), (5, 6, 0)}
def test_hidden_edges(self):
hide_edges = [(2, 3, 4), (2, 3, 3), (8, 7, 0), (222, 223, 0)]
edges_gone = self.hide_edges_filter(hide_edges)
G = self.gview(self.G, filter_edge=edges_gone)
assert self.G.nodes == G.nodes
if G.is_directed():
assert self.G.edges - G.edges == {(2, 3, 4)}
assert list(G[3]) == [4]
assert list(G[2]) == [3]
assert list(G.pred[3]) == [2] # only one 2 but two edges
assert list(G.pred[2]) == [1]
assert G.size() == 9
else:
assert self.G.edges - G.edges == {(2, 3, 4), (7, 8, 0)}
assert list(G[3]) == [2, 4]
assert list(G[2]) == [1, 3]
assert G.size() == 8
assert G.degree(3) == 3
pytest.raises(KeyError, G.__getitem__, 221)
pytest.raises(KeyError, G.__getitem__, 222)
def test_shown_edges(self):
show_edges = [(2, 3, 4), (2, 3, 3), (8, 7, 0), (222, 223, 0)]
edge_subgraph = self.show_edges_filter(show_edges)
G = self.gview(self.G, filter_edge=edge_subgraph)
assert self.G.nodes == G.nodes
if G.is_directed():
assert G.edges == {(2, 3, 4)}
assert list(G[3]) == []
assert list(G.pred[3]) == [2]
assert list(G.pred[2]) == []
assert G.size() == 1
else:
assert G.edges == {(2, 3, 4), (7, 8, 0)}
assert G.size() == 2
assert list(G[3]) == [2]
assert G.degree(3) == 1
assert list(G[2]) == [3]
pytest.raises(KeyError, G.__getitem__, 221)
pytest.raises(KeyError, G.__getitem__, 222)
# multidigraph
class TestMultiDiGraphView(TestMultiGraphView, TestSubDiGraphView):
gview = staticmethod(nx.subgraph_view)
graph = nx.MultiDiGraph
hide_edges_filter = staticmethod(nx.filters.hide_multidiedges)
show_edges_filter = staticmethod(nx.filters.show_multidiedges)
hide_edges = [(2, 3, 0), (8, 7, 0), (222, 223, 0)]
excluded = {(2, 3, 0), (3, 4, 0), (4, 5, 0), (5, 6, 0)}
def test_inout_degree(self):
edges_gone = self.hide_edges_filter(self.hide_edges)
hide_nodes = [4, 5, 111]
nodes_gone = nx.filters.hide_nodes(hide_nodes)
G = self.gview(self.G, filter_node=nodes_gone, filter_edge=edges_gone)
assert G.degree(2) == 3
assert G.out_degree(2) == 2
assert G.in_degree(2) == 1
assert G.size() == 6
# induced_subgraph
class TestInducedSubGraph:
@classmethod
def setup_class(cls):
cls.K3 = G = nx.complete_graph(3)
G.graph["foo"] = []
G.nodes[0]["foo"] = []
G.remove_edge(1, 2)
ll = []
G.add_edge(1, 2, foo=ll)
G.add_edge(2, 1, foo=ll)
def test_full_graph(self):
G = self.K3
H = nx.induced_subgraph(G, [0, 1, 2, 5])
assert H.name == G.name
self.graphs_equal(H, G)
self.same_attrdict(H, G)
def test_partial_subgraph(self):
G = self.K3
H = nx.induced_subgraph(G, 0)
assert dict(H.adj) == {0: {}}
assert dict(G.adj) != {0: {}}
H = nx.induced_subgraph(G, [0, 1])
assert dict(H.adj) == {0: {1: {}}, 1: {0: {}}}
def same_attrdict(self, H, G):
old_foo = H[1][2]["foo"]
H.edges[1, 2]["foo"] = "baz"
assert G.edges == H.edges
H.edges[1, 2]["foo"] = old_foo
assert G.edges == H.edges
old_foo = H.nodes[0]["foo"]
H.nodes[0]["foo"] = "baz"
assert G.nodes == H.nodes
H.nodes[0]["foo"] = old_foo
assert G.nodes == H.nodes
def graphs_equal(self, H, G):
assert G._adj == H._adj
assert G._node == H._node
assert G.graph == H.graph
assert G.name == H.name
if not G.is_directed() and not H.is_directed():
assert H._adj[1][2] is H._adj[2][1]
assert G._adj[1][2] is G._adj[2][1]
else: # at least one is directed
if not G.is_directed():
G._pred = G._adj
G._succ = G._adj
if not H.is_directed():
H._pred = H._adj
H._succ = H._adj
assert G._pred == H._pred
assert G._succ == H._succ
assert H._succ[1][2] is H._pred[2][1]
assert G._succ[1][2] is G._pred[2][1]
# edge_subgraph
class TestEdgeSubGraph:
@classmethod
def setup_class(cls):
# Create a path graph on five nodes.
cls.G = G = nx.path_graph(5)
# Add some node, edge, and graph attributes.
for i in range(5):
G.nodes[i]["name"] = f"node{i}"
G.edges[0, 1]["name"] = "edge01"
G.edges[3, 4]["name"] = "edge34"
G.graph["name"] = "graph"
# Get the subgraph induced by the first and last edges.
cls.H = nx.edge_subgraph(G, [(0, 1), (3, 4)])
def test_correct_nodes(self):
"""Tests that the subgraph has the correct nodes."""
assert [(0, "node0"), (1, "node1"), (3, "node3"), (4, "node4")] == sorted(
self.H.nodes.data("name")
)
def test_correct_edges(self):
"""Tests that the subgraph has the correct edges."""
assert edges_equal(
[(0, 1, "edge01"), (3, 4, "edge34")], self.H.edges.data("name")
)
def test_add_node(self):
"""Tests that adding a node to the original graph does not
affect the nodes of the subgraph.
"""
self.G.add_node(5)
assert [0, 1, 3, 4] == sorted(self.H.nodes)
self.G.remove_node(5)
def test_remove_node(self):
"""Tests that removing a node in the original graph
removes the nodes of the subgraph.
"""
self.G.remove_node(0)
assert [1, 3, 4] == sorted(self.H.nodes)
self.G.add_node(0, name="node0")
self.G.add_edge(0, 1, name="edge01")
def test_node_attr_dict(self):
"""Tests that the node attribute dictionary of the two graphs is
the same object.
"""
for v in self.H:
assert self.G.nodes[v] == self.H.nodes[v]
# Making a change to G should make a change in H and vice versa.
self.G.nodes[0]["name"] = "foo"
assert self.G.nodes[0] == self.H.nodes[0]
self.H.nodes[1]["name"] = "bar"
assert self.G.nodes[1] == self.H.nodes[1]
# Revert the change, so tests pass with pytest-randomly
self.G.nodes[0]["name"] = "node0"
self.H.nodes[1]["name"] = "node1"
def test_edge_attr_dict(self):
"""Tests that the edge attribute dictionary of the two graphs is
the same object.
"""
for u, v in self.H.edges():
assert self.G.edges[u, v] == self.H.edges[u, v]
# Making a change to G should make a change in H and vice versa.
self.G.edges[0, 1]["name"] = "foo"
assert self.G.edges[0, 1]["name"] == self.H.edges[0, 1]["name"]
self.H.edges[3, 4]["name"] = "bar"
assert self.G.edges[3, 4]["name"] == self.H.edges[3, 4]["name"]
# Revert the change, so tests pass with pytest-randomly
self.G.edges[0, 1]["name"] = "edge01"
self.H.edges[3, 4]["name"] = "edge34"
def test_graph_attr_dict(self):
"""Tests that the graph attribute dictionary of the two graphs
is the same object.
"""
assert self.G.graph is self.H.graph
def test_readonly(self):
"""Tests that the subgraph cannot change the graph structure"""
pytest.raises(nx.NetworkXError, self.H.add_node, 5)
pytest.raises(nx.NetworkXError, self.H.remove_node, 0)
pytest.raises(nx.NetworkXError, self.H.add_edge, 5, 6)
pytest.raises(nx.NetworkXError, self.H.remove_edge, 0, 1)
|