Chapter 8. Network Routing Analysis
In this chapter, we will cover the following topics:
- Finding the Dijkstra shortest path with pgRouting
- Finding the Dijkstra shortest path with NetworkX in pure Python
- Generating evacuation polygons based on an indoor shortest path
- Creating centerlines from polygons
- Building an indoor routing system in 3D
- Calculating indoor route walk time