Navigation : Table of Contents - pgRouting Manual (3.8) > Index - pgRouting Manual (3.8) Index - pgRouting Manual (3.8) Contents Index A B C D E F H I J K L M N O P R S T U V W A All Pairs Family pgr_floydWarshall pgr_johnson alphaShape analyzeGraph - Deprecated since 3.8.0 analyzeOneWay - Deprecated since 3.8.0 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 - Experimental 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 biconnectedComponents Bidirectional A* Family pgr_bdAstar pgr_bdAstarCost pgr_bdAstarCostMatrix Bidirectional Dijkstra Family pgr_bdDijkstra pgr_bdDijkstraCost pgr_bdDijkstraCostMatrix binaryBreadthFirstSearch - Experimental 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 - Experimental pgr_breadthFirstSearch - Experimental pgr_kruskalBFS pgr_primBFS breadthFirstSearch - Experimental Multiple vertices - Experimental on v3.0 Single vertex - Experimental on v3.0 bridges C chinesePostman - Experimental on v3.0 chinesePostmanCost - Experimental on v3.0 Coloring Family pgr_bipartite - Experimental pgr_edgeColoring - Experimental pgr_sequentialVertexColoring - Proposed Components Family pgr_articulationPoints pgr_biconnectedComponents pgr_bridges pgr_connectedComponents pgr_makeConnected - Experimental pgr_strongComponents connectedComponents contraction Contraction Family pgr_contraction pgr_contractionDeadEnd - Proposed pgr_contractionHierarchies - Experimental pgr_contractionLinear - Proposed contractionDeadEnd - Proposed contractionHierarchies - Experimental contractionLinear - Proposed Cost Category pgr_chinesePostman - Experimental pgr_chinesePostmanCost - Experimental pgr_dijkstraCost pgr_dijkstraNearCost - Proposed pgr_maxFlowMinCost_Cost - Experimental pgr_withPointsCost - Proposed Cost Matrix Category pgr_aStarCostMatrix pgr_bdAstarCostMatrix pgr_bdDijkstraCostMatrix pgr_dijkstraCostMatrix pgr_withPointsCostMatrix - Proposed createTopology - Deprecated since v3.8.0 createVerticesTable - Deprecated since 3.8.0 cuthillMckeeOrdering - Experimental on v3.4 D dagShortestPath - Experimental 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 Edges Edges and Vertices Depth First Search Category pgr_depthFirstSearch - Proposed pgr_kruskalBFS pgr_primDFS depthFirstSearch - Proposed 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 - Proposed pgr_dijkstraNearCost - Proposed pgr_dijkstraVia - Proposed dijkstraCost Combinations - Proposed on v3.1 Many to Many Many to One One to Many One to One dijkstraCostMatrix dijkstraNear - Proposed 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 - Proposed 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 - Proposed One Via - Proposed on 2.2 Directed Acyclic Graph Category pgr_dagShortestPath - Experimental Driving Distance Category pgr_drivingDistance pgr_kruskalDD pgr_primDD pgr_withPointsDD - Proposed 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 - Experimental 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 F findCloseEdges Many points One point Flow Family pgr_boykovKolmogorov pgr_edgeDisjointPaths pgr_edmondsKarp pgr_maxCardinalityMatch pgr_maxFlow pgr_maxFlowMinCost - Experimental pgr_maxFlowMinCost_Cost - Experimental 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_kruskal pgr_kruskalBFS pgr_kruskalDD pgr_kruskalDFS kruskalBFS Multiple vertices Single vertex kruskalDD Multiple vertices Single vertex kruskalDFS Multiple vertices Single vertex KSP Combinations - Proposed in 3.6 Many to Many - Proposed in 3.6 Many to One - Proposed in 3.6 One to Many - Proposed on 3.6 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 - Experimental 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 - Experimental 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 - Experimental pgr_degree Miscellaneous Algorithms pgr_chinesePostman - Experimental pgr_chinesePostmanCost - Experimental pgr_hawickCircuits pgr_lengauerTarjanDominatorTree pgr_stoerWagner pgr_transitiveClosure N Near Category pgr_dijkstraNear - Proposed pgr_dijkstraNearCost - Proposed nodeNetwork - Deprecated since 3.8.0 O Ordering Family pgr_cuthillMckeeOrdering pgr_topologicalSort P pgr_cuthillMckeeOrdering 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 separateCrossing separateTouching sequentialVertexColoring - Proposed on v3.3 Shortest Path Category pgr_bellmanFord - Experimental pgr_dagShortestPath - Experimental pgr_dijkstra pgr_edwardMoore - Experimental 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 - Deprecated since 3.8.0 pgr_analyzeOneWay - Deprecated since 3.8.0 pgr_createTopology - Deprecated since v3.8.0 pgr_createVerticesTable - Deprecated since 3.8.0 pgr_nodeNetwork - Deprecated since 3.8.0 Transformation Family pgr_lineGraph pgr_lineGraphFull transitiveClosure - Experimental on v3.0 Traveling Sales Person Family pgr_TSP pgr_TSPeuclidean Traversal Family pgr_binaryBreadthFirstSearch - Experimental pgr_breadthFirstSearch - Experimental pgr_depthFirstSearch - Proposed 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_extractVertices pgr_findCloseEdges pgr_separateCrossing pgr_separateTouching V Vehicle Routing Functions Category pgr_pickDeliver pgr_pickDeliverEuclidean pgr_vrpOneDepot version Via Category pgr_dijkstraVia - Proposed 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 - Proposed pgr_withPointsCostMatrix - Proposed pgr_withPointsDD - Proposed 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 - Proposed pgr_withPointsCostMatrix - Proposed pgr_withPointsDD - Proposed pgr_withPointsKSP pgr_withPointsVia withPointsCost - Proposed 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 - Proposed 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 Contents