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
|
# sAsync:
# An enhancement to the SQLAlchemy package that provides persistent
# dictionaries, text indexing and searching, and an access broker for
# conveniently managing database access, table setup, and
# transactions. Everything can be run in an asynchronous fashion using the
# Twisted framework and its deferred processing capabilities.
#
# Copyright (C) 2006 by Edwin A. Suominen, http://www.eepatents.com
#
# This program is free software; you can redistribute it and/or modify it under
# the terms of the GNU General Public License as published by the Free Software
# Foundation; either version 2 of the License, or (at your option) any later
# version.
#
# This program is distributed in the hope that it will be useful, but WITHOUT
# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
# FOR A PARTICULAR PURPOSE. See the file COPYING for more details.
#
# You should have received a copy of the GNU General Public License along with
# this program; if not, write to the Free Software Foundation, Inc., 51
# Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
"""
Unit tests for graph
"""
import random
from twisted.internet import defer, reactor
from twisted.trial.unittest import TestCase
import networkx as NX
import sasync.graph as graph
VERBOSE = False
db = 'graph.db'
URL = "sqlite:///%s" % db
def deferToDelay(result, delay=0.1):
d = defer.Deferred()
reactor.callLater(delay, d.callback, result)
return d
class BaseMixin:
def cloneGraph(self, G):
graphName, graphClass = G.name, G.__class__
H = graphClass(graphName, URL, nodeType=int)
return H, H.startup()
def newGraph(self, name, diGraph=False, startFresh=False):
G = (
graph.Graph,
graph.DiGraph
)[diGraph](name, URL, startFresh=startFresh, nodeType=int)
return G
def graphGenerator(self, name, startFresh=True):
"""
Yields dicts containing a persistent (Di)Graph object under test. If
C{populated}, each dict contains a regular NX.Graph object with some
data. If C{clear}, the test (Di)Graph object is guaranteed to be empty,
and of course is not C{populated}.
"""
for diGraph in (False, True):
if VERBOSE:
graphType = ('Graph', 'DiGraph')[diGraph]
print "\n\nTesting %s ..." % graphType
G = self.newGraph(
name, diGraph=diGraph, startFresh=startFresh)
if VERBOSE:
edgeStrings = [str(x) for x in G.edges()]
if edgeStrings:
print "\t\t...with edges %s" % '\n'.join(edgeStrings)
else:
print "\t\t...with NO edges"
yield G, diGraph
def failUnlessSameListElements(self, listA, listB):
if not isinstance(listA, (list, tuple)):
listA = [listA]
listB = [listB]
listA.sort()
listB.sort()
for k, u in enumerate(listA):
self.failUnlessEqual(
u, listB[k],
"Element '%s' in list %s != '%s' in list %s" % \
(u, listA, listB[k], listB))
def failUnlessGraphsEqual(self, G1, G2):
args = [G.edges() for G in (G1, G2)]
for k, graphName in enumerate(('G1', 'G2')):
if VERBOSE and not args[k]:
print "\tWARNING: Testing if G1 and G2 " +\
"are identical, but %s is empty" % graphName
args[k].sort()
args.append(
"Graphs are not identical: %s vs %s" % (G1.edges(), G2.edges()))
return self.failUnlessEqual(*args)
class CommonTestsMixin(BaseMixin):
def tearDown(self):
return self.G.shutdown()
def testAddNodes(self):
def first(null):
self.H, d = self.cloneGraph(self.G)
return d
def second(null):
nodes = self.H.nodes()
self.failUnlessSameListElements(nodes, [1, 2])
self.G.add_node(1)
self.G.add_node(2)
d = self.G.shutdown()
d.addCallback(first)
d.addCallback(second)
return d
def testWaitForWrites(self):
edge = random.sample(xrange(100), 2)
def first(null):
self.H, d = self.cloneGraph(self.G)
return d
def second(null):
if isinstance(self.G, graph.DiGraph):
self.failUnlessGraphsEqual(self.G, self.H)
else:
nodes = self.H.nodes()
self.failUnlessSameListElements(nodes, edge)
self.G.add_edge(*edge)
d = self.G.deferToWrites()
d.addCallback(first)
d.addCallback(second)
return d
class TestGraphBasics(CommonTestsMixin, TestCase):
def setUp(self):
self.G = graph.Graph('foo', URL, nodeType=int)
return self.G.startup(startFresh=True)
def testAddEdges(self):
self.G.add_edge(1, 2)
self.G.add_edge(2, 3)
nodes = self.G.nodes()
self.failUnlessSameListElements(nodes, [1, 2, 3])
edges = self.G.edges()
self.failUnlessSameListElements(edges, [(1,2), (2,3)])
class TestDiGraphBasics(CommonTestsMixin, TestCase):
def setUp(self):
self.G = graph.DiGraph('bar', URL, nodeType=int)
return self.G.startup(startFresh=True)
def testAddEdges(self):
self.G.add_edge(1, 2)
self.G.add_edge(2, 3)
nodes = self.G.nodes()
self.failUnlessSameListElements(nodes, [1, 2, 3])
edges = self.G.edges()
self.failUnlessSameListElements(edges, [(1,2), (2,3)])
class TestGraphPersistence(BaseMixin, TestCase):
"""
Do pnetwork.Graph and pnetworkx.DiGraph act like NX.Graph and NX.DiGraph
items, except for their special persistency features?
"""
def testPersists(self):
@defer.deferredGenerator
def run():
for G1, diGraph in self.graphGenerator('alpha'):
yield defer.waitForDeferred(G1.startup())
G1.add_edge(1, 2)
yield defer.waitForDeferred(G1.deferToWrites())
G2 = self.newGraph('alpha', diGraph=diGraph, startFresh=False)
yield defer.waitForDeferred(G2.startup())
self.failUnlessGraphsEqual(G1, G2)
yield defer.waitForDeferred(G1.shutdown())
yield defer.waitForDeferred(G2.shutdown())
return run()
def testDifferentAlistForDifferentNames(self):
@defer.deferredGenerator
def run():
for G1, diGraph in self.graphGenerator('charlie'):
yield defer.waitForDeferred(G1.startup())
G2 = self.newGraph('delta', diGraph=diGraph)
yield defer.waitForDeferred(G2.startup())
self.failIfEqual(id(G1.adj), id(G2.adj))
yield defer.waitForDeferred(G1.shutdown())
yield defer.waitForDeferred(G2.shutdown())
return run()
|
