Stable Proposed Functions¶

As part of the Dijkstra - Family of functions

• pgr_dijkstraCostMatrix - proposed Use pgr_dijkstra to calculate a cost matrix.
• pgr_dijkstraVia - Proposed - Use pgr_dijkstra to make a route via vertices.

Families

aStar - Family of functions

• pgr_aStar - A* algorithm for the shortest path.
• pgr_aStarCost – proposed - Get the aggregate cost of the shortest paths.
• pgr_aStarCostMatrix - proposed - Get the cost matrix of the shortest paths.

Bidirectional A* - Family of functions

• pgr_bdAstar - Bidirectional A* algorithm for obtaining paths.
• pgr_bdAstarCost - Proposed - Bidirectional A* algorithm to calculate the cost of the paths.
• pgr_bdAstarCostMatrix - proposed - Bidirectional A* algorithm to calculate a cost matrix of paths.

Bidirectional Dijkstra - Family of functions

• pgr_bdDijkstra - Bidirectional Dijkstra algorithm for the shortest paths.
• pgr_bdDijkstraCost - Proposed - Bidirectional Dijkstra to calculate the cost of the shortest paths
• pgr_bdDijkstraCostMatrix - proposed - Bidirectional Dijkstra algorithm to create a matrix of costs of the shortest paths.

Flow - Family of functions

• pgr_maxFlow - Proposed - Only the Max flow calculation using Push and Relabel algorithm.
• pgr_boykovKolmogorov - Proposed - Boykov and Kolmogorov with details of flow on edges.
• pgr_edmondsKarp - Proposed - Edmonds and Karp algorithm with details of flow on edges.
• pgr_pushRelabel - Proposed - Push and relabel algorithm with details of flow on edges.
• Applications
  • pgr_edgeDisjointPaths - Proposed - Calculates edge disjoint paths between two groups of vertices.
  • pgr_maxCardinalityMatch - Proposed - Calculates a maximum cardinality matching in a graph.

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

Cost - Category

• pgr_aStarCost – proposed
• pgr_bdAstarCost - Proposed
• pgr_bdDijkstraCost - Proposed
• pgr_dijkstraCost
• pgr_withPointsCost - Proposed

Cost Matrix - Category

• pgr_aStarCostMatrix - proposed
• pgr_bdAstarCostMatrix - proposed
• pgr_bdDijkstraCostMatrix - proposed
• pgr_dijkstraCostMatrix - proposed
• pgr_withPointsCostMatrix - proposed

KSP Category

• pgr_KSP - Driving Distance based on pgr_dijkstra
• pgr_withPointsKSP - Proposed - Driving Distance based on pgr_dijkstra

Experimental Functions¶

Contraction - Family of functions - Reduce network size using contraction techniques

• pgr_contractGraph - Experimental - Reduce network size using contraction techniques

Graph Analysis

• pgr_labelGraph - Experimental - Analyze / label subgraphs within a network

Components - Family of functions - Analyze components within a graph

• 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

VRP

• pgr_gsoc_vrppdtw - Experimental
• pgr_vrpOneDepot - Experimental

Graph Operations

Transformation - Family of functions - Maps a given graph to a new form

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