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_dijkstraCostMatrix - Use pgr_dijkstra to create a costs matrix.
- 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 - Driving Distance based on pgr_dijkstra

Topology - Family of Functions

- pgr_extractVertices – Proposed - Extracts vertices information based on the source and target.

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

Minimum Cost Maximum FLow - Family of functions (Experimental)

- pgr_minCostMaxFlow_Cost - Experimental - Only the Min Cost calculation.
- pgr_minCostMaxFlow - Experimental - Details of flow and cost on edges.

Chinese Postman Problem - Family of functions (Experimental)

Contraction - Family of functions (Experimental) - Reduce network size using contraction techniques

Components - Family of functions (Experimental)

- pgr_connectedComponents - Experimental - Return the connected components of an undirected graph.
- pgr_strongComponents - Experimental - Return the strongly connected components of a directed graph.
- pgr_biconnectedComponents - Experimental - Return the biconnected components of an undirected graph.
- pgr_articulationPoints - Experimental - Return the articulation points of an undirected graph.
- pgr_bridges - Experimental - Return the bridges of an undirected graph.

Spanning Tree - Families of functions (Experimental)

- pgr_randomSpanTree - Experimental
- Kruskal - Family of functions (Experimental)
- Prim - Family of functions (Experimental)

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.

Others

VRP

Shortest Path Algorithms