Table of Contents - pgRouting Manual (3.8)

General

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

Pgrouting Concepts

Function Families

All Pairs - Family of Functions

• pgr_floydWarshall - Floyd-Warshall’s algorithm.

• pgr_johnson - Johnson’s algorithm

A* - 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.

Components - Family of functions

• pgr_connectedComponents - Connected components of an undirected graph.

• pgr_strongComponents - Strongly connected components of a directed graph.

• pgr_biconnectedComponents - Biconnected components of an undirected graph.

• pgr_articulationPoints - Articulation points of an undirected graph.

• pgr_bridges - Bridges of an undirected graph.

Contraction - Family of functions

• pgr_contraction

Dijkstra - Family of functions

• pgr_dijkstra - Dijkstra’s algorithm for the shortest paths.

• pgr_dijkstraCost - Get the aggregate cost of the shortest paths.

• pgr_dijkstraCostMatrix - Use pgr_dijkstra to create a costs matrix.

• 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.

Kruskal - Family of functions

• pgr_kruskal

• pgr_kruskalBFS

• pgr_kruskalDD

• pgr_kruskalDFS

Metrics - Family of functions

• pgr_degree - Returns a set of vertices and corresponding count of incident edges to the vertex.

Prim - Family of functions

• pgr_prim

• pgr_primBFS

• pgr_primDD

• pgr_primDFS

Reference

• pgr_version

• pgr_full_version

Topology - Family of Functions

The following functions modify the database directly therefore the user must have special permissions given by the administrators to use them.

• pgr_createTopology - Deprecated since v3.8.0 - create a topology based on the geometry.

• pgr_createVerticesTable - Deprecated since 3.8.0 - reconstruct the vertices table based on the source and target information.

• pgr_analyzeGraph - Deprecated since 3.8.0 - to analyze the edges and vertices of the edge table.

• pgr_analyzeOneWay - Deprecated since 3.8.0 - to analyze directionality of the edges.

• pgr_nodeNetwork - Deprecated since 3.8.0 - to create nodes to a not noded edge table.

Traveling Sales Person - Family of functions

• pgr_TSP - When input is given as matrix cell information.

• pgr_TSPeuclidean - When input are coordinates.

pgr_trsp - Proposed - Turn Restriction Shortest Path (TRSP)

Utilities

• pgr_extractVertices - Extracts vertex information based on the edge table information.

• pgr_findCloseEdges - Finds close edges of points on the fly

• pgr_separateCrossing - Breaks geometries that cross each other.

• pgr_separateTouching - Breaks geometries that (almost) touch each other.

Functions by categories

Cost - Category

• pgr_aStarCost

• pgr_bdAstarCost

• pgr_dijkstraCost

• pgr_bdDijkstraCost

• pgr_dijkstraNearCost - Proposed

Cost Matrix - Category

• pgr_aStarCostMatrix

• pgr_dijkstraCostMatrix

• pgr_bdAstarCostMatrix

• pgr_bdDijkstraCostMatrix

Driving Distance - Category

• pgr_drivingDistance - Driving Distance based on Dijkstra’s algorithm

• pgr_primDD - Driving Distance based on Prim’s algorithm

• pgr_kruskalDD - Driving Distance based on Kruskal’s algorithm

• Post processing

  • pgr_alphaShape - Alpha shape computation

K shortest paths - Category

• pgr_KSP - Yen’s algorithm based on pgr_dijkstra

Spanning Tree - Category

• Kruskal - Family of functions

• Prim - Family of functions

BFS - Category

• pgr_kruskalBFS

• pgr_primBFS

DFS - Category

• pgr_kruskalDFS

• pgr_primDFS

Available Functions but not official pgRouting functions

• Proposed Functions

• Experimental Functions

Release Notes