Index

A

analyzeGraph(Complete Signature)

analyzeOneway(Complete Signature)

B

bdAstar(Complete Signaature)

bdDijkstra(Complete Signature)

C

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 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

M

maxFlowBoykovKolmogorov(Many to Many) - Proposed maxFlowBoykovKolmogorov(Many to One) - Proposed maxFlowBoykovKolmogorov(One to Many) - Proposed maxFlowBoykovKolmogorov(One to One) - Proposed maxFlowEdmondsKarp(Many to Many) - Proposed maxFlowEdmondsKarp(Many to One) - Proposed maxFlowEdmondsKarp(One to Many) - Proposed

maxFlowEdmondsKarp(One to One) - Proposed maxFlowPushRelabel(Many to Many) - Proposed maxFlowPushRelabel(Many to One) - Proposed maxFlowPushRelabel(One to Many) - Proposed maxFlowPushRelabel(One to One) - Proposed MaximumCardinalityMatching(Complete Signature) - Proposed MaximumCardinalityMatching(Minimal Use) - Proposed

P

pgr_alphashape(text,float8) pgr_aStar(Complete Singature) pgr_aStar(Minimal Signature) pgr_costResult3[] pgr_costResult[]

pgr_geomResult[] pgr_NodeNetwork(Complete Signature) pgr_pointsAsPolygon(text,float8) pointsToVids(Complete Signature) --proposed pointToEdgeNode(Complete Signature) --proposed

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) -- New Signature TSP(Complete Signature) -- New 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