Uses of Class
oracle.pgx.api.VertexSequence

Packages that use VertexSequence

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

Uses of VertexSequence in oracle.pgx.api

Methods in oracle.pgx.api that return VertexSequence

Modifier and Type	Method	Description
<E> VertexSequence<E>	PgxGraph.createVertexSequence()	Blocking version of PgxGraph.createVertexSequenceAsync().
<E> VertexSequence<E>	PgxGraph.createVertexSequence(java.lang.String name)	Blocking version of PgxGraph.createVertexSequenceAsync(String).

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

Modifier and Type	Method	Description
<E> PgxFuture<VertexSequence<E>>	PgxGraph.createVertexSequenceAsync()	Creates a new vertex sequence.
<E> PgxFuture<VertexSequence<E>>	PgxGraph.createVertexSequenceAsync(java.lang.String name)	Creates a new vertex 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.
<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)	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)	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)	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, 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)	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)	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)	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)	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, 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, 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, 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.
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, 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)	WTF is a recommendation algorithm.
<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)	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)	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)	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, 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, 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, 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.
<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.

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

Modifier and Type	Method	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.
<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, 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.
<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.