Questions

1. Spatial data:
   1. Add a new point of interest in New York and create a Neo4j relationship between it and the district it belongs to.
   2. Write the query to find the closest street to a given point (latitude, longitude).
2. Routing engine:
   1. Modify the shortest path algorithm to find the shortest path in terms of duration instead of distance.
   2. Improve the routing engine for pedestrians by excluding motorways from the possible streets.
   3. How would you find alternative paths?
3. Visualization:
   1. Modify the web page we created to let the user choose the start and end nodes.
   2. Modify the web page we created to let the user choose the start and end latitude and longitude. The script will have to find the OSM ID of the start and end nodes in order to display the shortest path between them.