Proposed Functions - pgRouting Manual (3.2)
Proposed Functions
Warning
Proposed functions for next mayor release.
-
They are not officially in the current release.
-
They will likely officially be part of the next mayor release:
-
The functions make use of ANY-INTEGER and ANY-NUMERICAL
-
Name might not change. (But still can)
-
Signature might not change. (But still can)
-
Functionality might not change. (But still can)
-
pgTap tests have being done. But might need more.
-
Documentation might need refinement.
-
Families
Dijkstra - Family of functions
-
pgr_dijkstraVia - Proposed - Get a route of a seuence of vertices.
withPoints - Family of functions
-
pgr_withPoints - Proposed - Route from/to points anywhere on the graph.
-
pgr_withPointsCost - Proposed - Costs of the shortest paths.
-
pgr_withPointsCostMatrix - proposed - Costs of the shortest paths.
-
pgr_withPointsKSP - Proposed - K shortest paths.
-
pgr_withPointsDD - Proposed - Driving distance.
categories
-
pgr_withPointsDD - Proposed - Driving Distance based on pgr_withPoints
-
pgr_withPointsKSP - Proposed - Yen’s algorithm based on pgr_withPoints
See Also
Indices and tables