Index

A

All Pairs Family pgr_floydWarshall pgr_johnson alphaShape analyzeGraph analyzeOneWay articulationPoints aStar Combinations - Proposed on v3.2 Many to Many Many to One One to Many One to One

aStar Family pgr_aStar pgr_aStarCost pgr_aStarCostMatrix aStarCost Combinations - Proposed on v3.2 Many to Many Many to One One to Many One to One aStarCostMatrix

B

bdAstar Combinations - Proposed on v3.2 Many to Many Many to One One to Many One to One bdAstarCost Combinations - Proposed on v3.2 Many to Many Many to One One to Many One to One bdAstarCostMatrix bdDijkstra Combinations - Proposed on v3.2 Many to Many Many to One One to Many One to One bdDijkstraCost Combinations - Proposed on v3.2 Many to Many Many to One One to Many One to One bdDijkstraCostMatrix bellmanFord Combinations - Experimental on v3.2 Many to Many - Experimental on v3.0 Many to One - Experimental on v3.0 One to Many - Experimental on v3.0 One to One - Experimental on v3.0

betweennessCentrality - Experimental on v3.7 BFS Category biconnectedComponents Bidirectional A* Family pgr_bdAstar pgr_bdAstarCost pgr_bdAstarCostMatrix Bidirectional Dijkstra Family pgr_bdDijkstra pgr_bdDijkstraCost pgr_bdDijkstraCostMatrix binaryBreadthFirstSearch Combinations - Experimental on v3.2 Many to Many - Experimental on v3.0 Many to One - Experimental on v3.0 One to Many - Experimental on v3.0 One to One - Experimental on v3.0 bipartite - Experimental on v3.2 boykovKolmogorov Combinations - Proposed on v3.2 Many to Many Many to One One to Many One to One Breadth First Search Category pgr_binaryBreadthFirstSearch pgr_breadthFirstSearch pgr_kruskalBFS pgr_primBFS breadthFirstSearch Multiple vertices - Experimental on v3.0 Single vertex - Experimental on v3.0 bridges

C

chinesePostman - Experimental on v3.0 chinesePostmanCost - Experimental on v3.0 Components Family pgr_articulationPoints pgr_biconnectedComponents pgr_bridges pgr_connectedComponents pgr_makeConnected pgr_strongComponents connectedComponents, [1] contraction Contraction Family pgr_contraction

Cost Category pgr_dijkstraCost pgr_dijkstraNearCost pgr_maxFlowMinCost_Cost pgr_withPointsCost Cost Matrix Category pgr_dijkstraCostMatrix pgr_withPointsCostMatrix createTopology createVerticesTable cuthillMckeeOrdering - Experimental on v3.4

D

dagShortestPath Combinations - Experimental on v3.2 Many to Many - Experimental on v3.0 Many to One - Experimental on v3.0 One to Many - Experimental on v3.0 One to One - Experimental on v3.0 degree Depth First Search Category pgr_depthFirstSearch pgr_kruskalBFS pgr_primDFS depthFirstSearch Multiple vertices - Proposed on v3.3 Single vertex - Proposed on v3.3 dijkstra Combinations - Proposed on v3.1 Many to Many Many to One One to Many One to One Dijkstra Family pgr_dijkstra pgr_dijkstraCost pgr_dijkstraCostMatrix pgr_dijkstraNear pgr_dijkstraNearCost pgr_dijkstraVia dijkstraCost Combinations - Proposed on v3.1 Many to Many Many to One One to Many One to One

dijkstraCostMatrix dijkstraNear Combinations - Proposed on v3.3 Many to Many - Proposed on v3.3 Many to One - Proposed on v3.3 One to Many - Proposed on v3.3 dijkstraNearCost Combinations - Proposed on v3.3 Many to Many - Proposed on v3.3 Many to One - Proposed on v3.3 One to Many - Proposed on v3.3 dijkstraVia dijkstraVia - Proposed on 2.2 Directed Acyclic Graph Category pgr_dagShortestPath Driving Distance Category pgr_drivingDistance pgr_kruskalDD pgr_primDD pgr_withPointsDD drivingDistance Multiple vertices Single vertex

E

edgeColoring - Experimental on v3.3 edgeDisjointPaths Combinations -- Proposed on v3.2 Many to Many Many to One One to Many One to One edmondsKarp Combinations - Proposed on v3.2 Many to Many Many to One One to Many One to One

edwardMoore Combinations - Experimental on v3.2 Many to Many - Experimental on v3.0 Many to One - Experimental on v3.0 One to Many - Experimental on v3.0 One to One - Experimental on v3.0 extractVertices - Proposed on v3.3

F

findCloseEdges Many points - Proposed on 3.4 One point - Proposed on 3.4 Flow Family edgeDisjointPaths edmondsKarp pgr_boykovKolmogorov pgr_maxCardinalityMatch pgr_maxFlow pgr_maxFlowMinCost pgr_maxFlowMinCost_Cost pgr_pushRelabel

floydWarshall full_version

H

Hawick Circuits - Experimental on v3.4

I

isPlanar - Experimental on v3.2

J

johnson

K

K Shortest Paths Category pgr_KSP pgr_withPointsKSP kruskal Kruskal Family pgr_kruska pgr_kruskalBFS pgr_kruskalDD pgr_kruskalDFS kruskalBFS Multiple vertices Single vertex

kruskalDD Multiple vertices Single vertex kruskalDFS Multiple vertices Single vertex KSP Combinations Many to Many Many to One One to Many One to One

