diff options
| author | Stefan Hansson <steha708@edu.liu.se> | 2020-12-15 09:34:11 +0100 |
|---|---|---|
| committer | Newbyte <steha708@liu.se> | 2020-12-15 18:23:54 +0100 |
| commit | 7d31854216fd893e1805c6dd40517f329ee3e886 (patch) | |
| tree | 81fc149dc90cf185d627e800e98b9e01c0c94946 /algorithms.py | |
| parent | 4b052bb509b34ff0d6d5bb6d68aacbc469f0f0b0 (diff) | |
| download | tdde25-7d31854216fd893e1805c6dd40517f329ee3e886.tar.gz | |
wip
Diffstat (limited to 'algorithms.py')
| -rw-r--r-- | algorithms.py | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/algorithms.py b/algorithms.py index 21d5348..855c69e 100644 --- a/algorithms.py +++ b/algorithms.py @@ -18,7 +18,6 @@ def length_haversine(p1, p2): return 6372797.560856 * c # return the distance in meters -<<<<<<< HEAD def grid_search(grid, source_node): """ Finds closest node to source node by comparing distance to nodes within @@ -81,6 +80,7 @@ def get_closest_node_id(nodes, source_node, transport_mode): min_value = None for node in nodes: + print(node) length = length_haversine(source_node, node) relevant_neighbours = get_relevant_neighbours(node, transport_mode) |