def test_wait(self):
waitend = 100
tz = Timezone()
tz.add_period(TimezonePeriod(0, 100000, 0))
w = Wait(waitend, tz)
assert w.end == waitend
assert w.timezone.soul == tz.soul
assert w.to_xml() == "<Wait end='100' />"
s = State(1, 0)
sprime = w.walk(s, WalkOptions())
assert sprime.time == 100
assert sprime.weight == 100
s = State(1, 150)
sprime = w.walk_back(s, WalkOptions())
assert sprime.time == 100
assert sprime.weight == 50
s = State(1, 86400)
sprime = w.walk(s, WalkOptions())
assert sprime.time == 86500
assert sprime.weight == 100
w.destroy()
tz = Timezone()
tz.add_period(TimezonePeriod(0, 100000, -20))
w = Wait(100, tz)
assert w.end == 100
assert w.timezone.soul == tz.soul
s = State(1, 86400)
sprime = w.walk(s, WalkOptions())
assert sprime.weight == 120
def test_load_sample(self):
g = TestGTFS()
wo = WalkOptions()
g.load_gtfs(find_resource("sample-feed.zip"))
def leads_to(x, y):
vs = [edge.to_v.label for edge in g.get_vertex(x).outgoing]
assert vs == list(y), "%s vs %s" % (vs, list(y))
# check that the graph is layed out like we'd expect
leads_to("gtfsEMSI", ('gtfsDADAN', ))
leads_to("gtfsBEATTY_AIRPORT", ('gtfsAMV', 'gtfsBULLFROG'))
leads_to("gtfsNADAV", ('gtfsDADAN', 'gtfsNANAA'))
leads_to('gtfsBULLFROG', ('gtfsBEATTY_AIRPORT', 'gtfsFUR_CREEK_RES'))
leads_to('gtfsAMV', ('gtfsBEATTY_AIRPORT', ))
leads_to('gtfsNANAA', ('gtfsNADAV', 'gtfsSTAGECOACH'))
leads_to('gtfsDADAN', ('gtfsNADAV', 'gtfsEMSI'))
leads_to('gtfsSTAGECOACH', ('gtfsBEATTY_AIRPORT', 'gtfsNANAA'))
leads_to('gtfsFUR_CREEK_RES', ('gtfsBULLFROG', ))
s = State(1, 1219842000) #6 am august 27, 2008, America/Los_Angeles
# walk one edge
edge_to_airport = g.get_vertex("gtfsSTAGECOACH").outgoing[0]
sprime = edge_to_airport.walk(s, wo)
assert sprime.time == 1219843200
assert sprime.weight == 1200
# find a sample route
spt = g.shortest_path_tree("gtfsSTAGECOACH", None, s)
vertices, edges = spt.path("gtfsBULLFROG")
assert spt.get_vertex(
"gtfsBULLFROG"
).payload.time == 1219849800 #8:10 am wed august 27, 2008, America/Los_Angeles
assert [v.label for v in vertices
] == ['gtfsSTAGECOACH', 'gtfsBEATTY_AIRPORT', 'gtfsBULLFROG']
s = State(1, 1202911200) #6am feb 13, 2008, America/Los_Angeles
edge_to_airport = g.get_vertex("gtfsSTAGECOACH").outgoing[0]
sprime = edge_to_airport.walk(s, wo)
assert sprime.time == 1202912400
assert sprime.weight == 1200
spt = g.shortest_path_tree("gtfsSTAGECOACH", None, s)
vertices, edges = spt.path("gtfsBULLFROG")
assert spt.get_vertex(
"gtfsBULLFROG"
).payload.time == 1202919000 #8:10 am feb 13, 2008, America/Los_Angeles
assert [v.label for v in vertices
] == ['gtfsSTAGECOACH', 'gtfsBEATTY_AIRPORT', 'gtfsBULLFROG']
def test_august(self):
# noon, -7 hours off UTC, as America/Los_Angeles in summer
tz = Timezone.generate("America/Los_Angeles")
w = Wait(43200, tz)
# one calendar, noon august 27, America/Los_Angeles
s = State(1, 1219863600)
assert w.walk(s, WalkOptions()).time == 1219863600
# one calendar, 11:55 AM August 27 2008, America/Los_Angeles
s = State(1, 1219863300)
assert w.walk(s, WalkOptions()).time == 1219863600
assert w.walk(s, WalkOptions()).weight == 300
def _spt(self, lat1, lng1, lat2, lng2):
"""
Calculate the shortest path tree, and return the geometry.
"""
# find origin node on the street network
orig = self.nodedb.nearest_node(lat1, lng1)
dest = self.nodedb.nearest_node(lat2, lng2)
# route!
spt = self.graph.shortest_path_tree('osm-' + orig[0], 'osm-' + dest[0],
State(1, time()), None)
# get the path vertices and edges
pvert, pedges = spt.path('osm-' + dest[0])
orig = None
dest = None
# convert the results to geometries
allgeom = []
for e in pedges:
dbedge = self.nodedb.edge(e.payload.name)
if e.payload.reverse_of_source:
allgeom.extend(reversed(dbedge[5]))
else:
allgeom.extend(dbedge[5])
spt.destroy()
return allgeom
def path_retro(self,
origin,
dest,
currtime=None,
time_offset=None,
transfer_penalty=0,
walking_speed=1.0):
if currtime is None:
currtime = int(time.time())
if time_offset is not None:
currtime += time_offset
wo = WalkOptions()
wo.transfer_penalty = transfer_penalty
wo.walking_speed = walking_speed
spt = self.graph.shortest_path_tree_retro(origin, dest,
State(1, currtime), wo)
wo.destroy()
vertices, edges = spt.path_retro(origin)
ret = list(
postprocess_path(vertices, edges, self.vertex_events,
self.edge_events))
spt.destroy()
return json.dumps(ret, indent=2, cls=SelfEncoderHelper)
def test_bart(self):
wo = WalkOptions()
g = TestGTFS()
g.load_gtfs(find_resource("google_transit.zip"))
# just a basic sanity test
s1 = State(g.numagencies, 1219863720)
s2 = g.get_vertex("gtfsMONT").outgoing[1].walk(s1, wo)
assert s2.time == 1219864320
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)
vertices, edges = spt.path(dest)
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_walk(self):
l = Link()
after = l.walk(State(1, 0), WalkOptions())
assert after.time == 0
assert after.weight == 0
assert after.dist_walked == 0
assert after.prev_edge.type == 3
assert after.prev_edge.name == "LINK"
assert after.num_agencies == 1
def test_walk_back(self):
l = Link()
before = l.walk_back(State(1, 0), WalkOptions())
assert before.time == 0
assert before.weight == 0
assert before.dist_walked == 0.0
assert before.prev_edge.type == 3
assert before.prev_edge.name == "LINK"
assert before.num_agencies == 1
def get_answers(vertex, time):
"""Returns the trip_ids for every outgoing triphopschedule from this vertex at this time. This is the functioon
used to generate the "answers" lists in the test below"""
answersout = []
for i in vertex.outgoing:
th = i.payload.collapse(State(1, time))
if th is None:
answersout.append(None)
else:
answersout.append(th.trip_id)
answersout
def path_raw_retro(self, origin, dest, currtime):
wo = WalkOptions()
spt = self.graph.shortest_path_tree_retro( origin, dest, State(1,currtime), wo )
wo.destroy()
vertices, edges = spt.path_retro( origin )
ret = postprocess_path_raw(vertices, edges)
spt.destroy()
return ret
def path(lat,
lon,
destination,
graph,
walk_options,
reverse_geocode,
current_time=None):
origin = reverse_geocode(lat, lon)
if not origin or not origin.id: # or \
# origin.distance_miles >= 0.5:
return (None, None)
origin_walk_penalty = timedelta(
minutes=(origin.distance_miles / walk_options.walking_speed) * 60)
if current_time is None:
current_time = int(time.time())
start_time = None
stop_time = None
tree = None
try:
tree = graph.shortest_path_tree('osm-%s' % origin.id,
'osm-%s' % destination.id,
State(1, current_time), walk_options)
vertices, edges = tree.path('osm-%s' % destination.id)
start = None
stop = None
for v in vertices:
if v.state.time:
if not start:
start = v.state.time
stop = v.state.time
start_time = datetime.fromtimestamp(start)
stop_time = datetime.fromtimestamp(stop)
start_time -= origin_walk_penalty
finally:
if tree:
tree.destroy()
return (start_time, stop_time)
def path_raw(self, origin, dest, currtime=None):
if currtime is None:
currtime = int(time.time())
wo = WalkOptions()
spt = self.graph.shortest_path_tree( origin, dest, State(1,currtime), wo )
wo.destroy()
vertices, edges = spt.path( dest )
ret = postprocess_path_raw(vertices, edges)
spt.destroy()
return ret
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_bart_dag(self):
g = TestGTFS()
g.load_gtfs_dag(find_resource("google_transit.zip"),
"America/Los_Angeles")
#e = Engine(g)
#e.run_test_server()
#this works
s1 = State(2, 1219863240)
# http://localhost:8080/shortest_path?from_v=%2219TH@42840%22&to_v=%22ASBY@43200%22&time=1219863240
spt = g.shortest_path_tree("19TH@42840", None, s1)
assert spt.get_vertex("ASBY@43200").payload.time == 1219863600
# http://localhost:8080/shortest_path?from_v=%22gtfs19TH%22&to_v=%22gtfsASBY%22&time=1219863240
spt = g.shortest_path_tree("19TH", None, s1)
assert spt.get_vertex("ASBY").payload.time == 1219863600
# http://localhost:8080/shortest_path?from_v=%22gtfsFRMT%22&to_v=%22gtfsMLBR%22&time=1219863240
assert spt.get_vertex("MLBR").payload.time == 1219866720
def test_osmgraph(self):
"""create graph from osm file."""
utmzone10 = Proj(init='epsg:26910')
g = OSMGraph(find_resource("map.osm"), utmzone10)
vert = g.vertices
while True:
random_vertex_label = vert[randint(0, len(vert) - 1)].label
if len(g.get_vertex(random_vertex_label).outgoing) != 0:
break
print "finding a better vertex..."
print "finding shortest path tree for %s" % random_vertex_label
spt = g.shortest_path_tree(random_vertex_label, "!bogus!!@",
State(1, 0))
assert spt
s = StringIO()
g.write_spt(s, spt)
assert len(s.getvalue()) > 0
s.close()
spt.destroy()
g.destroy()
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 )
try:
vertices, edges = spt.path( dest )
except Exception, e:
return json.dumps( {'error':str(e)} )
def main():
if len(argv) < 2:
print "usage: python graphdb.py [vertex1, [vertex2]]"
return
graphdb_filename = argv[1]
graphdb = GraphDatabase( graphdb_filename )
if len(argv) == 2:
print "vertices:"
for vertex_label in sorted( graphdb.all_vertex_labels() ):
print vertex_label
print "resources:"
for name, resource in graphdb.resources():
print name, resource
return
vertex1 = argv[2]
for vertex1, vertex2, edgetype in graphdb.all_outgoing( vertex1 ):
print "%s -> %s\n\t%s"%(vertex1, vertex2, repr(edgetype))
if len(argv) == 4:
s0 = State(1,int(argv[3]))
print "\t"+str(edgetype.walk( s0 ))
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_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 vertex(self,
label,
currtime=None,
hill_reluctance=1.5,
walking_speed=0.85):
currtime = currtime or int(time.time())
ret = []
ret.append("<h1>%s</h1>" % label)
wo = WalkOptions()
ret.append("<h3>walk options</h3>")
ret.append("<li>transfer_penalty: %s</li>" % wo.transfer_penalty)
ret.append("<li>turn_penalty: %s</li>" % wo.turn_penalty)
ret.append("<li>walking_speed: %s</li>" % wo.walking_speed)
ret.append("<li>walking_reluctance: %s</li>" % wo.walking_reluctance)
ret.append("<li>uphill_slowness: %s</li>" % wo.uphill_slowness)
ret.append("<li>downhill_fastness: %s</li>" % wo.downhill_fastness)
ret.append("<li>hill_reluctance: %s</li>" % wo.hill_reluctance)
ret.append("<li>max_walk: %s</li>" % wo.max_walk)
ret.append("<li>walking_overage: %s</li>" % wo.walking_overage)
ret.append("<h3>incoming from:</h3>")
for i, (vertex1, vertex2,
edgetype) in enumerate(self.graphdb.all_incoming(label)):
s1 = State(1, int(currtime))
wo = WalkOptions()
wo.hill_reluctance = hill_reluctance
wo.walking_speed = walking_speed
s0 = edgetype.walk_back(s1, wo)
if s0:
toterm = "<a href=\"/vertex?label="%s"&currtime=%d\">%s@%d</a>" % (
vertex1, s0.time, vertex1, s1.time)
else:
toterm = "<a href=\"/vertex?label="%s"\">%s</a>" % (
vertex1, vertex1)
ret.append(
"%s<br><pre> via %s (<a href=\"/incoming?label="%s"&edgenum=%d\">details</a>)</pre>"
% (toterm, cgi.escape(repr(edgetype)), vertex2, i))
if s0:
ret.append("<pre> %s</pre>" %
cgi.escape(str(s0)))
ret.append("<h3>outgoing to:</h3>")
for i, (vertex1, vertex2,
edgetype) in enumerate(self.graphdb.all_outgoing(label)):
s0 = State(1, int(currtime))
wo = WalkOptions()
wo.hill_reluctance = hill_reluctance
wo.walking_speed = walking_speed
s1 = edgetype.walk(s0, wo)
if s1:
toterm = "<a href=\"/vertex?label="%s"&currtime=%d\">%s@%d</a>" % (
vertex2, s1.time, vertex2, s1.time)
else:
toterm = "<a href=\"/vertex?label="%s"\">%s</a>" % (
vertex2, vertex2)
ret.append(
"%s<br><pre> via %s (<a href=\"/outgoing?label="%s"&edgenum=%d\">details</a>)</pre>"
% (toterm, cgi.escape(repr(edgetype)), vertex1, i))
if s1:
ret.append("<pre> %s</pre>" %
cgi.escape(str(s1)))
wo.destroy()
return "".join(ret)
def main(count):
print 'Loading boston.osmdb'
nodedb = osmdb.OSMDB(DATA_DIR + 'boston.osmdb')
print 'Importing Boston street network...'
gdb = GraphDatabase(DATA_DIR + 'boston.gdb')
graph = gdb.incarnate()
print 'Importing trip network...'
tripdb = osmdb.OSMDB(DATA_DIR + 'trip_data.db')
stime = time()
wo = WalkOptions()
cursor = tripdb.get_cursor()
tripcount = 0
# For each station
for tnode in tripdb.nodes():
lat1 = float(tnode[2])
lng1 = float(tnode[3])
# find origin node on the street network
orig = nodedb.nearest_node(lat1, lng1)
# get all trips departing this station
tedges = cursor.execute("select * from edges where start_nd = ?",
[tnode[0]])
# For each trip
for tedge in tedges:
dnode = tripdb.node(tedge[3])
lat2 = float(dnode[2])
lng2 = float(dnode[3])
if lat2 == lat1 and lng2 == lng1:
# Do not route something that ends where it begins
print 'Begin and end node are the same.'
else:
# find the destination node on the street network
dest = nodedb.nearest_node(lat2, lng2)
# route!
spt = graph.shortest_path_tree('osm-' + orig[0],
'osm-' + dest[0],
State(1, stime), wo)
# get the path vertices and edges
pvert, pedges = spt.path('osm-' + dest[0])
# convert the results to geometries
allgeom = []
for e in pedges:
dbedge = nodedb.edge(e.payload.name)
if e.payload.reverse_of_source:
allgeom.extend(reversed(dbedge[5]))
else:
allgeom.extend(dbedge[5])
print allgeom
tripcount += 1
if tripcount >= count:
break
if tripcount >= count:
break
def path(self,
lat1,
lng1,
lat2,
lng2,
transfer_penalty=0,
walking_speed=1.0,
hill_reluctance=20,
narrative=True,
jsoncallback=None):
t0 = time.time()
origin = "osm-%s" % self.osmdb.nearest_node(lat1, lng1)[0]
dest = "osm-%s" % self.osmdb.nearest_node(lat2, lng2)[0]
endpoint_find_time = time.time() - t0
print origin, dest
t0 = time.time()
wo = WalkOptions()
#wo.transfer_penalty=transfer_penalty
#wo.walking_speed=walking_speed
wo.walking_speed = 4
wo.walking_overage = 0
wo.hill_reluctance = 20
wo.turn_penalty = 15
edgepayloads = self.ch.shortest_path(origin, dest, State(1, 0), wo)
wo.destroy()
route_find_time = time.time() - t0
t0 = time.time()
names = []
geoms = []
profile = Profile()
total_dist = 0
total_elev = 0
if narrative:
names, total_dist = get_full_route_narrative(
self.osmdb, edgepayloads)
for edgepayload in edgepayloads:
geom, profile_seg = self.shortcut_cache.get(
edgepayload.external_id)
#geom = get_ep_geom( self.osmdb, edgepayload )
#profile_seg = get_ep_profile( self.profiledb, edgepayload )
geoms.extend(geom)
profile.add(profile_seg)
route_desc_time = time.time() - t0
ret = json.dumps(
(names, encode_pairs([(lat, lon) for lon, lat in geoms]),
profile.concat(300), {
'route_find_time': route_find_time,
'route_desc_time': route_desc_time,
'endpoint_find_time': endpoint_find_time,
}, {
'total_dist': total_dist,
'total_elev': total_elev
}))
if jsoncallback:
return "%s(%s)" % (jsoncallback, ret)
else:
return ret