Uses of Class
oracle.pgx.api.PgxPath

Packages that use PgxPath

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

Uses of PgxPath in oracle.pgx.api

Methods in oracle.pgx.api that return PgxPath

Modifier and Type	Method and Description
<ID extends Comparable<ID>> PgxPath<ID>	PgxGraph.createPath(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Blocking version of #createPathAsync().
PgxPath<ID>	AllPaths.getPath(PgxVertex<ID> destination) Gets the path.
<ID extends Comparable<ID>> PgxPath<ID>	Analyst.shortestPathDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<Double> cost) Convenience wrapper around Analyst.shortestPathDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty) taking vertex IDs instead of PgxVertex.
<ID extends Comparable<ID>> PgxPath<ID>	Analyst.shortestPathDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost) Blocking version of #shortestPathDijkstraAsync().
<ID extends Comparable<ID>> PgxPath<ID>	Analyst.shortestPathDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<Double> cost) Convenience wrapper around Analyst.shortestPathDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty) taking vertex IDs instead of PgxVertex.
<ID extends Comparable<ID>> PgxPath<ID>	Analyst.shortestPathDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost) Blocking version of #shortestPathDijkstraBidirectionalAsync().
<ID extends Comparable<ID>> PgxPath<ID>	Analyst.shortestPathFilteredDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<Double> cost, GraphFilter filterExpr) Convenience wrapper around Analyst.shortestPathFilteredDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter) taking vertex IDs instead of PgxVertex.
<ID extends Comparable<ID>> PgxPath<ID>	Analyst.shortestPathFilteredDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr) Blocking version of #shortestPathFilteredDijkstraAsync().
<ID extends Comparable<ID>> PgxPath<ID>	Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<Double> cost, GraphFilter filterExpr) Convenience wrapper around Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter) taking vertex IDs instead of PgxVertex.
<ID extends Comparable<ID>> PgxPath<ID>	Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr) Blocking version of #shortestPathFilteredDijkstraBidirectionalAsync().

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

Modifier and Type	Method and Description
<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>	PgxGraph.createPathAsync(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Creates a PgxPath object representing the shortest path from one source to one destination (shortest regarding the given edge costs).
<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost) Compute shortest path using Dijkstra's algorithm.
<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost) Compute shortest path using a bi-directional Dijkstra variant.
<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr) Compute shortest path using Dijkstra's algorithm on a filtered graph The filter specified by the given filter expression is applied on each edge during traversal of the graph.
<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr) Compute shortest path using a bi-directional Dijkstra variant on a filtered graph.