Uses of Class
oracle.pgx.api.EdgeSequence

Packages that use EdgeSequence

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

Uses of EdgeSequence in oracle.pgx.api

Methods in oracle.pgx.api that return EdgeSequence

Modifier and Type	Method and Description
EdgeSequence	PgxGraph.createEdgeSequence() Blocking version of PgxGraph.createEdgeSequenceAsync().
EdgeSequence	PgxGraph.createEdgeSequence(java.lang.String name) Blocking version of PgxGraph.createEdgeSequenceAsync(String).

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

Modifier and Type	Method and Description
PgxFuture<EdgeSequence>	PgxGraph.createEdgeSequenceAsync() Creates a new edge sequence.
PgxFuture<EdgeSequence>	PgxGraph.createEdgeSequenceAsync(java.lang.String name) Creates a new edge sequence.
<ID> org.apache.commons.lang3.tuple.Triple<ScalarSequence<java.lang.Integer>,VertexSequence<ID>,EdgeSequence>	Analyst.enumerateSimplePaths(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int k, VertexSet verticesOnPath, EdgeSet edgesOnPath, PgxMap<PgxVertex<ID>,java.lang.Integer> dist) Enumerate all simple paths between the source and destination vertex
<ID> PgxFuture<org.apache.commons.lang3.tuple.Triple<ScalarSequence<java.lang.Integer>,VertexSequence<ID>,EdgeSequence>>	Analyst.enumerateSimplePathsAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int k, VertexSet verticesOnPath, EdgeSet edgesOnPath, PgxMap<PgxVertex<ID>,java.lang.Integer> dist) Enumerate all simple paths between the source and destination vertex
<ID> Pair<VertexSequence<ID>,EdgeSequence>	Analyst.limitedShortestPathHopDist(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int maxHops, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index) Computes the k-hop limited shortest path between two vertices.
<ID> Pair<VertexSequence<ID>,EdgeSequence>	Analyst.limitedShortestPathHopDist(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int maxHops, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index, VertexSequence<ID> pathVertices, EdgeSequence pathEdges) Computes the k-hop limited shortest path between two vertices.
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>>	Analyst.limitedShortestPathHopDistAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int maxHops, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index) Computes the k-hop limited shortest path between two vertices.
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>>	Analyst.limitedShortestPathHopDistAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int maxHops, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index, VertexSequence<ID> pathVertices, EdgeSequence pathEdges) Computes the k-hop limited shortest path between two vertices.
<ID> Pair<VertexSequence<ID>,EdgeSequence>	Analyst.limitedShortestPathHopDistFiltered(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int maxHops, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index, EdgeFilter filter) Computes the k-hop limited shortest path between two vertices.
<ID> Pair<VertexSequence<ID>,EdgeSequence>	Analyst.limitedShortestPathHopDistFiltered(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int maxHops, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index, EdgeFilter filter, VertexSequence<ID> pathVertices, EdgeSequence pathEdges) Computes the k-hop limited shortest path between two vertices.
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>>	Analyst.limitedShortestPathHopDistFilteredAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int maxHops, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index, EdgeFilter filter) Computes the k-hop limited shortest path between two vertices.
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>>	Analyst.limitedShortestPathHopDistFilteredAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int maxHops, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index, EdgeFilter filter, VertexSequence<ID> pathVertices, EdgeSequence pathEdges) Computes the k-hop limited shortest path between two vertices.

Methods in oracle.pgx.api with parameters of type EdgeSequence

Modifier and Type	Method and Description
<ID> PgxFuture<PgxPath<ID>>	PgxGraph.createPathAsync(VertexSequence<ID> nodeSequence, EdgeSequence edgeSequence) Creates a PgxPath object from a sequence of vertices and edges.
<ID> PgxPath<ID>	Analyst.findCycle(PgxGraph graph, PgxVertex<ID> src, VertexSequence<ID> nodeSeq, EdgeSequence edgeSeq) Find cycle looks for any loop in the graph.
<ID> PgxPath<ID>	Analyst.findCycle(PgxGraph graph, VertexSequence<ID> nodeSeq, EdgeSequence edgeSeq) Find cycle looks for any loop in the graph.
<ID> PgxFuture<PgxPath<ID>>	Analyst.findCycleAsync(PgxGraph graph, PgxVertex<ID> src, VertexSequence<ID> nodeSeq, EdgeSequence edgeSeq) Find cycle looks for any loop in the graph.
<ID> PgxFuture<PgxPath<ID>>	Analyst.findCycleAsync(PgxGraph graph, VertexSequence<ID> nodeSeq, EdgeSequence edgeSeq) Find cycle looks for any loop in the graph.
<ID> Pair<VertexSequence<ID>,EdgeSequence>	Analyst.limitedShortestPathHopDist(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int maxHops, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index, VertexSequence<ID> pathVertices, EdgeSequence pathEdges) Computes the k-hop limited shortest path between two vertices.
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>>	Analyst.limitedShortestPathHopDistAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int maxHops, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index, VertexSequence<ID> pathVertices, EdgeSequence pathEdges) Computes the k-hop limited shortest path between two vertices.
<ID> Pair<VertexSequence<ID>,EdgeSequence>	Analyst.limitedShortestPathHopDistFiltered(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int maxHops, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index, EdgeFilter filter, VertexSequence<ID> pathVertices, EdgeSequence pathEdges) Computes the k-hop limited shortest path between two vertices.
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>>	Analyst.limitedShortestPathHopDistFilteredAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int maxHops, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index, EdgeFilter filter, VertexSequence<ID> pathVertices, EdgeSequence pathEdges) Computes the k-hop limited shortest path between two vertices.