diff options
| author | Stefan Hansson <steha708@edu.liu.se> | 2020-12-03 22:56:07 +0100 |
|---|---|---|
| committer | Newbyte <steha708@liu.se> | 2020-12-15 18:23:54 +0100 |
| commit | 4b052bb509b34ff0d6d5bb6d68aacbc469f0f0b0 (patch) | |
| tree | 60bb554c15544e3cab4c7ded15763e548e86f266 | |
| parent | fe0d3bcc28f723e97cfa4105bed83eb8bb85bbe5 (diff) | |
| download | tdde25-4b052bb509b34ff0d6d5bb6d68aacbc469f0f0b0.tar.gz | |
meeep
| -rw-r--r-- | algorithms.py | 3 | ||||
| -rw-r--r-- | store.py | 2 |
2 files changed, 3 insertions, 2 deletions
diff --git a/algorithms.py b/algorithms.py index 9d4f538..21d5348 100644 --- a/algorithms.py +++ b/algorithms.py @@ -89,6 +89,9 @@ def get_closest_node_id(nodes, source_node, transport_mode): min_node = node min_value = length + print("min_node: ") + print(min_node) + return min_node @@ -51,8 +51,6 @@ def add_neighbours_bike(nodes): if 'highway' not in way['tags']: continue - print(way) - road = way['road'] for i in range(len(road) - 1): |
