Experimental Functions - pgRouting Manual (3.2)
Experimental Functions
Warning
Possible server crash
-
These functions might create a server crash
Warning
Experimental functions
-
They are not officially of the current release.
-
They likely will not be officially be part of the next release:
-
The functions might not make use of ANY-INTEGER and ANY-NUMERICAL
-
Name might change.
-
Signature might change.
-
Functionality might change.
-
pgTap tests might be missing.
-
Might need c/c++ coding.
-
May lack documentation.
-
Documentation if any might need to be rewritten.
-
Documentation examples might need to be automatically generated.
-
Might need a lot of feedback from the comunity.
-
Might depend on a proposed function of pgRouting
-
Might depend on a deprecated function of pgRouting
-
Families
-
pgr_maxFlowMinCost - Experimental - Details of flow and cost on edges.
-
pgr_maxFlowMinCost_Cost - Experimental - Only the Min Cost calculation.
Chinese Postman Problem - Family of functions (Experimental)
Coloring - Family of functions (Experimental)
-
pgr_sequentialVertexColoring - Experimental - Vertex coloring algorithm using greedy approach.
-
pgr_bipartite -Experimental - Bipartite graph algorithm using a DFS-based coloring approach.
Topology - Family of Functions
-
pgr_extractVertices - Experimental - Extracts vertices information based on the source and target.
Transformation - Family of functions (Experimental)
-
pgr_lineGraph - Experimental - Transformation algorithm for generating a Line Graph.
-
pgr_lineGraphFull - Experimental - Transformation algorithm for generating a Line Graph out of each vertex in the input graph.
Traversal - Family of functions (Experimental)
-
pgr_depthFirstSearch - Experimental - Depth first search traversal of the graph.
Components - Family of functions
-
pgr_makeConnected - Experimental - Details of edges to make graph connected.
Dijkstra - Family of functions
-
pgr_dijkstraNear - Experimental - Get the route to the nearest vertex.
-
pgr_dijkstraNearCost - Experimental - Get the cost to the nearest vertex.
categories
Vehicle Routing Functions - Category (Experimental)
-
Pickup and delivery problem
-
pgr_pickDeliver - Experimental - Pickup & Delivery using a Cost Matrix
-
pgr_pickDeliverEuclidean - Experimental - Pickup & Delivery with Euclidean distances
-
-
Distribution problem
-
pgr_vrpOneDepot - Experimental - From a single depot, distributes orders
-
Not classified
See Also
Indices and tables