Uses of Class
oracle.pgx.common.Pair

Packages that use Pair

Package	Description
oracle.pgx.api	This package contains the main Java APIs.
oracle.pgx.common	This package contains APIs and classes shared by all sub-components of PGX.

Uses of Pair in oracle.pgx.api

Methods in oracle.pgx.api that return Pair

Modifier and Type	Method	Description
<ID> Pair<PgxMap<java.lang.Integer,PgxVertex<ID>>,VertexSet<ID>>	Analyst.computeHighDegreeVertices(PgxGraph graph, int k)	Computes the k vertices with the highest degrees in the graph.
<ID> Pair<PgxMap<java.lang.Integer,PgxVertex<ID>>,VertexSet<ID>>	Analyst.computeHighDegreeVertices(PgxGraph graph, int k, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices)	Computes the k vertices with the highest degrees in the graph.
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>	Analyst.diameter(PgxGraph graph)	Diameter/radius gives an overview of the distances in a graph
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>	Analyst.diameter(PgxGraph graph, Scalar<java.lang.Integer> diameter, VertexProperty<ID,java.lang.Integer> eccentricity)	Diameter/radius gives an overview of the distances in a graph
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, ID root)	Convenience wrapper around Analyst.filteredBfs(PgxGraph, PgxVertex) taking a vertex ID instead of PgxVertex.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, ID root, int maxDepth)	Convenience wrapper around Analyst.filteredBfs(PgxGraph, PgxVertex, int) taking a vertex ID instead of PgxVertex.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, int maxDepth)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, int maxDepth)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, int maxDepth, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, int maxDepth)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredDfs(PgxGraph graph, ID root)	Convenience wrapper around Analyst.filteredDfs(PgxGraph, PgxVertex) taking a vertex ID instead of PgxVertex.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredDfs(PgxGraph graph, ID root, int maxDepth)	Convenience wrapper around Analyst.filteredDfs(PgxGraph, PgxVertex, int) taking a vertex ID instead of PgxVertex.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredDfs(PgxGraph graph, PgxVertex<ID> root)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredDfs(PgxGraph graph, PgxVertex<ID> root, int maxDepth)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredDfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredDfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredDfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, int maxDepth)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredDfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, int maxDepth, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredDfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredDfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, int maxDepth)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<PgxVertex<ID>,PgxVertex<ID>>	PgxEdge.getVertices()	Blocking version of PgxEdge.getVerticesAsync().
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>	Analyst.hits(PgxGraph graph)	HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>	Analyst.hits(PgxGraph graph, int max)	HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>	Analyst.hits(PgxGraph graph, int max, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)	HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>	Analyst.hits(PgxGraph graph, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)	HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>	Analyst.kcore(PgxGraph graph)	k-core decomposes a graph into layers revealing subgraphs with particular properties
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>	Analyst.kcore(PgxGraph graph, int minCore, int maxCore)	k-core decomposes a graph into layers revealing subgraphs with particular properties
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>	Analyst.kcore(PgxGraph graph, int minCore, int maxCore, Scalar<java.lang.Long> maxKCore, VertexProperty<ID,java.lang.Long> kcore)	k-core decomposes a graph into layers revealing subgraphs with particular properties
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>	Analyst.kcore(PgxGraph graph, Scalar<java.lang.Long> maxKCore, VertexProperty<ID,java.lang.Long> kcore)	k-core decomposes a graph into layers revealing subgraphs with particular properties
<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> 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> Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>>	Analyst.partitionConductance(PgxGraph graph, Partition<ID> partition)	Partition conductance assesses the quality of many partitions in a graph
<ID> Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>>	Analyst.partitionConductance(PgxGraph graph, Partition<ID> partition, Scalar<java.lang.Double> avgConductance, Scalar<java.lang.Double> minConductance)	Partition conductance assesses the quality of many partitions in a graph
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>	Analyst.radius(PgxGraph graph)	Diameter/radius gives an overview of the distances in a graph
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>	Analyst.radius(PgxGraph graph, Scalar<java.lang.Integer> radius, VertexProperty<ID,java.lang.Integer> eccentricity)	Diameter/radius gives an overview of the distances in a graph
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, ID vertexId, int topK)	Convenience wrapper around Analyst.whomToFollow(PgxGraph, PgxVertex, int) taking a vertex ID instead of a PgxVertex.
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, ID vertexId, int topK, int sizeCircleOfTrust)	Convenience wrapper around Analyst.whomToFollow(PgxGraph, PgxVertex, int, int) taking a vertex ID instead of a PgxVertex.
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, ID vertexId, int topK, int sizeCircleOfTrust, int maxIter, java.math.BigDecimal tol, java.math.BigDecimal dampingFactor, int salsaMaxIter, java.math.BigDecimal salsaTol)	Convenience wrapper around Analyst.whomToFollow(PgxGraph, PgxVertex, int, int, int, BigDecimal, BigDecimal, int, BigDecimal) taking a vertex ID instead of a PgxVertex.
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, ID vertexId, int topK, int sizeCircleOfTrust, int maxIter, java.math.BigDecimal tol, java.math.BigDecimal dampingFactor, int salsaMaxIter, java.math.BigDecimal salsaTol, VertexSequence<ID> hubs, VertexSequence<ID> authorities)	Convenience wrapper around Analyst.whomToFollow(PgxGraph, PgxVertex, int, int, int, BigDecimal, BigDecimal, int, BigDecimal, VertexSequence, VertexSequence) taking a vertex ID instead of a PgxVertex.
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, PgxVertex<ID> vertex)	WTF is a recommendation algorithm.
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int topK)	WTF is a recommendation algorithm.
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int topK, int sizeCircleOfTrust)	WTF is a recommendation algorithm.
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int topK, int sizeCircleOfTrust, int maxIter, double tol, double dampingFactor, int salsaMaxIter, double salsaTol)	WTF is a recommendation algorithm.
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int topK, int sizeCircleOfTrust, int maxIter, double tol, double dampingFactor, int salsaMaxIter, double salsaTol, VertexSequence<ID> hubs, VertexSequence<ID> authorities)	WTF is a recommendation algorithm.
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int topK, int sizeCircleOfTrust, VertexSequence<ID> hubs, VertexSequence<ID> authorities)	WTF is a recommendation algorithm.
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int topK, VertexSequence<ID> hubs, VertexSequence<ID> authorities)	WTF is a recommendation algorithm.
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, VertexSequence<ID> hubs, VertexSequence<ID> authorities)	WTF is a recommendation algorithm.

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

