In this chapter, you have learned how spatial data is stored in information systems, and how to use it with Neo4j. You now know how to use the Neo4j built-in point type and perform distance queries using it. You have also learned about the neo4j-spatial plugin, allowing more complex operations such as geometry intersection and within distance queries.
Finally, you have learned how to build a graph-based routing engine using spatial data and the shortest path algorithms implemented in the GDS library. With the help of some JavaScript code, you have even been able to nicely display the result of the path finding algorithm on a map.
In the next chapter, you will discover a new type of algorithm: centrality algorithms. They are used to quantify the node importance, depending on your definition of importance.