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
|
import json
from nose.tools import assert_equal, assert_raises, assert_not_equal,assert_true
import networkx as nx
from networkx.readwrite.json_graph import *
class TestAdjacency:
def test_graph(self):
G = nx.path_graph(4)
H = adjacency_graph(adjacency_data(G))
nx.is_isomorphic(G,H)
def test_graph_attributes(self):
G = nx.path_graph(4)
G.add_node(1,color='red')
G.add_edge(1,2,width=7)
G.graph['foo']='bar'
G.graph[1]='one'
H = adjacency_graph(adjacency_data(G))
assert_equal(H.graph['foo'],'bar')
assert_equal(H.node[1]['color'],'red')
assert_equal(H[1][2]['width'],7)
d = json.dumps(adjacency_data(G))
H = adjacency_graph(json.loads(d))
assert_equal(H.graph['foo'],'bar')
assert_equal(H.graph[1],'one')
assert_equal(H.node[1]['color'],'red')
assert_equal(H[1][2]['width'],7)
def test_digraph(self):
G = nx.DiGraph()
G.add_path([1,2,3])
H = adjacency_graph(adjacency_data(G))
assert_true(H.is_directed())
nx.is_isomorphic(G,H)
def test_multidigraph(self):
G = nx.MultiDiGraph()
G.add_path([1,2,3])
H = adjacency_graph(adjacency_data(G))
assert_true(H.is_directed())
assert_true(H.is_multigraph())
def test_multigraph(self):
G = nx.MultiGraph()
G.add_edge(1,2,key='first')
G.add_edge(1,2,key='second',color='blue')
H = adjacency_graph(adjacency_data(G))
nx.is_isomorphic(G,H)
assert_equal(H[1][2]['second']['color'],'blue')
|