Modifier and Type	Method	Description
<ID> PgxFuture<Pair<PgxMap<java.lang.Integer,PgxVertex<ID>>,VertexSet<ID>>>	Analyst.computeHighDegreeVerticesAsync(PgxGraph graph, int k)	Computes the k vertices with the highest degrees in the graph.
<ID> PgxFuture<Pair<PgxMap<java.lang.Integer,PgxVertex<ID>>,VertexSet<ID>>>	Analyst.computeHighDegreeVerticesAsync(PgxGraph graph, int k, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices)	Computes the k vertices with the highest degrees in the graph.
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>>	Analyst.diameterAsync(PgxGraph graph)	Diameter/radius gives an overview of the distances in a graph
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>>	Analyst.diameterAsync(PgxGraph graph, Scalar<java.lang.Integer> diameter, VertexProperty<ID,java.lang.Integer> eccentricity)	Diameter/radius gives an overview of the distances in a graph
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, int maxDepth)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, int maxDepth)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, int maxDepth, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, int maxDepth)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root, int maxDepth)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, int maxDepth)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, int maxDepth, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, int maxDepth)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<PgxVertex<ID>,PgxVertex<ID>>>	PgxEdge.getVerticesAsync()	Gets both vertices of this edge as a pair.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>>	Analyst.hitsAsync(PgxGraph graph)	HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>>	Analyst.hitsAsync(PgxGraph graph, int max)	HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>>	Analyst.hitsAsync(PgxGraph graph, int max, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)	HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>>	Analyst.hitsAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)	HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>>	Analyst.kcoreAsync(PgxGraph graph)	k-core decomposes a graph into layers revealing subgraphs with particular properties
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>>	Analyst.kcoreAsync(PgxGraph graph, int minCore, int maxCore)	k-core decomposes a graph into layers revealing subgraphs with particular properties
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>>	Analyst.kcoreAsync(PgxGraph graph, int minCore, int maxCore, Scalar<java.lang.Long> maxKCore, VertexProperty<ID,java.lang.Long> kcore)	k-core decomposes a graph into layers revealing subgraphs with particular properties
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>>	Analyst.kcoreAsync(PgxGraph graph, Scalar<java.lang.Long> maxKCore, VertexProperty<ID,java.lang.Long> kcore)	k-core decomposes a graph into layers revealing subgraphs with particular properties
<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> 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.
<ID> PgxFuture<Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>>>	Analyst.partitionConductanceAsync(PgxGraph graph, Partition<ID> partition)	Partition conductance assesses the quality of many partitions in a graph
<ID> PgxFuture<Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>>>	Analyst.partitionConductanceAsync(PgxGraph graph, Partition<ID> partition, Scalar<java.lang.Double> avgConductance, Scalar<java.lang.Double> minConductance)	Partition conductance assesses the quality of many partitions in a graph
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>>	Analyst.radiusAsync(PgxGraph graph)	Diameter/radius gives an overview of the distances in a graph
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>>	Analyst.radiusAsync(PgxGraph graph, Scalar<java.lang.Integer> radius, VertexProperty<ID,java.lang.Integer> eccentricity)	Diameter/radius gives an overview of the distances in a graph
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex)	WTF is a recommendation algorithm.
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int topK)	WTF is a recommendation algorithm.
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int topK, int sizeCircleOfTrust)	WTF is a recommendation algorithm.
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int topK, int sizeCircleOfTrust, int maxIter, double tol, double dampingFactor, int salsaMaxIter, double salsaTol)	WTF is a recommendation algorithm.
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int topK, int sizeCircleOfTrust, int maxIter, double tol, double dampingFactor, int salsaMaxIter, double salsaTol, VertexSequence<ID> hubs, VertexSequence<ID> authorities)	WTF is a recommendation algorithm.
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int topK, int sizeCircleOfTrust, VertexSequence<ID> hubs, VertexSequence<ID> authorities)	WTF is a recommendation algorithm.
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int topK, VertexSequence<ID> hubs, VertexSequence<ID> authorities)	WTF is a recommendation algorithm.
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, VertexSequence<ID> hubs, VertexSequence<ID> authorities)	WTF is a recommendation algorithm.

Uses of Pair in oracle.pgx.common

Methods in oracle.pgx.common that return Pair

Modifier and Type	Method	Description
static <A,B> Pair<A,B>	Pair.of(A a, B b)