Table of Contents¶

pgRouting extends the PostGIS/PostgreSQL geospatial database to provide geospatial routing and other network analysis functionality.

This is the manual for pgRouting v3.0.0-dev.

The pgRouting Manual is licensed under a Creative Commons Attribution-Share Alike 3.0 License. Feel free to use this material any way you like, but we ask that you attribute credit to the pgRouting Project and wherever possible, a link back to http://pgrouting.org. For other licenses used in pgRouting see the Licensing page.

General¶

Sample Data that is used in the examples of this manual.

Pgrouting Concepts¶

pgRouting Concepts

Reference

pgr_version - to get pgRouting’s version information.

Topology - Family of Functions ¶

pgr_createTopology - to create a topology based on the geometry.
pgr_createVerticesTable - to reconstruct the vertices table based on the source and target information.
pgr_analyzeGraph - to analyze the edges and vertices of the edge table.
pgr_analyzeOneWay - to analyze directionality of the edges.
pgr_nodeNetwork -to create nodes to a not noded edge table.

Routing Functions ¶

All Pairs - Family of Functions

pgr_floydWarshall - Floyd-Warshall’s Algorithm
pgr_johnson- Johnson’s Algorithm

aStar - Family of functions

pgr_aStar - A* algorithm for the shortest path.
pgr_aStarCost - Get the aggregate cost of the shortest paths.
pgr_aStarCostMatrix - Get the cost matrix of the shortest paths.

Bidirectional A* - Family of functions

pgr_bdAstar - Bidirectional A* algorithm for obtaining paths.
pgr_bdAstarCost - Bidirectional A* algorithm to calculate the cost of the paths.
pgr_bdAstarCostMatrix - Bidirectional A* algorithm to calculate a cost matrix of paths.

Bidirectional Dijkstra - Family of functions

pgr_bdDijkstra - Bidirectional Dijkstra algorithm for the shortest paths.
pgr_bdDijkstraCost - Bidirectional Dijkstra to calculate the cost of the shortest paths
pgr_bdDijkstraCostMatrix - Bidirectional Dijkstra algorithm to create a matrix of costs of the shortest paths.

Dijkstra - Family of functions

pgr_dijkstra - Dijkstra’s algorithm for the shortest paths.
pgr_dijkstraCost - Get the aggregate cost of the shortest paths.
pgr_drivingDistance - Use pgr_dijkstra to calculate catchament information.
pgr_KSP - Use Yen algorithm with pgr_dijkstra to get the K shortest paths.

Flow - Family of functions

pgr_maxFlow - Only the Max flow calculation using Push and Relabel algorithm.
pgr_boykovKolmogorov - Boykov and Kolmogorov with details of flow on edges.
pgr_edmondsKarp - Edmonds and Karp algorithm with details of flow on edges.
pgr_pushRelabel - Push and relabel algorithm with details of flow on edges.
Applications
- pgr_edgeDisjointPaths - Calculates edge disjoint paths between two groups of vertices.
- pgr_maxCardinalityMatch - Calculates a maximum cardinality matching in a graph.

pgr_KSP - K-Shortest Path

pgr_trsp - Turn Restriction Shortest Path (TRSP) - Turn Restriction Shortest Path (TRSP)

pgr_TSP

pgr_TSP - When input is given as matrix cell information.
pgr_eucledianTSP - When input are coordinates.

Driving Distance - Category

pgr_drivingDistance - Driving Distance based on pgr_dijkstra
Post pocessing
- pgr_alphaShape - Alpha shape computation
- pgr_pointsAsPolygon - Polygon around a set of points

Table of Contents¶

General¶

Pgrouting Concepts¶

Topology - Family of Functions ¶

Routing Functions ¶

Available Functions but not official pgRouting functions¶

Release Notes ¶

Table of Contents¶

General¶

Pgrouting Concepts¶

Topology - Family of Functions¶

Routing Functions¶

Available Functions but not official pgRouting functions¶

Release Notes¶

Topology - Family of Functions ¶

Routing Functions ¶

Release Notes ¶