From 7200d4c39f0a1c59bc73d49fcde7e041d28c7dfa Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Gustav=20S=C3=B6rn=C3=A4s?= <gusso230@student.liu.se>
Date: Fri, 6 Nov 2020 10:34:09 +0100
Subject: remove unnecessary print

---
 algorithms.py | 1 -
 1 file changed, 1 deletion(-)

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
-- 
cgit v1.2.1