Navigation : Table of Contents - pgRouting Manual (3.2) > Index - pgRouting Manual (3.2) Index - pgRouting Manual (3.2) Contents Index A B C D E F I K L M P S T V W A alphaShape analyzeGraph articulationPoints aStar(Combinations) -- Proposed on v3.2 aStar(Many to Many) aStar(Many to One) astar(One to Many) aStar(One to One) aStarCost(Combinations) -- Proposed on v3.2 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(Minimal Use) bellman_ford(Many to One) - Experimental bellman_ford(One to One) - Experimental bellmanFord(Combinations) -- Experimental on v3.2 bellmanFord(Many to Many) - Experimental bellmanFord(One to Many) - Experimental biconnectedComponents binaryBreadthFirstSearch(Combinations) -- Experimental on v3.2 binaryBreadthFirstSearch(Many to Many) - Experimental binaryBreadthFirstSearch(Many to One) - Experimental binaryBreadthFirstSearch(One to Many) - Experimental binaryBreadthFirstSearch(One to One) - Experimental bipartite (Single Vertex) - 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 breadthFirstSearch(Single vertex) - Experimental bridges C chinesePostman - Experimental chinesePostmanCost - Experimental connectedComponents contraction D dagShortestPath(Combinations) -- Experimental on v3.2 dagShortestPath(Many to Many) - Experimental dagShortestPath(Many to One) - Experimental dagShortestPath(One to Many) - Experimental dagShortestPath(One to One) - Experimental depthFirstSearch(Multiple vertices) -- Experimental on v3.2 depthFirstSearch(Single vertex) -- Experimental on v3.2 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) - Experimental dijkstraNear(Many to Many) - Experimental dijkstraNear(Many to One) - Experimental dijkstraNear(One to Many) - Experimental dijkstraNearCost(Combinations) - Experimental dijkstraNearCost(Many to Many) - Experimental dijkstraNearCost(Many to One) - Experimental dijkstraNearCost(One to Many) - Experimental dijkstraVia - Proposed drivingDistance(Multiple Starting Vertices) drivingDistance(Single Start Vertex) E 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 edwardMoore(Many to One) - Experimental edwardMoore(One to Many) - Experimental edwardMoore(One to One) - Experimental F full_version I isPlanar(Edges SQL) -- Experimental on v3.2 K kruskal kruskalBFS(Multiple vertices) kruskalBFS(Single vertex) kruskalDD(Multiple vertices) kruskalDD(Single vertex) kruskalDFS(Multiple vertices) kruskalDFS(Single vertex) KSP L lineGraph(Complete signature) M 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 maxFlowMinCost(Many to One) - Experimental maxFlowMinCost(One to Many) - Experimental maxFlowMinCost(One to One) - Experimental maxFlowMinCost_Cost(Combinations) -- Experimental on v3.2 maxFlowMinCost_Cost(Many to Many) - Experimental maxFlowMinCost_Cost(Many to One) - Experimental maxFlowMinCost_Cost(One to Many) - Experimental maxFlowMinCost_Cost(One to One) - Experimental MaximumCardinalityMatch P pgr_extractVertices -- Experimental pgr_lengauerTarjanDominatorTree pgr_nodeNetwork pgr_pickDeliver - Experimental pgr_pickDeliverEuclidean - Experimental 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 -- Experimental on v3.2 stoerWagner - Experimental strongComponents T transitiveClosure trsp(text,integer,integer,boolean,boolean) trsp(text,integer,integer,boolean,boolean,text) trspViaEdges - Prototype trspViaVertices - Prototype TSP TSPeuclidean V version W withPoints(Combinations) -- Proposed on v3.2 withPoints(Many to Many) - Proposed withPoints(Many to One) - Proposed withPoints(One to Many) - Proposed withPoints(One to One) - Proposed withPointsCost(Combinations) -- Proposed on v3.2 withPointsCost(Many To Many) - proposed withPointsCost(Many To One) - proposed withPointsCost(Minimal Use) - proposed withPointsCost(One To Many) - proposed withPointsCost(One To One) - proposed withPointsCostMatrix - Proposed withPointsDD(Multiple Starting Vertices) - proposed withPointsDD(Single Start Vertex) - proposed Contents
