Uses of Class
oracle.pgx.api.VertexSet

Packages that use VertexSet

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

Uses of VertexSet in oracle.pgx.api

Methods in oracle.pgx.api that return VertexSet

Modifier and Type	Method and Description
<ID> VertexSet<ID>	Analyst.center(PgxGraph graph) Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
<ID> VertexSet<ID>	Analyst.center(PgxGraph graph, VertexSet<ID> center) Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
<E> VertexSet<E>	PgxGraph.createVertexSet() Blocking version of PgxGraph.createVertexSetAsync().
<E> VertexSet<E>	PgxGraph.createVertexSet(java.lang.String name) Blocking version of PgxGraph.createVertexSetAsync(String).
<E> VertexSet<E>	PgxGraph.getVertices() Blocking version of PgxGraph.getVerticesAsync().
<E> VertexSet<E>	PgxGraph.getVertices(VertexFilter filter) Blocking version of PgxGraph.getVerticesAsync(VertexFilter).
<E> VertexSet<E>	PgxGraph.getVertices(VertexFilter filter, java.lang.String name) Blocking version of PgxGraph.getVerticesAsync(VertexFilter, String).
<ID> VertexSet<ID>	Analyst.periphery(PgxGraph graph) Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
<ID> VertexSet<ID>	Analyst.periphery(PgxGraph graph, VertexSet<ID> periphery) Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph

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

Modifier and Type	Method and Description
<ID> org.apache.commons.lang3.tuple.Triple<VertexSet<ID>,EdgeSet,PgxMap<PgxVertex<ID>,java.lang.Integer>>	Analyst.allReachableVerticesEdges(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int k) Finds all the vertices and edges on a path between the src and target of length smaller or equal to k.
<ID> PgxFuture<org.apache.commons.lang3.tuple.Triple<VertexSet<ID>,EdgeSet,PgxMap<PgxVertex<ID>,java.lang.Integer>>>	Analyst.allReachableVerticesEdgesAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int k) Finds all the vertices and edges on a path between the src and target of length smaller or equal to k.
<ID> org.apache.commons.lang3.tuple.Triple<VertexSet<ID>,EdgeSet,PgxMap<PgxVertex<ID>,java.lang.Integer>>	Analyst.allReachableVerticesEdgesFiltered(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int k, EdgeFilter filter) Finds all the vertices and edges on a path between the src and target of length smaller or equal to k.
<ID> PgxFuture<org.apache.commons.lang3.tuple.Triple<VertexSet<ID>,EdgeSet,PgxMap<PgxVertex<ID>,java.lang.Integer>>>	Analyst.allReachableVerticesEdgesFilteredAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int k, EdgeFilter filter) Finds all the vertices and edges on a path between the src and target of length smaller or equal to k.
<ID> PgxFuture<VertexSet<ID>>	Analyst.centerAsync(PgxGraph graph) Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
<ID> PgxFuture<VertexSet<ID>>	Analyst.centerAsync(PgxGraph graph, VertexSet<ID> center) Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
<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> 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.
<E> PgxFuture<VertexSet<E>>	PgxGraph.createVertexSetAsync() Creates a new vertex set.
<E> PgxFuture<VertexSet<E>>	PgxGraph.createVertexSetAsync(java.lang.String name) Creates a new vertex set.
<E> PgxFuture<VertexSet<E>>	PgxGraph.getVerticesAsync() Creates a new vertex set containing all vertices.
<E> PgxFuture<VertexSet<E>>	PgxGraph.getVerticesAsync(VertexFilter filter) Creates a new vertex set containing vertices according to the given filter expression.
<E> PgxFuture<VertexSet<E>>	PgxGraph.getVerticesAsync(VertexFilter filter, java.lang.String name) Creates a new vertex set containing vertices according to the given filter expression.
<ID> PgxFuture<VertexSet<ID>>	Analyst.peripheryAsync(PgxGraph graph) Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
<ID> PgxFuture<VertexSet<ID>>	Analyst.peripheryAsync(PgxGraph graph, VertexSet<ID> periphery) Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph

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

