# pgRouting Manual (3.6)

## 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.

- pgr_withPointsVia - Proposed - Via routing

TRSP - Family of functions

- pgr_trsp - Proposed - Vertex - Vertex routing with restrictions.

- pgr_trspVia - Proposed - Via Vertices routing with restrictions.

- pgr_trsp_withPoints - Proposed - Vertex/Point routing with restrictions.

- pgr_trspVia_withPoints - Proposed - Via Vertex/point routing with restrictions.

Topology - Family of Functions

These proposed functions do not modify the database.

- pgr_degree – Proposed - Returns a set of vertices and corresponding count of incidet edges to the vertex.

- 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

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

Via - Category

- pgr_dijkstraVia - Proposed

- pgr_withPointsVia - Proposed

- pgr_trspVia - Proposed

- pgr_trspVia_withPoints - Proposed

withPoints - Category

- withPoints - Family of functions - Functions based on Dijkstra algorithm.

- From the TRSP - Family of functions:

  - pgr_trsp_withPoints - Proposed - Vertex/Point routing with restrictions.

  - pgr_trspVia_withPoints - Proposed - Via Vertex/point routing with restrictions.

Utilities

pgr_findCloseEdges

## See Also

- Experimental Functions

Indices and tables

- Index

- Search Page