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
|
#!/usr/bin/env python
from nose.tools import *
import networkx
from test_graph import BaseAttrGraphTester, TestGraph
class BaseMultiGraphTester(BaseAttrGraphTester):
def test_has_edge(self):
G=self.K3
assert_equal(G.has_edge(0,1),True)
assert_equal(G.has_edge(0,-1),False)
assert_equal(G.has_edge(0,1,0),True)
assert_equal(G.has_edge(0,1,1),False)
def test_get_edge_data(self):
G=self.K3
assert_equal(G.get_edge_data(0,1),{0:{}})
assert_equal(G[0][1],{0:{}})
assert_equal(G[0][1][0],{})
assert_equal(G.get_edge_data(10,20),None)
assert_equal(G.get_edge_data(0,1,0),{})
def test_adjacency_iter(self):
G=self.K3
assert_equal(dict(G.adjacency_iter()),
{0: {1: {0:{}}, 2: {0:{}}},
1: {0: {0:{}}, 2: {0:{}}},
2: {0: {0:{}}, 1: {0:{}}}})
def deepcopy_edge_attr(self,H,G):
assert_equal(G[1][2][0]['foo'],H[1][2][0]['foo'])
G[1][2][0]['foo'].append(1)
assert_not_equal(G[1][2][0]['foo'],H[1][2][0]['foo'])
def shallow_copy_edge_attr(self,H,G):
assert_equal(G[1][2][0]['foo'],H[1][2][0]['foo'])
G[1][2][0]['foo'].append(1)
assert_equal(G[1][2][0]['foo'],H[1][2][0]['foo'])
def same_attrdict(self, H, G):
# same attrdict in the edgedata
old_foo=H[1][2][0]['foo']
H.add_edge(1,2,0,foo='baz')
assert_equal(G.edge,H.edge)
H.add_edge(1,2,0,foo=old_foo)
assert_equal(G.edge,H.edge)
# but not same edgedata dict
H.add_edge(1,2,foo='baz')
assert_not_equal(G.edge,H.edge)
old_foo=H.node[0]['foo']
H.node[0]['foo']='baz'
assert_equal(G.node,H.node)
H.node[0]['foo']=old_foo
assert_equal(G.node,H.node)
def different_attrdict(self, H, G):
# used by graph_equal_but_different
old_foo=H[1][2][0]['foo']
H.add_edge(1,2,0,foo='baz')
assert_not_equal(G.edge,H.edge)
H.add_edge(1,2,0,foo=old_foo)
assert_equal(G.edge,H.edge)
HH=H.copy()
H.add_edge(1,2,foo='baz')
assert_not_equal(G.edge,H.edge)
H=HH
old_foo=H.node[0]['foo']
H.node[0]['foo']='baz'
assert_not_equal(G.node,H.node)
H.node[0]['foo']=old_foo
assert_equal(G.node,H.node)
def test_to_undirected(self):
G=self.K3
self.add_attributes(G)
H=networkx.MultiGraph(G)
self.is_shallow_copy(H,G)
H=G.to_undirected()
self.is_deepcopy(H,G)
def test_to_directed(self):
G=self.K3
self.add_attributes(G)
H=networkx.MultiDiGraph(G)
self.is_shallow_copy(H,G)
H=G.to_directed()
self.is_deepcopy(H,G)
def test_selfloops(self):
G=self.K3
G.add_edge(0,0)
assert_equal(G.nodes_with_selfloops(),[0])
assert_equal(G.selfloop_edges(),[(0,0)])
assert_equal(G.selfloop_edges(data=True),[(0,0,{})])
assert_equal(G.number_of_selfloops(),1)
def test_selfloops2(self):
G=self.K3
G.add_edge(0,0)
G.add_edge(0,0)
G.add_edge(0,0,key='parallel edge')
G.remove_edge(0,0,key='parallel edge')
assert_equal(G.number_of_edges(0,0),2)
G.remove_edge(0,0)
assert_equal(G.number_of_edges(0,0),1)
def test_edge_attr4(self):
G=self.Graph()
G.add_edge(1,2,key=0,data=7,spam='bar',bar='foo')
assert_equal(G.edges(data=True),
[(1,2,{'data':7,'spam':'bar','bar':'foo'})])
G[1][2][0]['data']=10 # OK to set data like this
assert_equal(G.edges(data=True),
[(1,2,{'data':10,'spam':'bar','bar':'foo'})])
G.edge[1][2][0]['data']=20 # another spelling, "edge"
assert_equal(G.edges(data=True),
[(1,2,{'data':20,'spam':'bar','bar':'foo'})])
G.edge[1][2][0]['listdata']=[20,200]
G.edge[1][2][0]['weight']=20
assert_equal(G.edges(data=True),
[(1,2,{'data':20,'spam':'bar',
'bar':'foo','listdata':[20,200],'weight':20})])
class TestMultiGraph(BaseMultiGraphTester,TestGraph):
def setUp(self):
self.Graph=networkx.MultiGraph
# build K3
ed1,ed2,ed3 = ({0:{}},{0:{}},{0:{}})
self.k3adj={0: {1: ed1, 2: ed2},
1: {0: ed1, 2: ed3},
2: {0: ed2, 1: ed3}}
self.k3edges=[(0, 1), (0, 2), (1, 2)]
self.k3nodes=[0, 1, 2]
self.K3=self.Graph()
self.K3.adj = self.K3.edge = self.k3adj
self.K3.node={}
self.K3.node[0]={}
self.K3.node[1]={}
self.K3.node[2]={}
def test_data_input(self):
G=self.Graph(data={1:[2],2:[1]}, name="test")
assert_equal(G.name,"test")
assert_equal(sorted(G.adj.items()),[(1, {2: {0:{}}}), (2, {1: {0:{}}})])
def test_getitem(self):
G=self.K3
assert_equal(G[0],{1: {0:{}}, 2: {0:{}}})
assert_raises(KeyError, G.__getitem__, 'j')
assert_raises((TypeError,networkx.NetworkXError), G.__getitem__, ['A'])
def test_remove_node(self):
G=self.K3
G.remove_node(0)
assert_equal(G.adj,{1:{2:{0:{}}},2:{1:{0:{}}}})
assert_raises((KeyError,networkx.NetworkXError), G.remove_node,-1)
def test_add_edge(self):
G=self.Graph()
G.add_edge(0,1)
assert_equal(G.adj,{0: {1: {0:{}}}, 1: {0: {0:{}}}})
G=self.Graph()
G.add_edge(*(0,1))
assert_equal(G.adj,{0: {1: {0:{}}}, 1: {0: {0:{}}}})
def test_add_edge_conflicting_key(self):
G=self.Graph()
G.add_edge(0,1,key=1)
G.add_edge(0,1)
assert_equal(G.number_of_edges(),2)
G=self.Graph()
G.add_edges_from([(0,1,1,{})])
G.add_edges_from([(0,1)])
assert_equal(G.number_of_edges(),2)
def test_add_edges_from(self):
G=self.Graph()
G.add_edges_from([(0,1),(0,1,{'weight':3})])
assert_equal(G.adj,{0: {1: {0:{},1:{'weight':3}}},
1: {0: {0:{},1:{'weight':3}}}})
G.add_edges_from([(0,1),(0,1,{'weight':3})],weight=2)
assert_equal(G.adj,{0: {1: {0:{},1:{'weight':3},
2:{'weight':2},3:{'weight':3}}},
1: {0: {0:{},1:{'weight':3},
2:{'weight':2},3:{'weight':3}}}})
# too few in tuple
assert_raises(networkx.NetworkXError, G.add_edges_from,[(0,)])
# too many in tuple
assert_raises(networkx.NetworkXError, G.add_edges_from,[(0,1,2,3,4)])
assert_raises(TypeError, G.add_edges_from,[0]) # not a tuple
def test_remove_edge(self):
G=self.K3
G.remove_edge(0,1)
assert_equal(G.adj,{0: {2: {0: {}}},
1: {2: {0: {}}},
2: {0: {0: {}},
1: {0: {}}}})
assert_raises((KeyError,networkx.NetworkXError), G.remove_edge,-1,0)
assert_raises((KeyError,networkx.NetworkXError), G.remove_edge,0,2,
key=1)
def test_remove_edges_from(self):
G=self.K3.copy()
G.remove_edges_from([(0,1)])
assert_equal(G.adj,{0:{2:{0:{}}},1:{2:{0:{}}},2:{0:{0:{}},1:{0:{}}}})
G.remove_edges_from([(0,0)]) # silent fail
self.K3.add_edge(0,1)
G=self.K3.copy()
G.remove_edges_from(G.edges(data=True,keys=True))
assert_equal(G.adj,{0:{},1:{},2:{}})
G=self.K3.copy()
G.remove_edges_from(G.edges(data=False,keys=True))
assert_equal(G.adj,{0:{},1:{},2:{}})
G=self.K3.copy()
G.remove_edges_from(G.edges(data=False,keys=False))
assert_equal(G.adj,{0:{},1:{},2:{}})
G=self.K3.copy()
G.remove_edges_from([(0,1,0),(0,2,0,{}),(1,2)])
assert_equal(G.adj,{0:{1:{1:{}}},1:{0:{1:{}}},2:{}})
def test_remove_multiedge(self):
G=self.K3
G.add_edge(0,1,key='parallel edge')
G.remove_edge(0,1,key='parallel edge')
assert_equal(G.adj,{0: {1: {0:{}}, 2: {0:{}}},
1: {0: {0:{}}, 2: {0:{}}},
2: {0: {0:{}}, 1: {0:{}}}})
G.remove_edge(0,1)
assert_equal(G.adj,{0:{2:{0:{}}},1:{2:{0:{}}},2:{0:{0:{}},1:{0:{}}}})
assert_raises((KeyError,networkx.NetworkXError), G.remove_edge,-1,0)
|
