Implement finding nearest nodes to start and end positions

1 files changed, 15 insertions, 1 deletions

diff --git a/server.py b/server.py
index 0710905..e6ff6c2 100644
--- a/server.py
+++ b/server.py
@@ -1,7 +1,8 @@
 import json
 
+import algorithms
 import store
-from lib import run_server, get, read_html
+from lib import run_server, get, post, read_html
 
 
 @get('/')
@@ -17,4 +18,17 @@ def show_area():
     return json.dumps(all)
 
 
+@post('/shortest-path')
+def shortest_path(body):
+    body = json.loads(body)
+    source_id = algorithms.get_closest_node_id(store.nodes, store.Node(-1, body['lat1'], body['lng1']))
+    target_id = algorithms.get_closest_node_id(store.nodes, store.Node(-1, body['lat2'], body['lng2']))
+    print(source_id, target_id)
+    source_node = store.nodes[source_id]
+    target_node = store.nodes[target_id]
+    path = [(source_node.lat, source_node.lng), (target_node.lat, target_node.lng)]
+    response = {'path': path}
+    return json.dumps(response)
+
+
 run_server()