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.
pgr_dijkstraNear - Proposed - Get the route to the nearest vertex.
pgr_dijkstraNearCost - Proposed - Get the cost to the nearest vertex.
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.
Topology - Family of Functions
These proposed functions do not modify the database.
pgr_extractVertices – Proposed - Extracts vertex information based on the edge table information.
Coloring - Family of functions
pgr_sequentialVertexColoring - Proposed - Vertex coloring algorithm using greedy approach.
Traversal - Family of functions
pgr_depthFirstSearch - Proposed - Depth first search traversal of the graph.
categories
pgr_withPointsDD - Proposed - Driving Distance based on pgr_withPoints
pgr_withPointsKSP - Proposed - Yen’s algorithm based on pgr_withPoints
withPoints - Family of functions - Functions based on Dijkstra algorithm.
See Also¶
Indices and tables