# pgRouting Manual (3.3)

## Proposed Functions

- Supported versions: Latest (3.3) 3.2 3.1 3.0

- Unsupported versions: 2.6 2.5 2.4 2.3 2.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.

- 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

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

Traversal - Family of functions

- pgr_depthFirstSearch - Proposed - Depth first search traversal of the graph.

Coloring - Family of functions

- pgr_sequentialVertexColoring - Proposed - Vertex coloring algorithm using greedy approach.

categories

Cost - Category

- pgr_withPointsCost - Proposed

Cost Matrix - Category

- pgr_withPointsCostMatrix - proposed

Driving Distance - Category

- pgr_withPointsDD - Proposed - Driving Distance based on pgr_withPoints

K shortest paths - Category

- pgr_withPointsKSP - Proposed - Yen’s algorithm based on pgr_withPoints

## See Also

- Experimental Functions

Indices and tables

- Index

- Search Page