diff options
| author | Gustav Sörnäs <gusso230@student.liu.se> | 2020-11-06 10:34:09 +0100 |
|---|---|---|
| committer | Gustav Sörnäs <gusso230@student.liu.se> | 2020-11-06 10:34:09 +0100 |
| commit | 7200d4c39f0a1c59bc73d49fcde7e041d28c7dfa (patch) | |
| tree | 2d20c7f1e5d90f4109bab866e5761b07ba7340db /algorithms.py | |
| parent | b6898e9503fda2b7f7ae4366da0895c0e140c133 (diff) | |
| download | tdde25-7200d4c39f0a1c59bc73d49fcde7e041d28c7dfa.tar.gz | |
remove unnecessary print
Diffstat (limited to 'algorithms.py')
| -rw-r--r-- | algorithms.py | 1 |
1 files changed, 0 insertions, 1 deletions
diff --git a/algorithms.py b/algorithms.py index 06d768c..3c84cf2 100644 --- a/algorithms.py +++ b/algorithms.py @@ -49,7 +49,6 @@ def find_shortest_path(nodes, source_id, target_id): continue visited.add(walk_end) for neighbour in nodes[walk_end].neighbours: - print(neighbour) if neighbour not in visited: heapq.heappush(queue, (cand_dist + length_haversine(nodes[walk_end], neighbour), cand_path + (neighbour.id, ))) # no path found |