Modifier and Type	Method and Description
BipartiteGraph	PgxGraph.bipartiteSubGraphFromLeftSet(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName) Blocking version of PgxGraph.bipartiteSubGraphFromLeftSetAsync(Collection, Collection, VertexSet, String).
BipartiteGraph	PgxGraph.bipartiteSubGraphFromLeftSet(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName, java.lang.String isLeftPropName) Blocking version of PgxGraph.bipartiteSubGraphFromLeftSetAsync(Collection, Collection, VertexSet, String, String).
BipartiteGraph	PgxGraph.bipartiteSubGraphFromLeftSet(VertexSet<?> vertexSet) Blocking version of PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet).
BipartiteGraph	PgxGraph.bipartiteSubGraphFromLeftSet(VertexSet<?> vertexSet, java.lang.String newGraphName) Blocking version of PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet, String).
PgxFuture<BipartiteGraph>	PgxGraph.bipartiteSubGraphFromLeftSetAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName) Create a bipartite version of this graph with the given vertex set being the left set.
PgxFuture<BipartiteGraph>	PgxGraph.bipartiteSubGraphFromLeftSetAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName, java.lang.String isLeftPropName) Create a bipartite version of this graph with the given vertex set being the left set.
PgxFuture<BipartiteGraph>	PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet<?> vertexSet) Create a bipartite version of this graph with the given vertex set being the left set.
PgxFuture<BipartiteGraph>	PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet<?> vertexSet, java.lang.String newGraphName) Create a bipartite version of this graph with the given vertex set being the left set.
<ID> VertexSet<ID>	Analyst.center(PgxGraph graph, VertexSet<ID> center) Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
<ID> PgxFuture<VertexSet<ID>>	Analyst.centerAsync(PgxGraph graph, VertexSet<ID> center) Periphery/center gives an overview of the extreme distances and the corresponding vertices in a 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> 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> VertexProperty<ID,PgxVect<java.lang.Integer>>	Analyst.createDistanceIndex(PgxGraph graph, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices) Computes an index with distances to each high-degree vertex.
<ID> VertexProperty<ID,PgxVect<java.lang.Integer>>	Analyst.createDistanceIndex(PgxGraph graph, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index) Computes an index with distances to each high-degree vertex.
<ID> PgxFuture<VertexProperty<ID,PgxVect<java.lang.Integer>>>	Analyst.createDistanceIndexAsync(PgxGraph graph, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices) Computes an index with distances to each high-degree vertex.
<ID> PgxFuture<VertexProperty<ID,PgxVect<java.lang.Integer>>>	Analyst.createDistanceIndexAsync(PgxGraph graph, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index) Computes an index with distances to each high-degree vertex.
<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> VertexSet<ID>	Analyst.periphery(PgxGraph graph, VertexSet<ID> periphery) Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
<ID> PgxFuture<VertexSet<ID>>	Analyst.peripheryAsync(PgxGraph graph, VertexSet<ID> periphery) Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices) Personalized PageRank for a set of vertices of interest.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm) Personalized PageRank for a set of vertices of interest.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, VertexProperty<ID,java.lang.Double> rank) Personalized PageRank for a set of vertices of interest.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max) Personalized PageRank for a set of vertices of interest.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm) Personalized PageRank for a set of vertices of interest.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank) Personalized PageRank for a set of vertices of interest.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank) Personalized PageRank for a set of vertices of interest.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> rank) Personalized PageRank for a set of vertices of interest.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices) Personalized PageRank for a set of vertices of interest.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm) Personalized PageRank for a set of vertices of interest.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, VertexProperty<ID,java.lang.Double> rank) Personalized PageRank for a set of vertices of interest.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max) Personalized PageRank for a set of vertices of interest.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm) Personalized PageRank for a set of vertices of interest.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank) Personalized PageRank for a set of vertices of interest.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank) Personalized PageRank for a set of vertices of interest.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> rank) Personalized PageRank for a set of vertices of interest.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices) Personalized salsa for a set of vertices of interest.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIter, double maxDiff) Personalized salsa for a set of vertices of interest.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIter, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank) Personalized salsa for a set of vertices of interest.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> salsaRank) Personalized salsa for a set of vertices of interest.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices) Personalized salsa for a set of vertices of interest.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIter, double maxDiff) Personalized salsa for a set of vertices of interest.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIter, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank) Personalized salsa for a set of vertices of interest.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> salsaRank) Personalized salsa for a set of vertices of interest.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight) Personalized pagerank for a set of vertices and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Personalized pagerank for a set of vertices and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight) Personalized pagerank for a set of vertices and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Personalized pagerank for a set of vertices and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight) Personalized pagerank for a set of vertices and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Personalized pagerank for a set of vertices and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight) Personalized pagerank for a set of vertices and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Personalized pagerank for a set of vertices and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight) Personalized pagerank for a set of vertices and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Personalized pagerank for a set of vertices and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight) Personalized pagerank for a set of vertices and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Personalized pagerank for a set of vertices and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight) Personalized pagerank for a set of vertices and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Personalized pagerank for a set of vertices and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight) Personalized pagerank for a set of vertices and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Personalized pagerank for a set of vertices and weighted edges.
<ID> VertexProperty<ID,java.lang.Integer>	Analyst.topologicalSchedule(PgxGraph graph, VertexSet<ID> source) Topological schedule gives an order of visit for the reachable vertices from the source
<ID> VertexProperty<ID,java.lang.Integer>	Analyst.topologicalSchedule(PgxGraph graph, VertexSet<ID> source, VertexProperty<ID,java.lang.Integer> topoSched) Topological sort gives an order of visit for vertices in directed acyclic graphs
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.topologicalScheduleAsync(PgxGraph graph, VertexSet<ID> source) Topological schedule gives an order of visit for the reachable vertices from the source
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.topologicalScheduleAsync(PgxGraph graph, VertexSet<ID> source, VertexProperty<ID,java.lang.Integer> topoSched) Topological schedule gives an order of visit for the reachable vertices from the source