Uses of Class
oracle.pgx.api.AllPaths

Packages that use AllPaths

Package	Description
oracle.pgx.api	This package contains the Java APIs of PGX.

Uses of AllPaths in oracle.pgx.api

Methods in oracle.pgx.api that return AllPaths

Modifier and Type	Method and Description
<ID extends Comparable<ID>> AllPaths<ID>	PgxGraph.createAllPaths(PgxVertex<ID> src, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Blocking version of #createAllPathsAsync().
<ID extends Comparable<ID>> AllPaths<ID>	Analyst.fattestPath(PgxGraph graph, ID rootId, EdgeProperty<Double> capacity) Convenience wrapper around Analyst.fattestPath(PgxGraph, PgxVertex, EdgeProperty) taking a vertex ID instead of a PgxVertex.
<ID extends Comparable<ID>> AllPaths<ID>	Analyst.fattestPath(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<Double> capacity) Blocking version of #fattestPathAsync().
<ID extends Comparable<ID>> AllPaths<ID>	Analyst.shortestPathBellmanFord(PgxGraph graph, ID srcId, EdgeProperty<Double> cost) Convenience wrapper around Analyst.shortestPathBellmanFord(PgxGraph, PgxVertex, EdgeProperty) taking a vertex ID instead of PgxVertex.
<ID extends Comparable<ID>> AllPaths<ID>	Analyst.shortestPathBellmanFord(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<Double> cost) Blocking version of #shortestPathBellmanFordAsync().
<ID extends Comparable<ID>> AllPaths<ID>	Analyst.shortestPathBellmanFordReverse(PgxGraph graph, ID srcId, EdgeProperty<Double> cost) Convenience wrapper around Analyst.shortestPathBellmanFordReverse(PgxGraph, PgxVertex, EdgeProperty) taking a vertex ID instead of PgxVertex.
<ID extends Comparable<ID>> AllPaths<ID>	Analyst.shortestPathBellmanFordReverse(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<Double> cost) Blocking version of #shortestPathBellmanFordReverseAsync().
<ID extends Comparable<ID>> AllPaths<ID>	Analyst.shortestPathHopDist(PgxGraph graph, ID srcId) Convenience wrapper around Analyst.shortestPathHopDist(PgxGraph, PgxVertex) taking a vertex ID instead of PgxVertex.
<ID extends Comparable<ID>> AllPaths<ID>	Analyst.shortestPathHopDist(PgxGraph graph, PgxVertex<ID> src) Blocking version of #shortestPathHopDistAsync().
<ID extends Comparable<ID>> AllPaths<ID>	Analyst.shortestPathHopDistReverse(PgxGraph graph, ID srcId) Convenience wrapper around Analyst.shortestPathHopDistReverse(PgxGraph, PgxVertex) taking a vertex ID instead of PgxVertex.
<ID extends Comparable<ID>> AllPaths<ID>	Analyst.shortestPathHopDistReverse(PgxGraph graph, PgxVertex<ID> src) Blocking version of #shortestPathHopDistReverseAsync().

Methods in oracle.pgx.api that return types with arguments of type AllPaths

Modifier and Type	Method and Description
<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>	PgxGraph.createAllPathsAsync(PgxVertex<ID> src, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Creates a AllPaths object representing all the shortest paths from a single source to all the possible destinations (shortest regarding the given edge costs).
<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>	Analyst.fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<Double> capacity) Fattest Tree Algorithm - Computes the fattest path from a source vertex to all vertices in the graph.
<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<Double> cost) Compute single source shortest paths using Bellman & Ford algorithm time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length
<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<Double> cost) Compute reverse single source shortest paths using Bellman & Ford algorithm time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length
<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>	Analyst.shortestPathHopDistAsync(PgxGraph graph, PgxVertex<ID> src) Compute hop-distance from given vertex to every other vertex time complexity: O(E * d) with E = number of edges, d = diameter of graph
<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>	Analyst.shortestPathHopDistReverseAsync(PgxGraph graph, PgxVertex<ID> src) Compute reverse hop-distance from given vertex to every other vertex time complexity: O(E * d) with E = number of edges, d = diameter of graph