Uses of Class
oracle.pgx.api.AllPaths

Packages that use AllPaths

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

Uses of AllPaths in oracle.pgx.api

Methods in oracle.pgx.api that return AllPaths

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

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

Modifier and Type	Method and Description
<ID> PgxFuture<AllPaths<ID>>	PgxGraph.createAllPathsAsync(PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> dist, 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> PgxFuture<AllPaths<ID>>	Analyst.fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity) Fattest Tree Algorithm - Computes the fattest path from a source vertex to all vertices in the graph.
<ID> PgxFuture<AllPaths<ID>>	Analyst.fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Fattest Tree Algorithm - Computes the fattest path from a source vertex to all vertices in the graph.
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.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> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) 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> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.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> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) 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> 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> PgxFuture<AllPaths<ID>>	Analyst.shortestPathHopDistAsync(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) 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> 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
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathHopDistReverseAsync(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) 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