Navigation :

Table of Contents - pgRouting Manual (2.5) > Index - pgRouting Manual (2.5)

Index - pgRouting Manual (2.5)

Index

A B C D E F G J K L M P S T V W

A

analyzeGraph(Complete Signature)
analyzeOneway(Complete Signature)
articulationPoints
aStar(Many to Many) -- Proposed
aStar(Many to One) -- Proposed
aStar(Minimal Use) -- New Signature
astar(One to Many) -- Proposed
aStar(One to One) -- New Signature

aStarCost(Many to Many) -- Proposed
aStarCost(Many to One) -- Proposed
aStarCost(Minimal Signature) -- Proposed
aStarCost(One to Many) -- Proposed
aStarCost(One to One) -- Proposed
aStarCostMatrix(Complete Signature) - Proposed
aStarCostMatrix(Minimal Use) - Proposed

B

bdAstar(Many to Many) - Proposed
bdAstar(Many to One) - Proposed
bdAstar(Minimal Use) -- New Signature
bdAstar(One to Many) - Proposed
bdAstar(One to One) -- New Signature
bdAstarCost(Many to Many) - Proposed
bdAstarCost(Many to One) - Proposed
bdAstarCost(Minimal Use) -- New Signature
bdAstarCost(One to Many) - Proposed
bdAstarCost(One to One) -- New Signature
bdAstarCostMatrix(Complete Signature) - Proposed
bdAstarCostMatrix(Minimal Use) - Proposed
bdDijkstra(Many to Many) - Proposed
bdDijkstra(Many to One) - Proposed
bdDijkstra(Minimal Use)

bdDijkstra(One to Many) - Proposed
bdDijkstra(One to One)
bdDijkstraCost(Many to Many) - Proposed
bdDijkstraCost(Many to One) - Proposed
bdDijkstraCost(Minimal Use) - Proposed
bdDijkstraCost(One to Many) - Proposed
bdDijkstraCost(One to One)
bdDijkstraCostMatrix(Complete Signature) - Proposed
bdDijkstraCostMatrix(Minimal Use) - Proposed
biconnectedComponents
boykovKolmogorov(Many to Many) - Proposed
boykovKolmogorov(Many to One) - Proposed
boykovKolmogorov(One to Many) - Proposed
boykovKolmogorov(One to One) - Proposed
bridges

C

connectedComponents
contractGraph(Minimal Use)

createTopology(Complete Signature)
createVerticesTable(Complete Signature)

D

dijkstra(Many to Many)
dijkstra(Many to One)
dijkstra(Minimal Use)
dijkstra(One to Many)
dijkstra(One to One)
dijkstraCost(Many to Many)
dijkstraCost(Many to One)
dijkstraCost(Minimal Use)
dijkstraCost(One to Many)

dijkstraCost(One to One)
dijkstraCostMatrix(Complete Signature) - Proposed
dijkstraCostMatrix(Minimal Use) - Proposed
dijkstraVia(Full signature) - proposed
dijkstraVia(Minimal Use) - proposed
drivingDistance(Minimal Use)
drivingDistance(Multiple Starting Vertices)
drivingDistance(Single Start Vertex)

E

edgeDisjointPaths(Many to Many) - Proposed
edgeDisjointPaths(Many to One) - Proposed
edgeDisjointPaths(Minimal Use) - Proposed
edgeDisjointPaths(One to Many) - Proposed
edgeDisjointPaths(One to One) - Proposed
edmondsKarp(Many to Many) - Proposed

edmondsKarp(Many to One) - Proposed
edmondsKarp(One to Many) - Proposed
edmondsKarp(One to One) - Proposed
eucledianTSP(Basic Use)
eucledianTSP(Complete Signature)

F

floydWarshall(Complete Signature)

floydWarshall(Minimal Signature)

G

gsoc_vrppdtw(Complete Signature) - proposed

J

johnson(Complete Signature)

johnson(Minimal Signature)

K

ksp(Complete Signature)

KSP(Minimal Signature)

L

labelGraph(Complete Signature) - Proposed
lineGraph(Complete signature)

lineGraph(Minimal Use)

M

maxFlow(Many to Many) - Proposed
maxFlow(Many to One) - Proposed
maxFlow(One to Many) - Proposed

maxFlow(One to One) - Proposed
MaximumCardinalityMatching(Complete Signature) - Proposed
MaximumCardinalityMatching(Minimal Use) - Proposed

P

pgr_alphashape(text,float8)
pgr_costResult3[]
pgr_costResult[]
pgr_geomResult[]
pgr_NodeNetwork(Complete Signature)

pgr_pointsAsPolygon(text,float8)
pushRelabel(Many to Many) - Proposed
pushRelabel(Many to One) - Proposed
pushRelabel(One to Many) - Proposed
pushRelabel(One to One) - Proposed

S

strongComponents

T

trsp(text,integer,integer,boolean,boolean)
trsp(text,integer,integer,boolean,boolean,text)
trspViaEdges(text,integer,double precision,integer,double precision,boolean,boolean,text)

trspViaVertices(text,integer,double precision,integer,double precision,boolean,boolean)
TSP(Basic Use)
TSP(Complete Signature)

V

version()

W

withPoints(Many to Many) - Proposed
withPoints(Many to One) - Proposed
withPoints(Minimal Use) - Proposed
withPoints(One to Many) - Proposed
withPoints(One to One) - Proposed
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(Complete Signature) - Proposed
withPointsCostMatrix(Minimal use) - Proposed
withPointsDD(Minimal Use) - proposed
withPointsDD(Multiple Starting Vertices) - proposed
withPointsDD(Single Start Vertex) - proposed
withPointsKSP(Complete Signature) - Proposed
withPointsKSP(Minimal Signature) - Proposed