Routing Functions¶

All Pairs - Family of Functions

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

pgr_aStar - Shortest Path A*

pgr_bdAstar - Bi-directional A* Shortest Path

pgr_bdDijkstra - Bi-directional Dijkstra Shortest Path

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 - proposed - 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.
• pgr_dijkstraVia - Proposed - Get a route of a seuence of vertices.

pgr_KSP - K-Shortest Path

pgr_trsp - Turn Restriction Shortest Path (TRSP)

Traveling Sales Person - Family of functions

• 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
• pgr_withPointsDD - Proposed - Driving Distance based on pgr_withPoints
• Post pocessing
  • pgr_alphaShape - Alpha shape computation
  • pgr_pointsAsPolygon - Polygon around a set of points