O'Reilly logo

Learning Geospatial Analysis with Python - Second Edition by Joel Lawhead

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Routing along streets

Routing along streets uses a connected network of lines called a graph. The lines in the graph can have impedance values that discourage a routing algorithm from including them in a route. Examples of impedance values often include traffic volume, speed limit, or even distance. A key requirement for a routing graph is that all of the lines, known as edges, must be connected. Road datasets created for mapping will often have lines whose nodes do not intersect. In this example, we'll calculate the shortest route through a graph by distance. We'll use a start and end point which are not nodes in the graph, which means we'll have to first find the graph nodes closest to our start and destination.

To calculate the shortest route, ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required