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
Introduction
Routing has become commonplace on navigation devices for road networks across the world. If you want to know how to drive from point A to point B, simply enter the start address and end address into your navigation software and it will calculate the shortest route for you in seconds.
Here's a scenario you may come across: Route me to Prof. Dr. Smith's office in the Geography ...
Get Python Geospatial Analysis Cookbook now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