L

lengauerTarjanDominatorTree - Experimental on v3.2

lineGraph - Proposed on v3.7 lineGraphFull - Experimental on v2.6

M

makeConnected - Experimental on v3.2 maxCardinalityMatch maxFlow Combinations - Proposed on v3.2 Many to Many Many to One One to Many One to One maxFlowMinCost Combinations -- Experimental on v3.2 Many to Many - Experimental on v3.0 Many to One - Experimental on v3.0 One to Many - Experimental on v3.0 One to One - Experimental on v3.0

maxFlowMinCost_Cost Combinations - Experimental on v3.2 Many to Many - Experimental on v3.0 Many to One - Experimental on v3.0 One to Many - Experimental on v3.0 One to One - Experimental on v3.0 MaximumCardinalityMatch Metrics Family pgr_betweennessCentrality Miscellaneous Algorithms pgr_hawickCircuits pgr_lengauerTarjanDominatorTree pgr_stoerWagner pgr_transitiveClosure

N

Near Category pgr_dijkstraNear pgr_dijkstraNearCost

nodeNetwork

O

Ordering Family pgr_cuthillMckeeOrdering pgr_topologicalSort

P

pgr_cuthillMckeeOrdering pgr_degree - Proposed on v3.4 pgr_nodeNetwork pgr_TSP pgr_TSPeuclidean pickDeliver - Experimental on v3.0 pickDeliverEuclidean - Experimental on 3.0 Planar Family pgr_isPlanar prim Prim Family pgr_prim pgr_primBFS pgr_primDD pgr_primDFS

primBFS Multiple vertices Single vertex primDD Multiple vertices Single vertex primDFS Multiple vertices Single vertex pushRelabel Combinations - Proposed on v3.2 Many to Many Many to One One to Many One to One

R

Reference pgr_full_version pgr_version Restrictions Category pgr_trsp pgr_trsp_withPoints pgr_trspVia pgr_trspVia_withPoints pgr_turnRestrictedPath

S

sequentialVertexColoring - Proposed on v3.3 Shortest Path Category pgr_bellmanFord pgr_dagShortestPath pgr_dijkstra pgr_edwardMoore pgr_trsp pgr_trsp_withPoints pgr_turnRestrictedPath pgr_withPoints Spanning Tree Category Kruskal Family pgr_kruskal pgr_kruskalBFS pgr_kruskalDD pgr_kruskalDFS pgr_prim pgr_primBFS pgr_primDD pgr_primDFS Prim Family

stoerWagner - Experimental on v3.0 strongComponents

T

topologicalSort - Experimental on v3.0 Topology Family pgr_analyzeGraph pgr_analyzeOneWay pgr_createTopology pgr_createVerticesTable pgr_degree pgr_extractVertices pgr_nodeNetwork Transformation Family pgr_lineGraph pgr_lineGraphFull transitiveClosure - Experimental on v3.0 Traveling Sales Person Family pgr_TSP pgr_TSPeuclidean Traversal Family pgr_binaryBreadthFirstSearch pgr_breadthFirstSearch pgr_depthFirstSearch trsp Combinations - Proposed on v3.4 Many to Many -- Proposed on v3.4 Many to One -- Proposed on v3.4 One to Many -- Proposed on v3.4 One to One -- Proposed on v3.4

trsp_withPoints Combinations - Proposed on v3.4 Many to Many - Proposed on v3.4 Many to One - Proposed on v3.4 One to Many - Proposed on v3.4 One to One - Proposed on v3.4 trspVia One Via - Proposed on v3.4 trspVia_withPoints One Via - Proposed on v3.4 TSP TSPeuclidean Turn Restriction Shortest Path Family pgr_trsp pgr_trsp_withPoints pgr_trspVia pgr_trspVia_withPoints pgr_turnRestrictedPath turnRestrictedPath

U

Utilities pgr_findCloseEdges

V

Vehicle Routing Functions Category pgr_pickDeliver pgr_pickDeliverEuclidean pgr_vrpOneDepot version

Via Category pgr_dijkstraVia pgr_trspVia pgr_trspVia_withPoints pgr_withPointsVia vrpOneDepot - Experimental on v2.1.0

W

With Points Category pgr_trsp_withPoints pgr_trspVia_withPoints pgr_withPoints pgr_withPointsCost pgr_withPointsCostMatrix pgr_withPointsDD pgr_withPointsKSP pgr_withPointsVia withPoints Combinations - Proposed on v3.2 Many to Many - Proposed on v2.2 Many to One - Proposed on v2.2 One to Many - Proposed on v2.2 One to One - Proposed on v2.2 withPoints Family pgr_withPoints pgr_withPointsCost pgr_withPointsCostMatrix pgr_withPointsDD pgr_withPointsKSP pgr_withPointsVia

withPointsCost Combinations -- Proposed on v3.2 Many To Many - Proposed on v2.2 Many To One - Proposed on v2.2 One To Many - Proposed on v2.2 One To One - Proposed on v2.2 withPointsCostMatrix - proposed on v2.0 withPointsDD Multiple Vertices - Proposed on v2.2 Single Vertex - Proposed on v2.2 withPointsKSP Combinations - Proposed on v3.6 Many to Many - Proposed on v3.6 Many to One - Proposed on v3.6 One to Many - Proposed on v3.6 One to One - Proposed on v2.2 withPointsVia One Via - Proposed on v3.4