Navigation : Table of Contents - pgRouting Manual (3.4) > Index - pgRouting Manual (3.4) Index - pgRouting Manual (3.4) Contents Index A B C D E F H I K L M P S T V W A alphaShape articulationPoints aStar(Many to Many) aStar(Many to One) astar(One to Many) aStar(One to One) aStarCost(Combinations) - Proposed on v3.2 , [1] aStarCost(Many to Many) aStarCost(Many to One) aStarCost(One to Many) aStarCost(One to One) aStarCostMatrix B bdAstar(Combinations) - Proposed on v3.2 bdAstar(Many to Many) bdAstar(Many to One) bdAstar(One to Many) bdAstar(One to One) bdAstarCost(Combinations) - Proposed on v3.2 bdAstarCost(Many to Many) bdAstarCost(Many to One) bdAstarCost(One to Many) bdAstarCost(One to One) bdAstarCostMatrix bdDijkstra(Combinations) - Proposed on v3.2 bdDijkstra(Many to Many) bdDijkstra(Many to One) bdDijkstra(One to Many) bdDijkstra(One to One) bdDijkstraCost(Combinations) - Proposed on v3.2 bdDijkstraCost(Many to Many) bdDijkstraCost(Many to One) bdDijkstraCost(One to Many) bdDijkstraCost(One to One) bdDijkstraCostMatrix bellman_ford(Many to One) - Experimental on v3.0 bellman_ford(One to One) - Experimental on v3.0 bellmanFord(Combinations) - Experimental on v3.2 bellmanFord(Many to Many) - Experimental on v3.0 bellmanFord(One to Many) - Experimental on v3.0 biconnectedComponents binaryBreadthFirstSearch(Combinations) - Experimental on v3.2 binaryBreadthFirstSearch(Many to Many) - Experimental on v3.0 binaryBreadthFirstSearch(Many to One) - Experimental on v3.0 binaryBreadthFirstSearch(One to Many) - Experimental on v3.0 binaryBreadthFirstSearch(One to One) - Experimental on v3.0 bipartite - Experimental on v3.2 boykovKolmogorov(Combinations) - Proposed on v3.2 boykovKolmogorov(Many to Many) boykovKolmogorov(Many to One) boykovKolmogorov(One to Many) boykovKolmogorov(One to One) breadthFirstSearch(Multiple vertices) - Experimental on v3.0 breadthFirstSearch(Single vertex) - Experimental on v3.0 bridges C chinesePostman - Experimental on v3.0 chinesePostmanCost - Experimental on v3.0 connectedComponents contraction cuthillMckeeOrdering - Experimental on v3.4 D dagShortestPath(Combinations) - Experimental on v3.2 dagShortestPath(Many to Many) - Experimental on v3.0 dagShortestPath(Many to One) - Experimental on v3.0 dagShortestPath(One to Many) - Experimental on v3.0 dagShortestPath(One to One) - Experimental on v3.0 depthFirstSearch(Multiple vertices) - Proposed on v3.3 depthFirstSearch(Single vertex) - Proposed on v3.3 dijkstra(Combinations) - Proposed on v3.1 dijkstra(Many to Many) dijkstra(Many to One) dijkstra(One to Many) dijkstra(One to One) dijkstraCost(Combinations) - Proposed on v3.1 dijkstraCost(Many to Many) dijkstraCost(Many to One) dijkstraCost(One to Many) dijkstraCost(One to One) dijkstraCostMatrix dijkstraNear(Combinations) - Proposed on v3.3 dijkstraNear(Many to Many) - Proposed on v3.3 dijkstraNear(Many to One) - Proposed on v3.3 dijkstraNear(One to Many) - Proposed on v3.3 dijkstraNearCost(Combinations) - Proposed on v3.3 dijkstraNearCost(Many to Many) - Proposed on v3.3 dijkstraNearCost(Many to One) - Proposed on v3.3 dijkstraNearCost(One to Many) - Proposed on v3.3 dijkstraVia - Proposed on 2.2 drivingDistance(Multiple vertices) drivingDistance(Single vertex) E edgeColoring - Experimental on v3.3 edgeDisjointPaths(Combinations) -- Proposed on v3.2 edgeDisjointPaths(Many to Many) edgeDisjointPaths(Many to One) edgeDisjointPaths(One to Many) edgeDisjointPaths(One to One) edmondsKarp(Combinations) - Proposed on v3.2 edmondsKarp(Many to Many) edmondsKarp(Many to One) edmondsKarp(One to Many) edmondsKarp(One to One) edwardMoore(Combinations) - Experimental on v3.2 edwardMoore(Many to Many) - Experimental on v3.0 edwardMoore(Many to One) - Experimental on v3.0 edwardMoore(One to Many) - Experimental on v3.0 edwardMoore(One to One) - Experimental on v3.0 F findCloseEdges(Many points) findCloseEdges(One point) , [1] full_version H Hawick Circuits - Experimental on v3.4 I isPlanar - Experimental on v3.2 K kruskal kruskalBFS(Multiple vertices) kruskalBFS(Single vertex) kruskalDD(Multiple vertices) kruskalDD(Single vertex) kruskalDFS(Multiple vertices) kruskalDFS(Single vertex) L lengauerTarjanDominatorTree - Experimental on v3.2 lineGraph - Experimental on v2.5 lineGraphFull - Experimental on v2.6 M makeConnected - Experimental on v3.2 maxFlow(Combinations) - Proposed on v3.2 maxFlow(Many to Many) maxFlow(Many to One) maxFlow(One to Many) maxFlow(One to One) maxFlowMinCost(Combinations) -- Experimental on v3.2 maxFlowMinCost(Many to Many) - Experimental on v3.0 maxFlowMinCost(Many to One) - Experimental on v3.0 maxFlowMinCost(One to Many) - Experimental on v3.0 maxFlowMinCost(One to One) - Experimental on v3.0 maxFlowMinCost_Cost(Combinations) - Experimental on v3.2 maxFlowMinCost_Cost(Many to Many) - Experimental on v3.0 maxFlowMinCost_Cost(Many to One) - Experimental on v3.0 maxFlowMinCost_Cost(One to Many) - Experimental on v3.0 maxFlowMinCost_Cost(One to One) - Experimental on v3.0 MaximumCardinalityMatch P pgr_degree - Proposed on v3.4 pgr_extractVertices - Proposed on v3.3 pgr_nodeNetwork pgr_pickDeliver - Experimental on v3.0 pgr_pickDeliverEuclidean - Experimental on 3.0 prim primBFS(Multiple vertices) primBFS(Single vertex) primDD(Multiple vertices) primDD(Single vertex) primDFS(Multiple vertices) primDFS(Single vertex) pushRelabel(Combinations) - Proposed on v3.2 pushRelabel(Many to Many) pushRelabel(Many to One) pushRelabel(One to Many) pushRelabel(One to One) S sequentialVertexColoring - Proposed on v3.3 stoerWagner - Experimental on v3.0 strongComponents T topologicalSort - Experimental on v3.0 transitiveClosure - Experimental on v3.0 trsp(Combinations) - Proposed on v3.4 trsp(Many to Many) -- Proposed on v3.4 trsp(Many to One) -- Proposed on v3.4 trsp(One to Many) -- Proposed on v3.4 trsp(One to One) -- Proposed on v3.4 trsp_withPoints(Combinations) - Proposed on v3.4 trsp_withPoints(Many to Many) - Proposed on v3.4 trsp_withPoints(Many to One) - Proposed on v3.4 trsp_withPoints(One to Many) - Proposed on v3.4 trsp_withPoints(One to One) - Proposed on v3.4 trspVia - Proposed on v3.4 trspVia_withPoints - Proposed on v3.4 TSP TSPeuclidean turnRestrictedPath - Experimental on v3.0 V version W withPoints(Combinations) - Proposed on v3.2 withPoints(Many to Many) - Proposed on v2.2 withPoints(Many to One) - Proposed on v2.2 withPoints(One to Many) - Proposed on v2.2 withPoints(One to One) - Proposed on v2.2 withPointsCost(Combinations) -- Proposed on v3.2 withPointsCost(Many To Many) - Proposed on v2.2 withPointsCost(Many To One) - Proposed on v2.2 withPointsCost(One To Many) - Proposed on v2.2 withPointsCost(One To One) - Proposed on v2.2 withPointsCostMatrix - proposed withPointsDD(Multiple Vertices) - Proposed on v2.2 withPointsDD(Single Vertex) - Proposed on v2.2 withPointsKSP - Proposed on v2.2 withPointsVia - Proposed on v3.4 Contents