/usr/lib/python3/dist-packages/networkx/tests/test_convert.py is in python3-networkx 1.11-1ubuntu2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | #!/usr/bin/env python
from nose.tools import *
from networkx import *
from networkx.convert import *
from networkx.algorithms.operators import *
from networkx.generators.classic import barbell_graph,cycle_graph
class TestConvert():
def edgelists_equal(self,e1,e2):
return sorted(sorted(e) for e in e1)==sorted(sorted(e) for e in e2)
def test_simple_graphs(self):
for dest, source in [(to_dict_of_dicts, from_dict_of_dicts),
(to_dict_of_lists, from_dict_of_lists)]:
G=barbell_graph(10,3)
dod=dest(G)
# Dict of [dicts, lists]
GG=source(dod)
assert_equal(sorted(G.nodes()), sorted(GG.nodes()))
assert_equal(sorted(G.edges()), sorted(GG.edges()))
GW=to_networkx_graph(dod)
assert_equal(sorted(G.nodes()), sorted(GW.nodes()))
assert_equal(sorted(G.edges()), sorted(GW.edges()))
GI=Graph(dod)
assert_equal(sorted(G.nodes()), sorted(GI.nodes()))
assert_equal(sorted(G.edges()), sorted(GI.edges()))
# With nodelist keyword
P4=path_graph(4)
P3=path_graph(3)
dod=dest(P4,nodelist=[0,1,2])
Gdod=Graph(dod)
assert_equal(sorted(Gdod.nodes()), sorted(P3.nodes()))
assert_equal(sorted(Gdod.edges()), sorted(P3.edges()))
def test_digraphs(self):
for dest, source in [(to_dict_of_dicts, from_dict_of_dicts),
(to_dict_of_lists, from_dict_of_lists)]:
G=cycle_graph(10)
# Dict of [dicts, lists]
dod=dest(G)
GG=source(dod)
assert_equal(sorted(G.nodes()), sorted(GG.nodes()))
assert_equal(sorted(G.edges()), sorted(GG.edges()))
GW=to_networkx_graph(dod)
assert_equal(sorted(G.nodes()), sorted(GW.nodes()))
assert_equal(sorted(G.edges()), sorted(GW.edges()))
GI=Graph(dod)
assert_equal(sorted(G.nodes()), sorted(GI.nodes()))
assert_equal(sorted(G.edges()), sorted(GI.edges()))
G=cycle_graph(10,create_using=DiGraph())
dod=dest(G)
GG=source(dod, create_using=DiGraph())
assert_equal(sorted(G.nodes()), sorted(GG.nodes()))
assert_equal(sorted(G.edges()), sorted(GG.edges()))
GW=to_networkx_graph(dod, create_using=DiGraph())
assert_equal(sorted(G.nodes()), sorted(GW.nodes()))
assert_equal(sorted(G.edges()), sorted(GW.edges()))
GI=DiGraph(dod)
assert_equal(sorted(G.nodes()), sorted(GI.nodes()))
assert_equal(sorted(G.edges()), sorted(GI.edges()))
def test_graph(self):
G=cycle_graph(10)
e=G.edges()
source=[u for u,v in e]
dest=[v for u,v in e]
ex=zip(source,dest,source)
G=Graph()
G.add_weighted_edges_from(ex)
# Dict of dicts
dod=to_dict_of_dicts(G)
GG=from_dict_of_dicts(dod,create_using=Graph())
assert_equal(sorted(G.nodes()), sorted(GG.nodes()))
assert_equal(sorted(G.edges()), sorted(GG.edges()))
GW=to_networkx_graph(dod,create_using=Graph())
assert_equal(sorted(G.nodes()), sorted(GW.nodes()))
assert_equal(sorted(G.edges()), sorted(GW.edges()))
GI=Graph(dod)
assert_equal(sorted(G.nodes()), sorted(GI.nodes()))
assert_equal(sorted(G.edges()), sorted(GI.edges()))
# Dict of lists
dol=to_dict_of_lists(G)
GG=from_dict_of_lists(dol,create_using=Graph())
# dict of lists throws away edge data so set it to none
enone=[(u,v,{}) for (u,v,d) in G.edges(data=True)]
assert_equal(sorted(G.nodes()), sorted(GG.nodes()))
assert_equal(enone, sorted(GG.edges(data=True)))
GW=to_networkx_graph(dol,create_using=Graph())
assert_equal(sorted(G.nodes()), sorted(GW.nodes()))
assert_equal(enone, sorted(GW.edges(data=True)))
GI=Graph(dol)
assert_equal(sorted(G.nodes()), sorted(GI.nodes()))
assert_equal(enone, sorted(GI.edges(data=True)))
def test_with_multiedges_self_loops(self):
G=cycle_graph(10)
e=G.edges()
source,dest = list(zip(*e))
ex=list(zip(source,dest,source))
XG=Graph()
XG.add_weighted_edges_from(ex)
XGM=MultiGraph()
XGM.add_weighted_edges_from(ex)
XGM.add_edge(0,1,weight=2) # multiedge
XGS=Graph()
XGS.add_weighted_edges_from(ex)
XGS.add_edge(0,0,weight=100) # self loop
# Dict of dicts
# with self loops, OK
dod=to_dict_of_dicts(XGS)
GG=from_dict_of_dicts(dod,create_using=Graph())
assert_equal(sorted(XGS.nodes()), sorted(GG.nodes()))
assert_equal(sorted(XGS.edges()), sorted(GG.edges()))
GW=to_networkx_graph(dod,create_using=Graph())
assert_equal(sorted(XGS.nodes()), sorted(GW.nodes()))
assert_equal(sorted(XGS.edges()), sorted(GW.edges()))
GI=Graph(dod)
assert_equal(sorted(XGS.nodes()), sorted(GI.nodes()))
assert_equal(sorted(XGS.edges()), sorted(GI.edges()))
# Dict of lists
# with self loops, OK
dol=to_dict_of_lists(XGS)
GG=from_dict_of_lists(dol,create_using=Graph())
# dict of lists throws away edge data so set it to none
enone=[(u,v,{}) for (u,v,d) in XGS.edges(data=True)]
assert_equal(sorted(XGS.nodes()), sorted(GG.nodes()))
assert_equal(enone, sorted(GG.edges(data=True)))
GW=to_networkx_graph(dol,create_using=Graph())
assert_equal(sorted(XGS.nodes()), sorted(GW.nodes()))
assert_equal(enone, sorted(GW.edges(data=True)))
GI=Graph(dol)
assert_equal(sorted(XGS.nodes()), sorted(GI.nodes()))
assert_equal(enone, sorted(GI.edges(data=True)))
# Dict of dicts
# with multiedges, OK
dod=to_dict_of_dicts(XGM)
GG=from_dict_of_dicts(dod,create_using=MultiGraph(),
multigraph_input=True)
assert_equal(sorted(XGM.nodes()), sorted(GG.nodes()))
assert_equal(sorted(XGM.edges()), sorted(GG.edges()))
GW=to_networkx_graph(dod,create_using=MultiGraph(),multigraph_input=True)
assert_equal(sorted(XGM.nodes()), sorted(GW.nodes()))
assert_equal(sorted(XGM.edges()), sorted(GW.edges()))
GI=MultiGraph(dod) # convert can't tell whether to duplicate edges!
assert_equal(sorted(XGM.nodes()), sorted(GI.nodes()))
#assert_not_equal(sorted(XGM.edges()), sorted(GI.edges()))
assert_false(sorted(XGM.edges()) == sorted(GI.edges()))
GE=from_dict_of_dicts(dod,create_using=MultiGraph(),
multigraph_input=False)
assert_equal(sorted(XGM.nodes()), sorted(GE.nodes()))
assert_not_equal(sorted(XGM.edges()), sorted(GE.edges()))
GI=MultiGraph(XGM)
assert_equal(sorted(XGM.nodes()), sorted(GI.nodes()))
assert_equal(sorted(XGM.edges()), sorted(GI.edges()))
GM=MultiGraph(G)
assert_equal(sorted(GM.nodes()), sorted(G.nodes()))
assert_equal(sorted(GM.edges()), sorted(G.edges()))
# Dict of lists
# with multiedges, OK, but better write as DiGraph else you'll
# get double edges
dol=to_dict_of_lists(G)
GG=from_dict_of_lists(dol,create_using=MultiGraph())
assert_equal(sorted(G.nodes()), sorted(GG.nodes()))
assert_equal(sorted(G.edges()), sorted(GG.edges()))
GW=to_networkx_graph(dol,create_using=MultiGraph())
assert_equal(sorted(G.nodes()), sorted(GW.nodes()))
assert_equal(sorted(G.edges()), sorted(GW.edges()))
GI=MultiGraph(dol)
assert_equal(sorted(G.nodes()), sorted(GI.nodes()))
assert_equal(sorted(G.edges()), sorted(GI.edges()))
def test_edgelists(self):
P=path_graph(4)
e=[(0,1),(1,2),(2,3)]
G=Graph(e)
assert_equal(sorted(G.nodes()), sorted(P.nodes()))
assert_equal(sorted(G.edges()), sorted(P.edges()))
assert_equal(sorted(G.edges(data=True)), sorted(P.edges(data=True)))
e=[(0,1,{}),(1,2,{}),(2,3,{})]
G=Graph(e)
assert_equal(sorted(G.nodes()), sorted(P.nodes()))
assert_equal(sorted(G.edges()), sorted(P.edges()))
assert_equal(sorted(G.edges(data=True)), sorted(P.edges(data=True)))
e=((n,n+1) for n in range(3))
G=Graph(e)
assert_equal(sorted(G.nodes()), sorted(P.nodes()))
assert_equal(sorted(G.edges()), sorted(P.edges()))
assert_equal(sorted(G.edges(data=True)), sorted(P.edges(data=True)))
def test_directed_to_undirected(self):
edges1 = [(0, 1), (1, 2), (2, 0)]
edges2 = [(0, 1), (1, 2), (0, 2)]
assert_true(self.edgelists_equal(nx.Graph(nx.DiGraph(edges1)).edges(),edges1))
assert_true(self.edgelists_equal(nx.Graph(nx.DiGraph(edges2)).edges(),edges1))
assert_true(self.edgelists_equal(nx.MultiGraph(nx.DiGraph(edges1)).edges(),edges1))
assert_true(self.edgelists_equal(nx.MultiGraph(nx.DiGraph(edges2)).edges(),edges1))
assert_true(self.edgelists_equal(nx.MultiGraph(nx.MultiDiGraph(edges1)).edges(),
edges1))
assert_true(self.edgelists_equal(nx.MultiGraph(nx.MultiDiGraph(edges2)).edges(),
edges1))
assert_true(self.edgelists_equal(nx.Graph(nx.MultiDiGraph(edges1)).edges(),edges1))
assert_true(self.edgelists_equal(nx.Graph(nx.MultiDiGraph(edges2)).edges(),edges1))
|