2025-summer/team-3
12
Fork 0
Code Issues Pull requests Projects Releases Activity

remove unneeded code

Browse source
This commit is contained in:
Laura Klünder 2017-11-27 23:41:08 +01:00
parent 1ac5d554f2
commit 89bf924ec3
1 changed files with 1 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

5
src/c3nav/routing/router.py
View file

@ -112,15 +112,12 @@ class Router:
# collect nodes # collect nodes
nodes = tuple(nodes) nodes = tuple(nodes)
nodes_lookup = {node.pk: node.i for node in nodes} nodes_lookup = {node.pk: node.i for node in nodes}
nodes_coords = np.array(tuple((node.x*100, node.y*100) for node in nodes), dtype=np.uint32) # noqa
# todo: remove #noqa when we're ready
# collect edges # collect edges
edges = tuple(RouterEdge(from_node=nodes[nodes_lookup[edge.from_node_id]], edges = tuple(RouterEdge(from_node=nodes[nodes_lookup[edge.from_node_id]],
to_node=nodes[nodes_lookup[edge.to_node_id]], to_node=nodes[nodes_lookup[edge.to_node_id]],
waytype=waytypes_lookup[edge.waytype_id]) for edge in GraphEdge.objects.all()) waytype=waytypes_lookup[edge.waytype_id]) for edge in GraphEdge.objects.all())
edges = {(edge.from_node.i, edge.to_node.i): edge for edge in edges} # noqa edges = {(edge.from_node.i, edge.to_node.i): edge for edge in edges}
# todo: remove #noqa when we're ready
# build graph matrix # build graph matrix
graph = np.full(shape=(len(nodes), len(nodes)), fill_value=np.inf, dtype=np.float32) graph = np.full(shape=(len(nodes), len(nodes)), fill_value=np.inf, dtype=np.float32)