Skip to content

Building a routable network

Jip Claassens edited this page Aug 3, 2026 · 3 revisions

Building a routable network

(outline — to be written out)

A geographic file of road geometry is not yet a graph. This page will describe the step from downloaded source data (Network data sources) to a connected, directed network that Dijkstra can traverse.

Planned contents

  • From arcs to links and nodes — splitting polylines at intersections; building the node set; the F1/F2 from-node/to-node convention used throughout this wiki
  • Planarity and grade separation — crossings that must connect versus bridges and tunnels that must not; why naive intersection of geometry produces routes through viaducts
  • Directionality — one-way streets, and representing them as directed links
  • Turn restrictions and turn penalties — where they matter (urban car routing) and where they can be ignored
  • Mode-specific subnetworks — filtering links by access rights per mode, and why a pedestrian network is not a subset of a car network
  • Connectivity checking — finding disconnected components with connected_parts, and deciding which are genuine islands and which are data errors
  • Barriers and crossings — level crossings, ferries, gates

Related

Clone this wiki locally