def net(X, Y) :
g = Graph()
edges = []
fs = '%i_%i'
for x in range(X):
for y in range(Y):
g.add_vertex(fs % (x,y))
o = (x, y)
d = (x, y-1)
edges.append((o, d, 3))
d = (x, y+1)
edges.append((o, d, 3))
d = (x-1, y)
edges.append((o, d, 4))
d = (x+1, y)
edges.append((o, d, 4))
d = (x-1, y-1)
edges.append((o, d, 5))
d = (x-1, y+1)
edges.append((o, d, 5))
d = (x+1, y-1)
edges.append((o, d, 5))
d = (x+1, y+1)
edges.append((o, d, 5))
for o, d, w in edges:
try:
g.add_edge(fs%o, fs%d, ElapseTime(w))
except VertexNotFoundError:
pass
return g
def graph_load_gtfsdb( agency_namespace, gtfsdb, agency_id=None, maxtrips=None, reporter=sys.stdout ):
compiler = GTFSGraphCompiler( gtfsdb, agency_namespace, agency_id, reporter )
gg = Graph()
for fromv_label, tov_label, edge in compiler.gtfsdb_to_edges( maxtrips ):
gg.add_vertex( fromv_label )
gg.add_vertex( tov_label )
gg.add_edge( fromv_label, tov_label, edge )
return gg
def __init__(self, graphdb_filename, vertex_events, edge_events, vertex_reverse_geocoders):
if os.path.exists("%s.gbin" % graphdb_filename):
self.graph = Graph()
self.graph.deserialize(graphdb_filename, os.path.exists("%s.gmm" % graphdb_filename))
else:
graphdb = GraphDatabase( graphdb_filename )
self.graph = graphdb.incarnate()
self.vertex_events = vertex_events
self.edge_events = edge_events
self.vertex_reverse_geocoders = vertex_reverse_geocoders
def filter(self, osmdb, *args):
g = Graph()
t0 = time.time()
vertices = {}
print "load vertices into memory"
for row in osmdb.execute("SELECT id from nodes"):
g.add_vertex(str(row[0]))
vertices[str(row[0])] = 0
print "load ways into memory"
for way in osmdb.ways():
g.add_edge(way.nds[0], way.nds[-1], Link())
g.add_edge(way.nds[-1], way.nds[0], Link())
t1 = time.time()
print "populating graph took: %f" % (t1 - t0)
t0 = t1
iteration = 1
c = osmdb.cursor()
while True:
#c.execute("SELECT id from nodes where id not in (SELECT node_id from graph_nodes) LIMIT 1")
try:
vertex, dummy = vertices.popitem()
except:
break
spt = g.shortest_path_tree(vertex, None, State(1, 0))
for v in spt.vertices:
vertices.pop(v.label, None)
c.execute("INSERT into graph_nodes VALUES (?, ?)",
(iteration, v.label))
spt.destroy()
t1 = time.time()
print "pass %s took: %f" % (iteration, t1 - t0)
t0 = t1
iteration += 1
c.close()
osmdb.conn.commit()
g.destroy()
# audit
for gnum, count in osmdb.execute(
"SELECT graph_num, count(*) FROM graph_nodes GROUP BY graph_num"
):
print "FOUND: %s=%s" % (gnum, count)
def test_basic(self):
g = Graph()
g.add_vertex("A")
g.add_vertex("B")
g.add_edge("A", "B", Link())
g.add_edge("A", "B", Street("foo", 20.0))
gdb_file = os.path.dirname(__file__) + "unit_test.db"
if os.path.exists(gdb_file):
os.remove(gdb_file)
gdb = GraphDatabase(gdb_file)
gdb.populate(g)
list(gdb.execute("select * from resources"))
assert "A" in list(gdb.all_vertex_labels())
assert "B" in list(gdb.all_vertex_labels())
assert glen(gdb.all_edges()) == 2
assert glen(gdb.all_outgoing("A")) == 2
assert glen(gdb.all_outgoing("B")) == 0
assert glen(gdb.all_incoming("A")) == 0
assert glen(gdb.all_incoming("B")) == 2
assert glen(gdb.resources()) == 0
assert gdb.num_vertices() == 2
assert gdb.num_edges() == 2
g.destroy()
g = gdb.incarnate()
list(gdb.execute("select * from resources"))
assert "A" in list(gdb.all_vertex_labels())
assert "B" in list(gdb.all_vertex_labels())
assert glen(gdb.all_edges()) == 2
assert glen(gdb.all_outgoing("A")) == 2
assert glen(gdb.all_outgoing("B")) == 0
assert glen(gdb.all_incoming("A")) == 0
assert glen(gdb.all_incoming("B")) == 2
assert glen(gdb.resources()) == 0
assert gdb.num_vertices() == 2
assert gdb.num_edges() == 2
os.remove(gdb_file)
def test_ch(self):
g = Graph()
g.add_vertex( "A" )
g.add_vertex( "B" )
g.add_vertex( "C" )
g.add_edge( "A", "B", Street( "foo", 10 ) )
g.add_edge( "B", "C", Street( "bar", 10 ) )
g.add_edge( "C", "A", Street( "baz", 10 ) )
wo = WalkOptions()
ch = g.get_contraction_hierarchies(wo)
gdb_file = os.path.dirname(__file__) + "unit_test.db"
gdb = GraphDatabase( gdb_file )
gdb.populate( ch.upgraph )
laz = gdb.incarnate()
combo = laz.edges[1]
self.assertEqual( combo.payload.get(0).name, "baz" )
self.assertEqual( combo.payload.get(1).name, "foo" )
os.remove( gdb_file )
def test_basic(self):
g = Graph()
g.add_vertex("A")
g.add_vertex("B")
g.add_edge("A", "B", Link())
g.add_edge("A", "B", Street("foo", 20.0))
gdb_file = os.path.dirname(__file__) + "unit_test.db"
if os.path.exists(gdb_file):
os.remove(gdb_file)
gdb = GraphDatabase(gdb_file)
gdb.populate(g)
list(gdb.execute("select * from resources"))
assert "A" in list(gdb.all_vertex_labels())
assert "B" in list(gdb.all_vertex_labels())
assert glen(gdb.all_edges()) == 2
assert glen(gdb.all_outgoing("A")) == 2
assert glen(gdb.all_outgoing("B")) == 0
assert glen(gdb.all_incoming("A")) == 0
assert glen(gdb.all_incoming("B")) == 2
assert glen(gdb.resources()) == 0
assert gdb.num_vertices() == 2
assert gdb.num_edges() == 2
g.destroy()
g = gdb.incarnate()
list(gdb.execute("select * from resources"))
assert "A" in list(gdb.all_vertex_labels())
assert "B" in list(gdb.all_vertex_labels())
assert glen(gdb.all_edges()) == 2
assert glen(gdb.all_outgoing("A")) == 2
assert glen(gdb.all_outgoing("B")) == 0
assert glen(gdb.all_incoming("A")) == 0
assert glen(gdb.all_incoming("B")) == 2
assert glen(gdb.resources()) == 0
assert gdb.num_vertices() == 2
assert gdb.num_edges() == 2
os.remove( gdb_file )
def filter(self, osmdb, *args):
g = Graph()
t0 = time.time()
vertices = {}
print "load vertices into memory"
for row in osmdb.execute("SELECT id from nodes"):
g.add_vertex(str(row[0]))
vertices[str(row[0])] = 0
print "load ways into memory"
for way in osmdb.ways():
g.add_edge(way.nds[0], way.nds[-1], Link())
g.add_edge(way.nds[-1], way.nds[0], Link())
t1 = time.time()
print "populating graph took: %f"%(t1-t0)
t0 = t1
iteration = 1
c = osmdb.cursor()
while True:
#c.execute("SELECT id from nodes where id not in (SELECT node_id from graph_nodes) LIMIT 1")
try:
vertex, dummy = vertices.popitem()
except:
break
spt = g.shortest_path_tree(vertex, None, State(1,0))
for v in spt.vertices:
vertices.pop(v.label, None)
c.execute("INSERT into graph_nodes VALUES (?, ?)", (iteration, v.label))
spt.destroy()
t1 = time.time()
print "pass %s took: %f"%(iteration, t1-t0)
t0 = t1
iteration += 1
c.close()
osmdb.conn.commit()
g.destroy()
# audit
for gnum, count in osmdb.execute("SELECT graph_num, count(*) FROM graph_nodes GROUP BY graph_num"):
print "FOUND: %s=%s" % (gnum, count)
def test_get_route_retro(self):
"Check it finds the route we expect, in reverse"
g = Graph()
reader = csv.reader(open("../performance_test/map.csv"))
for wayid, fromv, tov, length in reader:
g.add_vertex( fromv )
g.add_vertex( tov )
g.add_edge( fromv, tov, Street( wayid, float(length) ) )
v85thStreet = "53184534"
vBeaconAve = "53072051"
idealVertices = ['53184534', '53193013', '69374666', '53193014', '69474340', '53185600', '53077802', '69474361', '53090673', '53193015', '53193016', '53193017', '53193018', '53189027', '53193019', '53193020', '53112767', '53193021', '69516594', '53132048', '69516588', '53095152', '53132049', '53239899', '53147269', '53138815', '69516553', '53138764', '53194375', '53185509', '53194376', '53144840', '53178633', '53178635', '53194364', '53125622', '53045160', '53194365', '53194366', '53194367', '53194368', '53185796', '53194369', '53086028', '90251330', '90251121', '30789993', '30789998', '31394282', '31393878', '29977892', '124205994', '31428350', '29545469', '29545479', '29545426', '29545421', '29545417', '29545423', '29484769', '29484785', '29545373', '29979589', '30078988', '30079048', '244420183', '29979596', '29979598', '30230262', '30230264', '30279409', '30279408', '30230266', '30230273', '30230277', '30230281', '30230300', '30230506', '30231231', '30230962', '60878121', '53224639', '53210038', '53081902', '53052413', '53210039', '53224626', '53168444', '53224629', '53224632', '53208783', '53083017', '53083040', '53208784', '53187334', '53187337', '53089335', '53066732', '53208785', '53178012', '53208786', '53152490', '53183929', '53146692', '53146065', '53083086', '53083102', '53113957', '53113944', '53190685', '53203056', '53167007', '53129046', '53098715', '53208787', '53208788', '53180738', '53072051']
idealEdges = ['9112003-8', '6438432-0', '6438432-1', '6438432-2', '6438432-3', '6438432-4', '6438432-5', '6438432-6', '6438432-7', '6438432-8', '6438432-9', '6438432-10', '6438432-11', '6438432-12', '6438432-13', '6438432-14', '6438432-15', '6438432-16', '6438432-17', '6386686-0', '6386686-1', '6386686-2', '6497278-2', '6497278-3', '6497278-4', '6497278-5', '6497278-6', '6514850-51', '6439614-0', '6439614-1', '6439614-2', '6439614-3', '15255537-1', '6439607-0', '6439607-1', '6439607-2', '6439607-3', '6439607-4', '6439607-5', '6439607-6', '6439607-7', '6439607-8', '6439607-9', '6439607-10', '10497741-3', '10497743-3', '4709507-4', '4709507-5', '4709507-6', '4709507-7', '4709507-8', '4869151-0', '4869146-0', '4644189-0', '4644192-0', '4644159-0', '4869146-3', '4869146-4', '4644156-0', '4722460-0', '4722460-1', '4722460-2', '4722460-3', '4722460-4', '4722460-5', '4722460-6', '14017470-0', '14017470-1', '5130429-0', '13866257-0', '13866256-0', '4748963-0', '4748962-0', '4748962-1', '15257844-0', '15257848-0', '15257848-1', '4743936-0', '4743934-0', '4743897-3', '4743897-4', '8116116-0', '6457969-20', '6457969-21', '6457969-22', '6476943-0', '6476943-1', '6476943-2', '6476943-3', '6476943-4', '6456455-20', '6456455-21', '6456455-22', '6456455-23', '6456455-24', '6456455-25', '6456455-26', '6456455-27', '6456455-28', '6456455-29', '6456455-30', '6456455-31', '6456455-32', '6456455-33', '6456455-34', '6456455-35', '6456455-36', '6456455-37', '6456455-38', '6456455-39', '6456455-40', '6456455-41', '6456455-42', '6456455-43', '6456455-44', '6456455-45', '6456455-46']
spt = g.shortest_path_tree_retro( v85thStreet, vBeaconAve, State(g.numagencies,31505), WalkOptions() )
vertices, edges = spt.path_retro( v85thStreet )
assert spt.get_vertex(v85thStreet).payload.time == 63
assert spt.get_vertex(v85thStreet).payload.weight == 17022003
assert [v.label for v in vertices] == idealVertices
assert [e.payload.name for e in edges] == idealEdges
vBallardAve = "53115442"
vLakeCityWay = "124175598"
idealVertices = ['53115442', '53115445', '53115446', '53227448', '53158020', '53105937', '53148458', '53077817', '53077819', '53077821', '53077823', '53077825', '53077826', '53077828', '53077830', '53077832', '53077833', '53153886', '53181632', '53246786', '53078069', '53247761', '53129527', '53203543', '53248413', '53182343', '53156127', '53227471', '53240242', '53109739', '53248420', '53234775', '53170822', '53115167', '53209384', '53134650', '53142180', '53087702', '53184534', '53193013', '69374666', '53193014', '69474340', '53185600', '53077802', '69474361', '53090673', '53193015', '53193016', '53193017', '53193018', '53189027', '53193019', '53193020', '53112767', '53193021', '53183554', '53213063', '53197105', '53213061', '53090659', '53213059', '53157290', '53062869', '53213057', '53213055', '53213054', '53184527', '67507140', '67507145', '67507034', '67507151', '67507040', '67507158', '53210973', '53147258', '53210974', '53210975', '60002793', '60002790', '60002789', '60002786', '60002787', '88468933', '53125662', '53195800', '88486410', '53228492', '88486425', '53215121', '88486457', '53199820', '53185765', '53233322', '53227223', '88486676', '53086030', '53086045', '53204778', '88486720', '53204762', '88486429', '53139133', '53139142', '88486453', '53072465', '30790081', '30790104', '53072467', '124181376', '30759113', '53072469', '53072472', '53072473', '53072475', '53072476', '53072477', '53072478', '124175598']
idealEdges = ['6372784-0', '6372784-1', '6480699-3', '6517019-4', '6517019-5', '6517019-6', '6517019-7', '6346366-0', '6346366-1', '6346366-2', '6346366-3', '6346366-4', '6346366-5', '6346366-6', '6346366-7', '6346366-8', '10379527-1', '6511156-2', '6511156-3', '6511156-4', '6511156-5', '6511156-6', '6511156-7', '6511156-8', '6511156-9', '6511156-10', '6511156-11', '6511156-12', '6511156-13', '6511156-14', '9112003-0', '9112003-1', '9112003-2', '9112003-3', '9112003-4', '9112003-5', '9112003-6', '9112003-7', '9112003-8', '6438432-0', '6438432-1', '6438432-2', '6438432-3', '6438432-4', '6438432-5', '6438432-6', '6438432-7', '6438432-8', '6438432-9', '6438432-10', '6438432-11', '6438432-12', '6438432-13', '6438432-14', '6438432-15', '10425996-0', '10425996-1', '10425996-2', '10425996-3', '10425996-4', '10425996-5', '10425996-6', '10425996-7', '10425996-8', '10425996-9', '10425996-10', '10425996-11', '10425996-12', '9116336-2', '9116336-3', '9116346-1', '9116346-2', '9116346-3', '6459254-1', '6459254-2', '6459254-3', '6459254-4', '6459254-5', '4794350-10', '4794350-11', '4794350-12', '6488959-6', '6488959-7', '6488959-8', '6488959-9', '6488959-10', '6488959-11', '6488959-12', '6488959-13', '6488959-14', '6488959-15', '6488959-16', '6488959-17', '6488959-18', '6488959-19', '6488959-20', '6488959-21', '6488959-22', '6488959-23', '6488959-24', '6488959-25', '6488959-26', '6488959-27', '6488959-28', '6488959-29', '6344932-0', '6344932-1', '6344932-2', '13514591-0', '13514602-0', '13514602-1', '13514602-2', '8591344-0', '8591344-1', '8591344-2', '8591344-3', '8591344-4', '8591344-5']
spt = g.shortest_path_tree_retro( vBallardAve, vLakeCityWay, State(g.numagencies,13684) )
vertices, edges = spt.path_retro( vBallardAve )
assert spt.get_vertex(vBallardAve).payload.time == -8
assert spt.get_vertex(vBallardAve).payload.weight == 196300
assert [v.label for v in vertices] == idealVertices
assert [e.payload.name for e in edges] == idealEdges
def incarnate(self, reporter=sys.stdout):
g = Graph()
num_vertices = self.num_vertices()
for i, vertex_label in enumerate( self.all_vertex_labels() ):
if reporter and i%5000==0:
reporter.write("\r%d/%d vertices"%(i,num_vertices) )
reporter.flush()
g.add_vertex( vertex_label )
if reporter: reporter.write("\rLoaded %d vertices %s\n" % (num_vertices, " "*10))
num_edges = self.num_edges()
for i, (vertex1, vertex2, edgetype) in enumerate( self.all_edges() ):
if i%5000==0:
reporter.write("\r%d/%d edges"%(i,num_edges) )
reporter.flush()
g.add_edge( vertex1, vertex2, edgetype )
if reporter: reporter.write("\rLoaded %d edges %s\n" % (num_edges, " "*10))
return g
from graphserver.core import Graph, State, Street
gg = Graph()
gg.add_vertex("A")
gg.add_vertex("B")
gg.add_vertex("C")
gg.add_vertex("D")
gg.add_vertex("E")
gg.add_vertex("F")
gg.add_edge( "A", "B", Street("1", 100) )
gg.add_edge( "A", "B", Street("2", 50) )
gg.add_edge( "B", "C", Street("3", 500) )
gg.add_edge( "B", "C", Street("4", 505) )
gg.add_edge( "C", "D", Street("5", 20) )
gg.add_edge( "D", "E", Street("6", 30) )
gg.add_edge( "D", "E", Street("7", 40) )
gg.add_edge( "E", "F", Street("8", 50) )
gg.add_edge( "E", "F", Street("9", 60) )
gg.add_edge( "B", "E", Street("A", 70) )
spt = gg.shortest_path_tree( "A", "C", State(1,0) )
spt.get_vertex("E").best_state.narrate()
from graphserver.core import Graph, State, WalkOptions
from graphserver.graphdb import GraphDatabase
import time, os
os.environ['TZ'] = 'US/Pacific'
time.tzset()
t0s = "Mon Jan 20 08:50:00 2010"
t0t = time.strptime(t0s)
d0s = time.strftime('%a %b %d %Y', t0t)
t0 = time.mktime(t0t)
class TestGraphSerialize(unittest.TestCase):
def setUp(self):
self.out1 = tempfile()
self.out2 = tempfile()
self.g1 = Graph()
self.g2 = Graph()
def tearDown(self):
self.g1.destroy()
self.g2.destroy()
try: os.unlink(self.out1.name)
except: pass
try: os.unlink(self.out2.name)
except: pass
def inout(self):
lgs.gSerialize(self.g1.soul, self.out1.name, self.out2.name)
lgs.gDeserialize(self.g2.soul, self.out1.name, self.out2.name)
def test_errors(self):
self.assertRaises(IOError, self.g1.serialize, "/dev/asdfafsdaf")
self.assertRaises(IOError, self.g1.serialize, "/dev/asdfafsdaf", True)
self.g1.add_vertices(('a','b'))
self.g1.add_edge('a','b', NoOpPyPayload(5))
self.assertRaises(Exception, self.g1.serialize, self.out1.name)
self.g2.add_vertices(('a','b'))
self.g2.add_edge('a','b', Link())
self.g2.serialize("cows")
# bad sig
with open("cows.gbin", 'r+b') as foo:
foo.seek(1)
foo.write("afdasdf")
self.assertRaises(IOError, self.g1.deserialize, "cows")
# bad file
self.assertRaises(IOError, self.g1.deserialize, self.out2.name)
def test_vertices(self):
nv = 10
for i in xrange(10):
self.g1.add_vertex(str(i))
self.inout()
self.assertEquals(self.g2.size, nv);
def test_link_edge(self):
self.g1.add_vertex("A")
self.g1.add_vertex("B")
self.g1.add_edge("A","B", Link())
self.inout()
self.assertEquals(self.g2.size, 2)
print self.g2.vertices
self.assertTrue(self.g2.get_vertex("A") != None)
self.assertEquals(len(self.g2.get_vertex("A").outgoing), 1)
self.assertEquals(len(self.g2.get_vertex("B").outgoing), 0)
self.assertEquals(len(self.g2.get_vertex("B").incoming), 1)
self.assertEquals(self.g2.get_vertex("A").outgoing[0].payload.__class__, Link)
def test_street_edge(self):
self.g1.add_vertex("A")
self.g1.add_vertex("B")
s1_args = ("s1", 2, 2, 2, False)
s2_args = ("s2", 3, 3, 3, True)
self.g1.add_edge("A","B", Street(*s1_args))
self.assertEquals(self.g1.get_vertex("A").outgoing[0].payload.reverse_of_source, False)
self.g1.add_edge("B","A", Street(*s2_args))
self.inout()
self.assertEquals(self.g2.size, 2)
print self.g2.vertices
self.assertTrue(self.g2.get_vertex("A") != None)
self.assertEquals(len(self.g2.get_vertex("A").outgoing), 1)
self.assertEquals(len(self.g2.get_vertex("B").outgoing), 1)
self.assertEquals(len(self.g2.get_vertex("B").incoming), 1)
self.assertEquals(self.g2.get_vertex("A").outgoing[0].payload.__class__, Street)
s1 = self.g2.get_vertex("A").outgoing[0].payload
s2 = self.g2.get_vertex("B").outgoing[0].payload
self.assertEquals(s1.name, "s1")
for e,args in ((s1, s1_args), (s2, s2_args)):
for f,v in zip(("name","length","rise","fall","reverse_of_source"),args):
print f,v, getattr(e,f)
self.assertEquals(getattr(e,f), v)
from graphserver.core import Graph, Street, State
g = Graph()
i = 0
g.add_vertex( str(i) )
while i < 1000000:
for j in range(1000):
i += 1
g.add_vertex( str(i) )
e = g.add_edge(str(i-1), str(i), Street(str(i-1)+"to"+str(i), 1))
print i,"vertices added."
print "Computing shortest path tree from \'0\' to \'",i,"\'"
spt = g.shortest_path_tree("0", str(i), State(1,0))
spt.destroy()
class RouteServer(Servable):
def __init__(self, graphdb_filename, vertex_events, edge_events, vertex_reverse_geocoders):
if os.path.exists("%s.gbin" % graphdb_filename):
self.graph = Graph()
self.graph.deserialize(graphdb_filename, os.path.exists("%s.gmm" % graphdb_filename))
else:
graphdb = GraphDatabase( graphdb_filename )
self.graph = graphdb.incarnate()
self.vertex_events = vertex_events
self.edge_events = edge_events
self.vertex_reverse_geocoders = vertex_reverse_geocoders
def bounds(self, jsoncallback=None):
"""returns bounding box that encompases the bounding box from all member reverse geocoders"""
l, b, r, t = None, None, None, None
for reverse_geocoder in self.vertex_reverse_geocoders:
gl, gb, gr, gt = reverse_geocoder.bounds()
l = min(l,gl) if l else gl
b = min(b,gb) if b else gb
r = max(r,gr) if r else gr
t = max(t,gt) if t else gt
if jsoncallback is None:
return json.dumps([l,b,r,t])
else:
return "%s(%s)"%(jsoncallback,json.dumps([l,b,r,t]))
def vertices(self):
return "\n".join( [vv.label for vv in self.graph.vertices] )
vertices.mime = "text/plain"
def get_vertex_id_raw( self, lat, lon ):
for reverse_geocoder in self.vertex_reverse_geocoders:
ret = reverse_geocoder( lat, lon )
if ret is not None:
return ret
return None
def get_vertex_id( self, lat, lon ):
return json.dumps( self.get_vertex_id_raw( lat, lon ) )
def path(self,
origin,
dest,
currtime=None,
time_offset=None,
transfer_penalty=0,
walking_speed=1.0,
hill_reluctance=1.5,
turn_penalty=None,
walking_reluctance=None,
max_walk=None,
jsoncallback=None):
performance = {}
if currtime is None:
currtime = int(time.time())
if time_offset is not None:
currtime += time_offset
# time path query
t0 = time.time()
wo = WalkOptions()
wo.transfer_penalty=transfer_penalty
wo.walking_speed=walking_speed
wo.hill_reluctance=hill_reluctance
if turn_penalty is not None:
wo.turn_penalty = turn_penalty
if walking_reluctance is not None:
wo.walking_reluctance = walking_reluctance
if max_walk is not None:
wo.max_walk = max_walk
spt = self.graph.shortest_path_tree( origin, dest, State(1,currtime), wo, maxtime=4000000000, hoplimit=2000000, weightlimit=4000000000 )
try:
vertices, edges = spt.path( dest )
except Exception, e:
return json.dumps( {'error':str(e)} )
performance['path_query_time'] = time.time()-t0
t0 = time.time()
narrative = list(postprocess_path(vertices, edges, self.vertex_events, self.edge_events))
performance['narrative_postprocess_time'] = time.time()-t0
t0 = time.time()
wo.destroy()
spt.destroy()
performance['cleanup_time'] = time.time()-t0
ret = {'narrative':narrative, 'performance':performance}
if jsoncallback is None:
return json.dumps(ret, indent=2, cls=SelfEncoderHelper)
else:
return "%s(%s)"%(jsoncallback,json.dumps(ret, indent=2, cls=SelfEncoderHelper))
def test_get_route(self):
"Check it finds the route we expect"
g = Graph()
reader = csv.reader(open("../performance_test/map.csv"))
for wayid, fromv, tov, length in reader:
g.add_vertex(fromv)
g.add_vertex(tov)
g.add_edge(fromv, tov, Street(wayid, float(length)))
v85thStreet = "53184534"
vBeaconAve = "53072051"
idealVertices = [
'53184534', '53193013', '69374666', '53193014', '69474340',
'53185600', '53077802', '69474361', '53090673', '53193015',
'53193016', '53193017', '53193018', '53189027', '53193019',
'53193020', '53112767', '53193021', '69516594', '53132048',
'69516588', '53095152', '53132049', '53239899', '53147269',
'53138815', '69516553', '53138764', '53194375', '53185509',
'53194376', '53144840', '53178633', '53178635', '53194364',
'53125622', '53045160', '53194365', '53194366', '53194367',
'53194368', '53185796', '53194369', '53086028', '90251330',
'90251121', '30789993', '30789998', '31394282', '31393878',
'29977892', '124205994', '31428350', '29545469', '94008501',
'29545421', '29545417', '29545423', '29484769', '29484785',
'29545373', '29979589', '30078988', '30079048', '244420183',
'29979596', '29979598', '30230262', '30230264', '30279409',
'30279408', '30230266', '30230273', '30230277', '30230281',
'30230300', '30230506', '30231231', '30230962', '60878121',
'53224639', '53210038', '53081902', '53052413', '53210039',
'53224626', '53168444', '53224629', '53224632', '53208783',
'53083017', '53083040', '53208784', '53187334', '53187337',
'53089335', '53066732', '53208785', '53178012', '53208786',
'53152490', '53183929', '53146692', '53146065', '53083086',
'53083102', '53113957', '53113944', '53190685', '53203056',
'53167007', '53129046', '53098715', '53208787', '53208788',
'53180738', '53072051'
]
idealEdges = [
'9112003-8', '6438432-0', '6438432-1', '6438432-2', '6438432-3',
'6438432-4', '6438432-5', '6438432-6', '6438432-7', '6438432-8',
'6438432-9', '6438432-10', '6438432-11', '6438432-12',
'6438432-13', '6438432-14', '6438432-15', '6438432-16',
'6438432-17', '6386686-0', '6386686-1', '6386686-2', '6497278-2',
'6497278-3', '6497278-4', '6497278-5', '6497278-6', '6514850-51',
'6439614-0', '6439614-1', '6439614-2', '6439614-3', '15255537-1',
'6439607-0', '6439607-1', '6439607-2', '6439607-3', '6439607-4',
'6439607-5', '6439607-6', '6439607-7', '6439607-8', '6439607-9',
'6439607-10', '10497741-3', '10497743-3', '4709507-4', '4709507-5',
'4709507-6', '4709507-7', '4709507-8', '4869151-0', '4869146-0',
'4869146-1', '4869146-2', '4869146-3', '4869146-4', '4644156-0',
'4722460-0', '4722460-1', '4722460-2', '4722460-3', '4722460-4',
'4722460-5', '4722460-6', '14017470-0', '14017470-1', '5130429-0',
'13866257-0', '13866256-0', '4748963-0', '4748962-0', '4748962-1',
'15257844-0', '15257848-0', '15257848-1', '4743936-0', '4743934-0',
'4743897-3', '4743897-4', '8116116-0', '6457969-20', '6457969-21',
'6457969-22', '6476943-0', '6476943-1', '6476943-2', '6476943-3',
'6476943-4', '6456455-20', '6456455-21', '6456455-22',
'6456455-23', '6456455-24', '6456455-25', '6456455-26',
'6456455-27', '6456455-28', '6456455-29', '6456455-30',
'6456455-31', '6456455-32', '6456455-33', '6456455-34',
'6456455-35', '6456455-36', '6456455-37', '6456455-38',
'6456455-39', '6456455-40', '6456455-41', '6456455-42',
'6456455-43', '6456455-44', '6456455-45', '6456455-46'
]
t0 = time.time()
spt = g.shortest_path_tree(v85thStreet, vBeaconAve,
State(g.numagencies, 0), WalkOptions())
t1 = time.time()
print "time:", (t1 - t0) * 1000
vertices, edges = spt.path(vBeaconAve)
assert spt.get_vertex("53072051").payload.time == 31439
assert spt.get_vertex("53072051").payload.weight == 17311963
assert spt.get_vertex("53072051").payload.dist_walked == 26774.100248
assert (False not in [
l == r for l, r in zip([v.label for v in vertices], idealVertices)
])
assert (False not in [
l == r for l, r in zip([e.payload.name for e in edges], idealEdges)
])
vBallardAve = "53115442"
vLakeCityWay = "124175598"
idealVertices = [
'53115442', '53115445', '53115446', '53227448', '53158020',
'53105937', '53148458', '53077817', '53077819', '53077821',
'53077823', '53077825', '60413953', '53097655', '60413955',
'53196479', '53248412', '53245437', '53153886', '53181632',
'53246786', '53078069', '53247761', '53129527', '53203543',
'53248413', '53182343', '53156127', '53227471', '53240242',
'53109739', '53248420', '53234775', '53170822', '53115167',
'53209384', '53134650', '53142180', '53087702', '53184534',
'53193013', '69374666', '53193014', '69474340', '53185600',
'53077802', '69474361', '53090673', '53193015', '53193016',
'53193017', '53193018', '53189027', '53193019', '53193020',
'53112767', '53193021', '53183554', '53213063', '53197105',
'53213061', '53090659', '53213059', '53157290', '53062869',
'53213057', '53213055', '53213054', '53184527', '67507140',
'67507145', '67507034', '67507151', '67507040', '67507158',
'67507048', '67507166', '67507051', '67507176', '67507057',
'67507126', '53233319', '53147253', '53233320', '53233321',
'60002786', '60002787', '88468933', '53125662', '53195800',
'88486410', '53228492', '88486425', '53215121', '88486457',
'53199820', '53185765', '53233322', '53227223', '88486676',
'53086030', '53086045', '53204778', '88486720', '53204762',
'88486429', '53139133', '53139142', '88486453', '53072465',
'30790081', '30790104', '53072467', '124181376', '30759113',
'53072469', '53072472', '53072473', '53072475', '53072476',
'53072477', '53072478', '124175598'
]
idealEdges = [
'6372784-0', '6372784-1', '6480699-3', '6517019-4', '6517019-5',
'6517019-6', '6517019-7', '6346366-0', '6346366-1', '6346366-2',
'6346366-3', '10425981-2', '8072147-2', '8072147-3', '6441828-10',
'22758990-0', '6511156-0', '6511156-1', '6511156-2', '6511156-3',
'6511156-4', '6511156-5', '6511156-6', '6511156-7', '6511156-8',
'6511156-9', '6511156-10', '6511156-11', '6511156-12',
'6511156-13', '6511156-14', '9112003-0', '9112003-1', '9112003-2',
'9112003-3', '9112003-4', '9112003-5', '9112003-6', '9112003-7',
'9112003-8', '6438432-0', '6438432-1', '6438432-2', '6438432-3',
'6438432-4', '6438432-5', '6438432-6', '6438432-7', '6438432-8',
'6438432-9', '6438432-10', '6438432-11', '6438432-12',
'6438432-13', '6438432-14', '6438432-15', '10425996-0',
'10425996-1', '10425996-2', '10425996-3', '10425996-4',
'10425996-5', '10425996-6', '10425996-7', '10425996-8',
'10425996-9', '10425996-10', '10425996-11', '10425996-12',
'9116336-2', '9116336-3', '9116346-1', '9116346-2', '9116346-3',
'9116346-4', '9116346-5', '9116346-6', '9116346-7', '9116346-8',
'9116346-9', '6488959-1', '6488959-2', '6488959-3', '6488959-4',
'6488959-5', '6488959-6', '6488959-7', '6488959-8', '6488959-9',
'6488959-10', '6488959-11', '6488959-12', '6488959-13',
'6488959-14', '6488959-15', '6488959-16', '6488959-17',
'6488959-18', '6488959-19', '6488959-20', '6488959-21',
'6488959-22', '6488959-23', '6488959-24', '6488959-25',
'6488959-26', '6488959-27', '6488959-28', '6488959-29',
'6344932-0', '6344932-1', '6344932-2', '13514591-0', '13514602-0',
'13514602-1', '13514602-2', '8591344-0', '8591344-1', '8591344-2',
'8591344-3', '8591344-4', '8591344-5'
]
t0 = time.time()
spt = g.shortest_path_tree(vBallardAve, vLakeCityWay,
State(g.numagencies, 0), WalkOptions())
t1 = time.time()
print "time: ", (t1 - t0) * 1000
vertices, edges = spt.path(vLakeCityWay)
assert spt.get_vertex("124175598").payload.time == 13684
assert spt.get_vertex("124175598").payload.weight == 190321
assert (False not in [
l == r for l, r in zip([v.label for v in vertices], idealVertices)
])
assert (False not in [
l == r for l, r in zip([e.payload.name for e in edges], idealEdges)
])
#one last time
vSandPointWay = "32096172"
vAirportWay = "60147448"
idealVertices = [
'32096172', '60411560', '32096173', '32096176', '53110403',
'32096177', '32096180', '53208261', '32096181', '60411559',
'32096184', '53164136', '32096185', '32096190', '32096191',
'32096194', '53123806', '32096196', '32096204', '53199337',
'32096205', '32096208', '60411513', '32096209', '53040444',
'32096212', '60411512', '53208255', '32096216', '53079385',
'53079384', '32096219', '31192107', '31430499', '59948312',
'31430457', '31430658', '29973173', '31430639', '29977895',
'30012801', '31430516', '30012733', '29464742', '32271244',
'31430321', '29464754', '31430318', '29973106', '31429815',
'29464758', '31429758', '32103448', '60701659', '29464594',
'29463661', '59677238', '59677231', '29463657', '29463479',
'29449421', '29449412', '29545007', '29545373', '29979589',
'30078988', '30079048', '244420183', '29979596', '29979598',
'30230262', '30230264', '30279409', '30279408', '30230266',
'30230273', '30230277', '30230281', '30230300', '30230506',
'30231566', '30231379', '30230524', '30887745', '30887637',
'30887631', '30887106', '60147424', '53131178', '53128410',
'53131179', '53027159', '60147448'
]
idealEdges = [
'4910430-0', '4910430-1', '4910417-0', '4910416-0', '4910416-1',
'4910414-0', '4910413-0', '4910413-1', '4910412-0', '4910412-1',
'4910410-0', '4910410-1', '4910408-0', '4910405-0', '4910405-1',
'4910405-2', '4910405-3', '4910402-0', '4910399-0', '4910399-1',
'4910397-0', '4910394-0', '4910394-1', '4910392-0', '4910392-1',
'4910385-0', '4910385-1', '4910385-2', '4910385-3', '4910385-4',
'4910385-5', '4910384-0', '4910384-1', '4869358-0', '4869358-1',
'4869358-2', '4869358-3', '4869357-0', '4869357-1', '4869357-2',
'4869357-3', '4869357-4', '4869357-5', '4636137-0', '4636137-1',
'4636137-2', '4636137-3', '4636137-4', '4636137-5', '4636137-6',
'4708973-0', '4708973-1', '4708973-2', '4708973-3', '4636201-0',
'4708972-0', '4708972-1', '4708972-2', '4636105-0', '4636093-0',
'4729956-0', '4644053-0', '4644064-0', '4722460-2', '4722460-3',
'4722460-4', '4722460-5', '4722460-6', '14017470-0', '14017470-1',
'5130429-0', '13866257-0', '13866256-0', '4748963-0', '4748962-0',
'4748962-1', '15257844-0', '15257848-0', '15257848-1',
'15257848-2', '15257848-3', '15257848-4', '4810339-0', '4810342-0',
'4810342-1', '4810337-0', '4810290-0', '8044406-0', '15240328-7',
'15240328-8', '15240328-9', '15240328-10'
]
spt = g.shortest_path_tree(vSandPointWay, vAirportWay,
State(g.numagencies, 0), WalkOptions())
vertices, edges = spt.path(vAirportWay)
assert spt.get_vertex("60147448").payload.time == 21082
print spt.get_vertex("60147448").payload.weight
assert spt.get_vertex("60147448").payload.weight == 4079909
assert (False not in [
l == r for l, r in zip([v.label for v in vertices], idealVertices)
])
assert (False not in [
l == r for l, r in zip([e.payload.name for e in edges], idealEdges)
])
def test_ch(self):
g = Graph()
g.add_vertex("A")
g.add_vertex("B")
g.add_vertex("C")
g.add_edge("A", "B", Street("foo", 10))
g.add_edge("B", "C", Street("bar", 10))
g.add_edge("C", "A", Street("baz", 10))
wo = WalkOptions()
ch = g.get_contraction_hierarchies(wo)
gdb_file = os.path.dirname(__file__) + "unit_test.db"
gdb = GraphDatabase(gdb_file)
gdb.populate(ch.upgraph)
laz = gdb.incarnate()
combo = laz.edges[1]
self.assertEqual(combo.payload.get(0).name, "baz")
self.assertEqual(combo.payload.get(1).name, "foo")
os.remove(gdb_file)
def test_get_route_retro(self):
"Check it finds the route we expect, in reverse"
g = Graph()
reader = csv.reader(open("../performance_test/map.csv"))
for wayid, fromv, tov, length in reader:
g.add_vertex(fromv)
g.add_vertex(tov)
g.add_edge(fromv, tov, Street(wayid, float(length)))
v85thStreet = "53184534"
vBeaconAve = "53072051"
idealVertices = [
'53184534', '53193013', '69374666', '53193014', '69474340',
'53185600', '53077802', '69474361', '53090673', '53193015',
'53193016', '53193017', '53193018', '53189027', '53193019',
'53193020', '53112767', '53193021', '69516594', '53132048',
'69516588', '53095152', '53132049', '53239899', '53147269',
'53138815', '69516553', '53138764', '53194375', '53185509',
'53194376', '53144840', '53178633', '53178635', '53194364',
'53125622', '53045160', '53194365', '53194366', '53194367',
'53194368', '53185796', '53194369', '53086028', '90251330',
'90251121', '30789993', '30789998', '31394282', '31393878',
'29977892', '124205994', '31428350', '29545469', '29545479',
'29545426', '29545421', '29545417', '29545423', '29484769',
'29484785', '29545373', '29979589', '30078988', '30079048',
'244420183', '29979596', '29979598', '30230262', '30230264',
'30279409', '30279408', '30230266', '30230273', '30230277',
'30230281', '30230300', '30230506', '30231231', '30230962',
'60878121', '53224639', '53210038', '53081902', '53052413',
'53210039', '53224626', '53168444', '53224629', '53224632',
'53208783', '53083017', '53083040', '53208784', '53187334',
'53187337', '53089335', '53066732', '53208785', '53178012',
'53208786', '53152490', '53183929', '53146692', '53146065',
'53083086', '53083102', '53113957', '53113944', '53190685',
'53203056', '53167007', '53129046', '53098715', '53208787',
'53208788', '53180738', '53072051'
]
idealEdges = [
'9112003-8', '6438432-0', '6438432-1', '6438432-2', '6438432-3',
'6438432-4', '6438432-5', '6438432-6', '6438432-7', '6438432-8',
'6438432-9', '6438432-10', '6438432-11', '6438432-12',
'6438432-13', '6438432-14', '6438432-15', '6438432-16',
'6438432-17', '6386686-0', '6386686-1', '6386686-2', '6497278-2',
'6497278-3', '6497278-4', '6497278-5', '6497278-6', '6514850-51',
'6439614-0', '6439614-1', '6439614-2', '6439614-3', '15255537-1',
'6439607-0', '6439607-1', '6439607-2', '6439607-3', '6439607-4',
'6439607-5', '6439607-6', '6439607-7', '6439607-8', '6439607-9',
'6439607-10', '10497741-3', '10497743-3', '4709507-4', '4709507-5',
'4709507-6', '4709507-7', '4709507-8', '4869151-0', '4869146-0',
'4644189-0', '4644192-0', '4644159-0', '4869146-3', '4869146-4',
'4644156-0', '4722460-0', '4722460-1', '4722460-2', '4722460-3',
'4722460-4', '4722460-5', '4722460-6', '14017470-0', '14017470-1',
'5130429-0', '13866257-0', '13866256-0', '4748963-0', '4748962-0',
'4748962-1', '15257844-0', '15257848-0', '15257848-1', '4743936-0',
'4743934-0', '4743897-3', '4743897-4', '8116116-0', '6457969-20',
'6457969-21', '6457969-22', '6476943-0', '6476943-1', '6476943-2',
'6476943-3', '6476943-4', '6456455-20', '6456455-21', '6456455-22',
'6456455-23', '6456455-24', '6456455-25', '6456455-26',
'6456455-27', '6456455-28', '6456455-29', '6456455-30',
'6456455-31', '6456455-32', '6456455-33', '6456455-34',
'6456455-35', '6456455-36', '6456455-37', '6456455-38',
'6456455-39', '6456455-40', '6456455-41', '6456455-42',
'6456455-43', '6456455-44', '6456455-45', '6456455-46'
]
spt = g.shortest_path_tree_retro(v85thStreet, vBeaconAve,
State(g.numagencies, 31505),
WalkOptions())
vertices, edges = spt.path_retro(v85thStreet)
assert spt.get_vertex(v85thStreet).payload.time == 63
assert spt.get_vertex(v85thStreet).payload.weight == 17022003
assert [v.label for v in vertices] == idealVertices
assert [e.payload.name for e in edges] == idealEdges
vBallardAve = "53115442"
vLakeCityWay = "124175598"
idealVertices = [
'53115442', '53115445', '53115446', '53227448', '53158020',
'53105937', '53148458', '53077817', '53077819', '53077821',
'53077823', '53077825', '53077826', '53077828', '53077830',
'53077832', '53077833', '53153886', '53181632', '53246786',
'53078069', '53247761', '53129527', '53203543', '53248413',
'53182343', '53156127', '53227471', '53240242', '53109739',
'53248420', '53234775', '53170822', '53115167', '53209384',
'53134650', '53142180', '53087702', '53184534', '53193013',
'69374666', '53193014', '69474340', '53185600', '53077802',
'69474361', '53090673', '53193015', '53193016', '53193017',
'53193018', '53189027', '53193019', '53193020', '53112767',
'53193021', '53183554', '53213063', '53197105', '53213061',
'53090659', '53213059', '53157290', '53062869', '53213057',
'53213055', '53213054', '53184527', '67507140', '67507145',
'67507034', '67507151', '67507040', '67507158', '53210973',
'53147258', '53210974', '53210975', '60002793', '60002790',
'60002789', '60002786', '60002787', '88468933', '53125662',
'53195800', '88486410', '53228492', '88486425', '53215121',
'88486457', '53199820', '53185765', '53233322', '53227223',
'88486676', '53086030', '53086045', '53204778', '88486720',
'53204762', '88486429', '53139133', '53139142', '88486453',
'53072465', '30790081', '30790104', '53072467', '124181376',
'30759113', '53072469', '53072472', '53072473', '53072475',
'53072476', '53072477', '53072478', '124175598'
]
idealEdges = [
'6372784-0', '6372784-1', '6480699-3', '6517019-4', '6517019-5',
'6517019-6', '6517019-7', '6346366-0', '6346366-1', '6346366-2',
'6346366-3', '6346366-4', '6346366-5', '6346366-6', '6346366-7',
'6346366-8', '10379527-1', '6511156-2', '6511156-3', '6511156-4',
'6511156-5', '6511156-6', '6511156-7', '6511156-8', '6511156-9',
'6511156-10', '6511156-11', '6511156-12', '6511156-13',
'6511156-14', '9112003-0', '9112003-1', '9112003-2', '9112003-3',
'9112003-4', '9112003-5', '9112003-6', '9112003-7', '9112003-8',
'6438432-0', '6438432-1', '6438432-2', '6438432-3', '6438432-4',
'6438432-5', '6438432-6', '6438432-7', '6438432-8', '6438432-9',
'6438432-10', '6438432-11', '6438432-12', '6438432-13',
'6438432-14', '6438432-15', '10425996-0', '10425996-1',
'10425996-2', '10425996-3', '10425996-4', '10425996-5',
'10425996-6', '10425996-7', '10425996-8', '10425996-9',
'10425996-10', '10425996-11', '10425996-12', '9116336-2',
'9116336-3', '9116346-1', '9116346-2', '9116346-3', '6459254-1',
'6459254-2', '6459254-3', '6459254-4', '6459254-5', '4794350-10',
'4794350-11', '4794350-12', '6488959-6', '6488959-7', '6488959-8',
'6488959-9', '6488959-10', '6488959-11', '6488959-12',
'6488959-13', '6488959-14', '6488959-15', '6488959-16',
'6488959-17', '6488959-18', '6488959-19', '6488959-20',
'6488959-21', '6488959-22', '6488959-23', '6488959-24',
'6488959-25', '6488959-26', '6488959-27', '6488959-28',
'6488959-29', '6344932-0', '6344932-1', '6344932-2', '13514591-0',
'13514602-0', '13514602-1', '13514602-2', '8591344-0', '8591344-1',
'8591344-2', '8591344-3', '8591344-4', '8591344-5'
]
spt = g.shortest_path_tree_retro(vBallardAve, vLakeCityWay,
State(g.numagencies, 13684))
vertices, edges = spt.path_retro(vBallardAve)
assert spt.get_vertex(vBallardAve).payload.time == -8
assert spt.get_vertex(vBallardAve).payload.weight == 196300
assert [v.label for v in vertices] == idealVertices
assert [e.payload.name for e in edges] == idealEdges
def test_hello_world(self):
g = Graph()
g.add_vertex( "Seattle" )
g.add_vertex( "Portland" )
g.add_edge( "Seattle", "Portland", Street("I-5 south", 5000) )
g.add_edge( "Portland", "Seattle", Street("I-5 north", 5500) )
spt = g.shortest_path_tree( "Seattle", "Portland", State(g.numagencies,0), WalkOptions() )
assert spt.get_vertex("Seattle").outgoing[0].payload.name == "I-5 south"
g.add_vertex( "Portland-busstop" )
g.add_vertex( "Seattle-busstop" )
g.add_edge( "Seattle", "Seattle-busstop", Link() )
g.add_edge( "Seattle-busstop", "Seattle", Link() )
g.add_edge( "Portland", "Portland-busstop", Link() )
g.add_edge( "Portland-busstop", "Portland", Link() )
spt = g.shortest_path_tree( "Seattle", "Seattle-busstop", State(g.numagencies,0), WalkOptions() )
assert spt.get_vertex("Seattle-busstop").incoming[0].payload.__class__ == Link
spt.destroy()
spt = g.shortest_path_tree( "Seattle-busstop", "Portland", State(g.numagencies,0), WalkOptions() )
assert spt.get_vertex("Portland").incoming[0].payload.__class__ == Street
spt.destroy()
sc = ServiceCalendar()
sc.add_period( 0, 86400, ["WKDY","SAT"] )
tz = Timezone()
tz.add_period( TimezonePeriod( 0, 86400, 0 ) )
g.add_vertex( "Portland-busstop-onbus" )
g.add_vertex( "Seattle-busstop-onbus" )
tb = TripBoard("WKDY", sc, tz, 0)
tb.add_boarding( "A", 10, 0 )
tb.add_boarding( "B", 15, 0 )
tb.add_boarding( "C", 400, 0 )
cr = Crossing()
al = TripAlight("WKDY", sc, tz, 0)
al.add_alighting( "A", 10+20, 0 )
al.add_alighting( "B", 15+20, 0 )
al.add_alighting( "C", 400+20, 0 )
g.add_edge( "Seattle-busstop", "Seattle-busstop-onbus", tb )
g.add_edge( "Seattle-busstop-onbus", "Portland-busstop-onbus", cr )
g.add_edge( "Portland-busstop-onbus", "Portland-busstop", al )
spt = g.shortest_path_tree( "Seattle", "Portland", State(g.numagencies,0), WalkOptions() )
assert spt.get_vertex( "Portland" ).incoming[0].from_v.incoming[0].from_v.incoming[0].from_v.incoming[0].from_v.incoming[0].from_v.label == "Seattle"
spt = g.shortest_path_tree( "Seattle", "Portland", State(g.numagencies,0), WalkOptions() )
vertices, edges = spt.path( "Portland" )
assert [v.label for v in vertices] == ['Seattle', 'Seattle-busstop', "Seattle-busstop-onbus", "Portland-busstop-onbus", 'Portland-busstop', 'Portland']
assert [e.payload.__class__ for e in edges] == [Link, TripBoard, Crossing, TripAlight, Link]
spt.destroy()
g.destroy()
def setUp(self):
self.out1 = tempfile()
self.out2 = tempfile()
self.g1 = Graph()
self.g2 = Graph()
time.tzset()
t0s = "Mon Jan 20 08:50:00 2010"
t0t = time.strptime(t0s)
d0s = time.strftime('%a %b %d %Y', t0t)
t0 = time.mktime(t0t)
print 'search date: ', d0s
print 'search time: ', time.ctime(t0), t0
wo = WalkOptions()
wo.max_walk = 1600
wo.walking_overage = 0.1
wo.walking_speed = 0.8 # trimet uses 0.03 miles / 1 minute
wo.transfer_penalty = 600
wo.walking_reluctance = 2
g = Graph()
# intersections in a grid
for r in range(10):
for c in range(10):
g.add_vertex( "%d-%d" % (r, c) )
# streets connecting intersections in a grid
for r in range(9):
for c in range(9):
g.add_edge( "%d-%d" % (r, c), "%d-%d" % (r, c+1), Street("R%dA" % r, 500) )
g.add_edge( "%d-%d" % (r, c), "%d-%d" % (r+1, c), Street("C%dA" % c, 400) )
g.add_edge( "%d-%d" % (r, c+1), "%d-%d" % (r, c), Street("R%dB" % r, 500) )
g.add_edge( "%d-%d" % (r+1, c), "%d-%d" % (r, c), Street("C%dB" % c, 400) )
# a train station at one extremity of the grid
def test_hello_world(self):
g = Graph()
g.add_vertex("Seattle")
g.add_vertex("Portland")
g.add_edge("Seattle", "Portland", Street("I-5 south", 5000))
g.add_edge("Portland", "Seattle", Street("I-5 north", 5500))
spt = g.shortest_path_tree("Seattle", "Portland",
State(g.numagencies, 0), WalkOptions())
assert spt.get_vertex(
"Seattle").outgoing[0].payload.name == "I-5 south"
g.add_vertex("Portland-busstop")
g.add_vertex("Seattle-busstop")
g.add_edge("Seattle", "Seattle-busstop", Link())
g.add_edge("Seattle-busstop", "Seattle", Link())
g.add_edge("Portland", "Portland-busstop", Link())
g.add_edge("Portland-busstop", "Portland", Link())
spt = g.shortest_path_tree("Seattle", "Seattle-busstop",
State(g.numagencies, 0), WalkOptions())
assert spt.get_vertex(
"Seattle-busstop").incoming[0].payload.__class__ == Link
spt.destroy()
spt = g.shortest_path_tree("Seattle-busstop", "Portland",
State(g.numagencies, 0), WalkOptions())
assert spt.get_vertex(
"Portland").incoming[0].payload.__class__ == Street
spt.destroy()
sc = ServiceCalendar()
sc.add_period(0, 86400, ["WKDY", "SAT"])
tz = Timezone()
tz.add_period(TimezonePeriod(0, 86400, 0))
g.add_vertex("Portland-busstop-onbus")
g.add_vertex("Seattle-busstop-onbus")
tb = TripBoard("WKDY", sc, tz, 0)
tb.add_boarding("A", 10, 0)
tb.add_boarding("B", 15, 0)
tb.add_boarding("C", 400, 0)
cr = Crossing()
al = TripAlight("WKDY", sc, tz, 0)
al.add_alighting("A", 10 + 20, 0)
al.add_alighting("B", 15 + 20, 0)
al.add_alighting("C", 400 + 20, 0)
g.add_edge("Seattle-busstop", "Seattle-busstop-onbus", tb)
g.add_edge("Seattle-busstop-onbus", "Portland-busstop-onbus", cr)
g.add_edge("Portland-busstop-onbus", "Portland-busstop", al)
spt = g.shortest_path_tree("Seattle", "Portland",
State(g.numagencies, 0), WalkOptions())
assert spt.get_vertex("Portland").incoming[0].from_v.incoming[
0].from_v.incoming[0].from_v.incoming[0].from_v.incoming[
0].from_v.label == "Seattle"
spt = g.shortest_path_tree("Seattle", "Portland",
State(g.numagencies, 0), WalkOptions())
vertices, edges = spt.path("Portland")
assert [v.label for v in vertices] == [
'Seattle', 'Seattle-busstop', "Seattle-busstop-onbus",
"Portland-busstop-onbus", 'Portland-busstop', 'Portland'
]
assert [e.payload.__class__ for e in edges
] == [Link, TripBoard, Crossing, TripAlight, Link]
spt.destroy()
g.destroy()
def FindDisjunctGraphs (dbname):
db = OSMDB(dbname)
#should really be done before simplifying and splitting
#fuse_nodes(db)
c = db.cursor()
c.execute("DROP table if exists graph_nodes")
c.execute("DROP table if exists graph_edges")
c.execute("CREATE table graph_nodes (graph_num INTEGER, node_id TEXT, WKT_GEOMETRY TEXT)")
c.execute("CREATE table graph_edges (graph_num INTEGER, edge_id TEXT, WKT_GEOMETRY TEXT)")
c.execute("CREATE index graph_nodes_id_indx ON graph_nodes(node_id)")
c.execute("CREATE index graph_edges_id_indx ON graph_edges(edge_id)")
c.close()
g = Graph()
t0 = time.time()
vertices = {}
print "load vertices into memory"
for row in db.execute("SELECT DISTINCT start_nd from edges"):
g.add_vertex(str(row[0]))
vertices[str(row[0])] = 0
#print str(row[0])
for row in db.execute("SELECT DISTINCT end_nd from edges"):
g.add_vertex(str(row[0]))
vertices[str(row[0])] = 0
#k = vertices.keys()
#k.sort()
#print k, len(k)
print "load edges into memory"
for start_nd, end_nd in db.execute("SELECT start_nd, end_nd from edges"):
g.add_edge(start_nd, end_nd, Link())
g.add_edge(end_nd, start_nd, Link())
#print start_nd, end_nd
db.conn.commit()
t1 = time.time()
print "populating graph took: %f"%(t1-t0)
t0 = t1
print len(vertices)
iteration = 1
c = db.cursor()
while True:
#c.execute("SELECT id from nodes where id not in (SELECT node_id from graph_nodes) LIMIT 1")
try:
vertex, dummy = vertices.popitem()
#print vertex
except:
break
spt = g.shortest_path_tree(vertex, None, State(1,0))
print spt.size
for v in spt.vertices:
lat, lon = c.execute("SELECT lat, lon from nodes where id=?", (v.label, )).next()
c.execute("INSERT into graph_nodes VALUES (?, ?, ?)", (iteration, v.label, "POINT(%f %f)" % (lon, lat)))
for e in v.outgoing: # this gives a wierd maze graph, should do for all edges outside loop.
lat1, lon1 = c.execute("SELECT lat, lon from nodes where id=?", (e.from_v.label, )).next()
lat2, lon2 = c.execute("SELECT lat, lon from nodes where id=?", (e.to_v.label, )).next()
c.execute("INSERT into graph_edges VALUES (?, ?, ?)",
(iteration, e.from_v.label + '->' + e.to_v.label, "LINESTRING(%f %f, %f %f)" % (lon1, lat1, lon2, lat2)))
#print v.label
vertices.pop(v.label, None)
g.remove_vertex(v.label, True, True)
#print v.label
spt.destroy()
t1 = time.time()
print "pass %s took: %f nvertices %d"%(iteration, t1-t0, len(vertices))
t0 = t1
iteration += 1
c.close()
db.conn.commit()
g.destroy()
# audit
for gnum, count in db.execute("SELECT graph_num, count(*) FROM graph_nodes GROUP BY graph_num"):
print "FOUND: %s=%s" % (gnum, count)
def test_get_route(self):
"Check it finds the route we expect"
g = Graph()
reader = csv.reader(open("../performance_test/map.csv"))
for wayid, fromv, tov, length in reader:
g.add_vertex( fromv )
g.add_vertex( tov )
g.add_edge( fromv, tov, Street( wayid, float(length) ) )
v85thStreet = "53184534"
vBeaconAve = "53072051"
idealVertices = ['53184534', '53193013', '69374666', '53193014', '69474340', '53185600', '53077802', '69474361', '53090673', '53193015', '53193016', '53193017', '53193018', '53189027', '53193019', '53193020', '53112767', '53193021', '69516594', '53132048', '69516588', '53095152', '53132049', '53239899', '53147269', '53138815', '69516553', '53138764', '53194375', '53185509', '53194376', '53144840', '53178633', '53178635', '53194364', '53125622', '53045160', '53194365', '53194366', '53194367', '53194368', '53185796', '53194369', '53086028', '90251330', '90251121', '30789993', '30789998', '31394282', '31393878', '29977892', '124205994', '31428350', '29545469', '94008501', '29545421', '29545417', '29545423', '29484769', '29484785', '29545373', '29979589', '30078988', '30079048', '244420183', '29979596', '29979598', '30230262', '30230264', '30279409', '30279408', '30230266', '30230273', '30230277', '30230281', '30230300', '30230506', '30231231', '30230962', '60878121', '53224639', '53210038', '53081902', '53052413', '53210039', '53224626', '53168444', '53224629', '53224632', '53208783', '53083017', '53083040', '53208784', '53187334', '53187337', '53089335', '53066732', '53208785', '53178012', '53208786', '53152490', '53183929', '53146692', '53146065', '53083086', '53083102', '53113957', '53113944', '53190685', '53203056', '53167007', '53129046', '53098715', '53208787', '53208788', '53180738', '53072051']
idealEdges = ['9112003-8', '6438432-0', '6438432-1', '6438432-2', '6438432-3', '6438432-4', '6438432-5', '6438432-6', '6438432-7', '6438432-8', '6438432-9', '6438432-10', '6438432-11', '6438432-12', '6438432-13', '6438432-14', '6438432-15', '6438432-16', '6438432-17', '6386686-0', '6386686-1', '6386686-2', '6497278-2', '6497278-3', '6497278-4', '6497278-5', '6497278-6', '6514850-51', '6439614-0', '6439614-1', '6439614-2', '6439614-3', '15255537-1', '6439607-0', '6439607-1', '6439607-2', '6439607-3', '6439607-4', '6439607-5', '6439607-6', '6439607-7', '6439607-8', '6439607-9', '6439607-10', '10497741-3', '10497743-3', '4709507-4', '4709507-5', '4709507-6', '4709507-7', '4709507-8', '4869151-0', '4869146-0', '4869146-1', '4869146-2', '4869146-3', '4869146-4', '4644156-0', '4722460-0', '4722460-1', '4722460-2', '4722460-3', '4722460-4', '4722460-5', '4722460-6', '14017470-0', '14017470-1', '5130429-0', '13866257-0', '13866256-0', '4748963-0', '4748962-0', '4748962-1', '15257844-0', '15257848-0', '15257848-1', '4743936-0', '4743934-0', '4743897-3', '4743897-4', '8116116-0', '6457969-20', '6457969-21', '6457969-22', '6476943-0', '6476943-1', '6476943-2', '6476943-3', '6476943-4', '6456455-20', '6456455-21', '6456455-22', '6456455-23', '6456455-24', '6456455-25', '6456455-26', '6456455-27', '6456455-28', '6456455-29', '6456455-30', '6456455-31', '6456455-32', '6456455-33', '6456455-34', '6456455-35', '6456455-36', '6456455-37', '6456455-38', '6456455-39', '6456455-40', '6456455-41', '6456455-42', '6456455-43', '6456455-44', '6456455-45', '6456455-46']
t0 = time.time()
spt = g.shortest_path_tree( v85thStreet, vBeaconAve, State(g.numagencies,0), WalkOptions() )
t1 = time.time()
print "time:", (t1-t0)*1000
vertices, edges = spt.path( vBeaconAve )
assert spt.get_vertex("53072051").payload.time == 31439
assert spt.get_vertex("53072051").payload.weight == 17311963
assert spt.get_vertex("53072051").payload.dist_walked == 26774.100248
assert( False not in [l==r for l,r in zip( [v.label for v in vertices], idealVertices )] )
assert( False not in [l==r for l,r in zip( [e.payload.name for e in edges], idealEdges )] )
vBallardAve = "53115442"
vLakeCityWay = "124175598"
idealVertices = ['53115442', '53115445', '53115446', '53227448', '53158020', '53105937', '53148458', '53077817', '53077819', '53077821', '53077823', '53077825', '60413953', '53097655', '60413955', '53196479', '53248412', '53245437', '53153886', '53181632', '53246786', '53078069', '53247761', '53129527', '53203543', '53248413', '53182343', '53156127', '53227471', '53240242', '53109739', '53248420', '53234775', '53170822', '53115167', '53209384', '53134650', '53142180', '53087702', '53184534', '53193013', '69374666', '53193014', '69474340', '53185600', '53077802', '69474361', '53090673', '53193015', '53193016', '53193017', '53193018', '53189027', '53193019', '53193020', '53112767', '53193021', '53183554', '53213063', '53197105', '53213061', '53090659', '53213059', '53157290', '53062869', '53213057', '53213055', '53213054', '53184527', '67507140', '67507145', '67507034', '67507151', '67507040', '67507158', '67507048', '67507166', '67507051', '67507176', '67507057', '67507126', '53233319', '53147253', '53233320', '53233321', '60002786', '60002787', '88468933', '53125662', '53195800', '88486410', '53228492', '88486425', '53215121', '88486457', '53199820', '53185765', '53233322', '53227223', '88486676', '53086030', '53086045', '53204778', '88486720', '53204762', '88486429', '53139133', '53139142', '88486453', '53072465', '30790081', '30790104', '53072467', '124181376', '30759113', '53072469', '53072472', '53072473', '53072475', '53072476', '53072477', '53072478', '124175598']
idealEdges = ['6372784-0', '6372784-1', '6480699-3', '6517019-4', '6517019-5', '6517019-6', '6517019-7', '6346366-0', '6346366-1', '6346366-2', '6346366-3', '10425981-2', '8072147-2', '8072147-3', '6441828-10', '22758990-0', '6511156-0', '6511156-1', '6511156-2', '6511156-3', '6511156-4', '6511156-5', '6511156-6', '6511156-7', '6511156-8', '6511156-9', '6511156-10', '6511156-11', '6511156-12', '6511156-13', '6511156-14', '9112003-0', '9112003-1', '9112003-2', '9112003-3', '9112003-4', '9112003-5', '9112003-6', '9112003-7', '9112003-8', '6438432-0', '6438432-1', '6438432-2', '6438432-3', '6438432-4', '6438432-5', '6438432-6', '6438432-7', '6438432-8', '6438432-9', '6438432-10', '6438432-11', '6438432-12', '6438432-13', '6438432-14', '6438432-15', '10425996-0', '10425996-1', '10425996-2', '10425996-3', '10425996-4', '10425996-5', '10425996-6', '10425996-7', '10425996-8', '10425996-9', '10425996-10', '10425996-11', '10425996-12', '9116336-2', '9116336-3', '9116346-1', '9116346-2', '9116346-3', '9116346-4', '9116346-5', '9116346-6', '9116346-7', '9116346-8', '9116346-9', '6488959-1', '6488959-2', '6488959-3', '6488959-4', '6488959-5', '6488959-6', '6488959-7', '6488959-8', '6488959-9', '6488959-10', '6488959-11', '6488959-12', '6488959-13', '6488959-14', '6488959-15', '6488959-16', '6488959-17', '6488959-18', '6488959-19', '6488959-20', '6488959-21', '6488959-22', '6488959-23', '6488959-24', '6488959-25', '6488959-26', '6488959-27', '6488959-28', '6488959-29', '6344932-0', '6344932-1', '6344932-2', '13514591-0', '13514602-0', '13514602-1', '13514602-2', '8591344-0', '8591344-1', '8591344-2', '8591344-3', '8591344-4', '8591344-5']
t0 = time.time()
spt = g.shortest_path_tree( vBallardAve, vLakeCityWay, State(g.numagencies,0), WalkOptions() )
t1 = time.time()
print "time: ", (t1-t0)*1000
vertices, edges = spt.path( vLakeCityWay )
assert spt.get_vertex("124175598").payload.time == 13684
assert spt.get_vertex("124175598").payload.weight == 190321
assert( False not in [l==r for l,r in zip( [v.label for v in vertices], idealVertices )] )
assert( False not in [l==r for l,r in zip( [e.payload.name for e in edges], idealEdges )] )
#one last time
vSandPointWay = "32096172"
vAirportWay = "60147448"
idealVertices = ['32096172', '60411560', '32096173', '32096176', '53110403', '32096177', '32096180', '53208261', '32096181', '60411559', '32096184', '53164136', '32096185', '32096190', '32096191', '32096194', '53123806', '32096196', '32096204', '53199337', '32096205', '32096208', '60411513', '32096209', '53040444', '32096212', '60411512', '53208255', '32096216', '53079385', '53079384', '32096219', '31192107', '31430499', '59948312', '31430457', '31430658', '29973173', '31430639', '29977895', '30012801', '31430516', '30012733', '29464742', '32271244', '31430321', '29464754', '31430318', '29973106', '31429815', '29464758', '31429758', '32103448', '60701659', '29464594', '29463661', '59677238', '59677231', '29463657', '29463479', '29449421', '29449412', '29545007', '29545373', '29979589', '30078988', '30079048', '244420183', '29979596', '29979598', '30230262', '30230264', '30279409', '30279408', '30230266', '30230273', '30230277', '30230281', '30230300', '30230506', '30231566', '30231379', '30230524', '30887745', '30887637', '30887631', '30887106', '60147424', '53131178', '53128410', '53131179', '53027159', '60147448']
idealEdges = ['4910430-0', '4910430-1', '4910417-0', '4910416-0', '4910416-1', '4910414-0', '4910413-0', '4910413-1', '4910412-0', '4910412-1', '4910410-0', '4910410-1', '4910408-0', '4910405-0', '4910405-1', '4910405-2', '4910405-3', '4910402-0', '4910399-0', '4910399-1', '4910397-0', '4910394-0', '4910394-1', '4910392-0', '4910392-1', '4910385-0', '4910385-1', '4910385-2', '4910385-3', '4910385-4', '4910385-5', '4910384-0', '4910384-1', '4869358-0', '4869358-1', '4869358-2', '4869358-3', '4869357-0', '4869357-1', '4869357-2', '4869357-3', '4869357-4', '4869357-5', '4636137-0', '4636137-1', '4636137-2', '4636137-3', '4636137-4', '4636137-5', '4636137-6', '4708973-0', '4708973-1', '4708973-2', '4708973-3', '4636201-0', '4708972-0', '4708972-1', '4708972-2', '4636105-0', '4636093-0', '4729956-0', '4644053-0', '4644064-0', '4722460-2', '4722460-3', '4722460-4', '4722460-5', '4722460-6', '14017470-0', '14017470-1', '5130429-0', '13866257-0', '13866256-0', '4748963-0', '4748962-0', '4748962-1', '15257844-0', '15257848-0', '15257848-1', '15257848-2', '15257848-3', '15257848-4', '4810339-0', '4810342-0', '4810342-1', '4810337-0', '4810290-0', '8044406-0', '15240328-7', '15240328-8', '15240328-9', '15240328-10']
spt = g.shortest_path_tree( vSandPointWay, vAirportWay, State(g.numagencies,0), WalkOptions() )
vertices, edges = spt.path( vAirportWay )
assert spt.get_vertex("60147448").payload.time == 21082
print spt.get_vertex("60147448").payload.weight
assert spt.get_vertex("60147448").payload.weight == 4079909
assert( False not in [l==r for l,r in zip( [v.label for v in vertices], idealVertices )] )
assert( False not in [l==r for l,r in zip( [e.payload.name for e in edges], idealEdges )] )