Routing Functions¶
- All pairs - All pair of vertices.
- 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 - Dijkstra family functions
- pgr_dijkstra - Dijkstra’s shortest path algorithm.
- pgr_dijkstraCost - Use pgr_dijkstra to calculate the costs of the shortest paths.
- Driving Distance - Driving Distance
- pgr_drivingDistance - Driving Distance
- Post processing
- pgr_alphaShape - Alpha shape computation
- pgr_pointsAsPolygon - Polygon around set of points
- pgr_ksp - K-Shortest Path
- pgr_trsp - Turn Restriction Shortest Path (TRSP)
- Traveling Sales Person
- pgr_TSP - When input is a cost matrix.
- pgr_eucledianTSP - When input are coordinates.