Uses of Class
oracle.pgx.api.VertexProperty

Packages that use VertexProperty

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

Uses of VertexProperty in oracle.pgx.api

Subclasses of VertexProperty in oracle.pgx.api

Modifier and Type	Class and Description
class	VertexLabels<ID>

Fields in oracle.pgx.api with type parameters of type VertexProperty

Modifier and Type	Field and Description
static java.util.Set<VertexProperty<?,?>>	VertexProperty.ALL
static java.util.Set<VertexProperty<?,?>>	VertexProperty.NONE

Methods in oracle.pgx.api that return VertexProperty

Modifier and Type	Method and Description
<ID> VertexProperty<ID,java.lang.Double>	Analyst.approximateVertexBetweennessCentrality(PgxGraph graph, int k)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.approximateVertexBetweennessCentrality(PgxGraph graph, int k, VertexProperty<ID,java.lang.Double> bc)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.approximateVertexBetweennessCentralityFromSeeds(PgxGraph graph, PgxVertex<ID>... seeds)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.approximateVertexBetweennessCentralityFromSeeds(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc, PgxVertex<ID>... seeds)
VertexProperty<ID,V>	VertexProperty.clone() Blocking version of cloneAsync().
VertexProperty<ID,V>	VertexProperty.clone(java.lang.String newPropertyName) Blocking version of cloneAsync(String).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.closenessCentralityDoubleLength(PgxGraph graph, EdgeProperty<java.lang.Double> cost)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.closenessCentralityDoubleLength(PgxGraph graph, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> cc)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.closenessCentralityUnitLength(PgxGraph graph)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.closenessCentralityUnitLength(PgxGraph graph, VertexProperty<ID,java.lang.Double> cc)
<ID,V> VertexProperty<ID,PgxVect<V>>	PgxGraph.combineVertexPropertiesIntoVectorProperty(java.util.List<VertexProperty<ID,V>> vertexPropertyList) Blocking version of PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List) Calls PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List) and waits for the returned PgxFuture to complete.
<ID,V> VertexProperty<ID,PgxVect<V>>	PgxGraph.combineVertexPropertiesIntoVectorProperty(java.util.List<VertexProperty<ID,V>> vertexPropertyList, java.lang.String name) Blocking version of PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List, String) Calls PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List, String) and waits for the returned PgxFuture to complete.
<ID,V> VertexProperty<ID,V>	PgxGraph.createVertexProperty(PropertyType type) Blocking version of PgxGraph.createVertexPropertyAsync(PropertyType).
<ID,V> VertexProperty<ID,V>	PgxGraph.createVertexProperty(PropertyType type, int dimension, java.lang.String name, boolean hardName) Blocking version of PgxGraph.createVertexPropertyAsync(PropertyType, int, String, boolean).
<ID,V> VertexProperty<ID,V>	PgxGraph.createVertexProperty(PropertyType type, java.lang.String name) Blocking version of PgxGraph.createVertexPropertyAsync(PropertyType, String).
<ID,V> VertexProperty<ID,PgxVect<V>>	PgxGraph.createVertexVectorProperty(PropertyType type, int dimension) Blocking version of PgxGraph.createVertexVectorPropertyAsync(PropertyType, int).
<ID,V> VertexProperty<ID,PgxVect<V>>	PgxGraph.createVertexVectorProperty(PropertyType type, int dimension, java.lang.String name) Blocking version of PgxGraph.createVertexVectorPropertyAsync(PropertyType, int, String).
<ID> VertexProperty<ID,java.lang.Integer>	Analyst.degreeCentrality(PgxGraph graph)
<ID> VertexProperty<ID,java.lang.Integer>	Analyst.degreeCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.eigenvectorCentrality(PgxGraph graph)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.eigenvectorCentrality(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.eigenvectorCentrality(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge, VertexProperty<ID,java.lang.Double> ec)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.eigenvectorCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Double> ec)
VertexProperty<ID,java.lang.Double>	MatrixFactorizationModel.getEstimatedRatings(PgxVertex<ID> estimateRatingsFor) Blocking version of MatrixFactorizationModel.getEstimatedRatingsAsync(PgxVertex)
VertexProperty<ID,PgxVect<java.lang.Double>>	MatrixFactorizationModel.getFeatures() Gets the features of this model.
<ID> VertexProperty<ID,java.lang.Boolean>	BipartiteGraph.getIsLeftProperty() Blocking version of BipartiteGraph.getIsLeftPropertyAsync().
<ID,V> VertexProperty<ID,V>	PgxGraph.getVertexProperty(java.lang.String name) Blocking version of PgxGraph.getVertexPropertyAsync(String).
<ID> VertexProperty<ID,java.lang.Integer>	Analyst.inDegreeCentrality(PgxGraph graph)
<ID> VertexProperty<ID,java.lang.Integer>	Analyst.inDegreeCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.localClusteringCoefficient(PgxGraph graph)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.localClusteringCoefficient(PgxGraph graph, VertexProperty<ID,java.lang.Double> lcc)
<ID> VertexProperty<ID,java.lang.Integer>	Analyst.outDegreeCentrality(PgxGraph graph)
<ID> VertexProperty<ID,java.lang.Integer>	Analyst.outDegreeCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerank(PgxGraph graph)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerank(PgxGraph graph, boolean norm)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerank(PgxGraph graph, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerank(PgxGraph graph, double e, double d, int max)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerank(PgxGraph graph, double e, double d, int max, boolean norm)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerank(PgxGraph graph, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerank(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerank(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerankApproximate(PgxGraph graph)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerankApproximate(PgxGraph graph, double e, double d, int max)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerankApproximate(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerankApproximate(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max) Convenience wrapper around Analyst.personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int,) taking a vertex ID instead of a PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, boolean norm) Convenience wrapper around Analyst.personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, boolean) taking a vertex ID instead of a PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank) Convenience wrapper around #personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, boolean, VertexProperty<ID, Double>) taking a vertex ID instead of a PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, VertexProperty<ID,java.lang.Double> rank) Convenience wrapper around #personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, VertexProperty<ID, Double>) taking a vertex ID instead of a PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, boolean norm)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm)
<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)
<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)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, ID v, java.math.BigDecimal d, int maxIterations, java.math.BigDecimal maxDiff) Convenience wrapper around Analyst.personalizedSalsa(BipartiteGraph, PgxVertex, BigDecimal, int, BigDecimal) taking a vertex ID instead of PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, ID v, java.math.BigDecimal d, int maxIterations, java.math.BigDecimal maxDiff, VertexProperty<ID,java.lang.Double> salsaRank) Convenience wrapper around #personalizedSalsa(BipartiteGraph, PgxVertex, BigDecimal, int, BigDecimal, VertexProperty<ID, Double>) taking a vertex ID instead of PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, PgxVertex<ID> v)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIter, double maxDiff)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIter, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIter, double maxDiff)
<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)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, boolean norm, EdgeProperty<java.lang.Double> weight) Convenience wrapper around Analyst.personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, boolean, EdgeProperty) taking a vertex ID instead of a PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Convenience wrapper around #personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, boolean, EdgeProperty, VertexProperty<ID, Double>) taking a vertex ID instead of a PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, EdgeProperty<java.lang.Double> weight) Convenience wrapper around Analyst.personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, EdgeProperty) taking a vertex ID instead of a PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Convenience wrapper around #personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, EdgeProperty, VertexProperty<ID, Double>) taking a vertex ID instead of a PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight)
<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)
<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)
<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)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight)
<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)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.salsa(BipartiteGraph graph)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.salsa(BipartiteGraph graph, double maxDiff, int maxIter)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.salsa(BipartiteGraph graph, double maxDiff, int maxIter, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.salsa(BipartiteGraph graph, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.vertexBetweennessCentrality(PgxGraph graph)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.vertexBetweennessCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, EdgeProperty<java.lang.Double> weight)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)

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

Modifier and Type	Method and Description
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph graph, int k)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph graph, int k, VertexProperty<ID,java.lang.Double> bc)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph, PgxVertex<ID>... seeds)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc, PgxVertex<ID>... seeds)
PgxFuture<VertexProperty<ID,V>>	VertexProperty.cloneAsync() Create a copy of this property. Convenience method for cloneAsync(String) passing newPropertyName as null
PgxFuture<VertexProperty<ID,V>>	VertexProperty.cloneAsync(java.lang.String newPropertyName) Creates a copy of this property.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<java.lang.Double> cost)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> cc)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.closenessCentralityUnitLengthAsync(PgxGraph graph)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.closenessCentralityUnitLengthAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> cc)
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>>	PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(java.util.List<VertexProperty<ID,V>> vertexPropertyList) Takes a list of scalar vertex properties of same type and creates a new vertex vector property by combining them.
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>>	PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(java.util.List<VertexProperty<ID,V>> vertexPropertyList, java.lang.String name) Takes a list of scalar vertex properties of same type and creates a new vertex vector property by combining them.
<ID,V> PgxFuture<VertexProperty<ID,V>>	PgxGraph.createVertexPropertyAsync(PropertyType type) Creates a session-bound vertex property
<ID,V> PgxFuture<VertexProperty<ID,V>>	PgxGraph.createVertexPropertyAsync(PropertyType type, java.lang.String name) Creates a session-bound vertex property
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>>	PgxGraph.createVertexVectorPropertyAsync(PropertyType type, int dimension) Creates a session-bound vertex vector property
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>>	PgxGraph.createVertexVectorPropertyAsync(PropertyType type, int dimension, java.lang.String name) Creates a session-bound vertex vector property
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.degreeCentralityAsync(PgxGraph graph)
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.degreeCentralityAsync(PgxGraph graph, java.lang.String propertyName)
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.degreeCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>	Analyst.diameter(PgxGraph 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)
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>>	Analyst.diameterAsync(PgxGraph 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)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.eigenvectorCentralityAsync(PgxGraph graph)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.eigenvectorCentralityAsync(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.eigenvectorCentralityAsync(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge, VertexProperty<ID,java.lang.Double> ec)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.eigenvectorCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> ec)
<S> java.util.List<VertexProperty<ID,S>>	VertexProperty.expand() Blocking version of expandAsync().
<S> java.util.List<VertexProperty<ID,S>>	VertexProperty.expand(java.lang.String namePrefix) Blocking version of expandAsync(String).
<S> PgxFuture<java.util.List<VertexProperty<ID,S>>>	VertexProperty.expandAsync() If this is a vector property, expands this property into a list of scalar properties of same type.
<S> PgxFuture<java.util.List<VertexProperty<ID,S>>>	VertexProperty.expandAsync(java.lang.String namePrefix) If this is a vector property, expands this property into a list of scalar properties of same type.
<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) 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, VertexFilter filter, VertexFilter navigator) Convenience wrapper around Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter) taking a vertex ID instead of PgxVertex.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator) Convenience wrapper around Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter) taking a vertex ID instead of PgxVertex.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, boolean initWithInf) Convenience wrapper around Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean) taking a vertex ID instead of PgxVertex.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, boolean initWithInf) Convenience wrapper around Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean) taking a vertex ID instead of PgxVertex.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent) Convenience wrapper around Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent) Convenience wrapper around Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, VertexProperty, VertexProperty) 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)
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root)
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator)
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator)
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf)
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf)
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root)
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root)
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator)
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator)
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf)
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf)
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
PgxFuture<VertexProperty<ID,java.lang.Double>>	MatrixFactorizationModel.getEstimatedRatingsAsync(PgxVertex<ID> estimateRatingsFor) Computes estimated ratings for a specific vertex.
<ID> PgxFuture<VertexProperty<ID,java.lang.Boolean>>	BipartiteGraph.getIsLeftPropertyAsync() Gets the 'is Left' vertex property of the graph.
java.util.Set<VertexProperty<?,?>>	PgxGraph.getVertexProperties() Blocking version of PgxGraph.getVertexPropertiesAsync().
PgxFuture<java.util.Set<VertexProperty<?,?>>>	PgxGraph.getVertexPropertiesAsync() Get the set of vertex properties belonging to this graph.
<ID,V> PgxFuture<VertexProperty<ID,V>>	PgxGraph.getVertexPropertyAsync(java.lang.String name) Gets a vertex property of this graph
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>	Analyst.hits(PgxGraph graph)
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>	Analyst.hits(PgxGraph graph)
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>	Analyst.hits(PgxGraph graph, int max)
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>	Analyst.hits(PgxGraph graph, int max)
<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)
<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)
<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)
<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)
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>>	Analyst.hitsAsync(PgxGraph graph)
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>>	Analyst.hitsAsync(PgxGraph graph)
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>>	Analyst.hitsAsync(PgxGraph graph, int max)
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>>	Analyst.hitsAsync(PgxGraph graph, int max)
<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)
<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)
<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)
<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)
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.inDegreeCentralityAsync(PgxGraph graph)
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.inDegreeCentralityAsync(PgxGraph graph, java.lang.String propertyName)
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.inDegreeCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>	Analyst.kcore(PgxGraph graph)
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>	Analyst.kcore(PgxGraph graph, int minCore, int maxCore)
<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)
<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)
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>>	Analyst.kcoreAsync(PgxGraph graph)
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>>	Analyst.kcoreAsync(PgxGraph graph, int minCore, int maxCore)
<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)
<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)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.localClusteringCoefficientAsync(PgxGraph graph)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.localClusteringCoefficientAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> lcc)
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.outDegreeCentralityAsync(PgxGraph graph)
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.outDegreeCentralityAsync(PgxGraph graph, java.lang.String propertyName)
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.outDegreeCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankApproximateAsync(PgxGraph graph)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankApproximateAsync(PgxGraph graph, double e, double d, int max)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankApproximateAsync(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankApproximateAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph, boolean norm)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm)
<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)
<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)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIter, double maxDiff)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIter, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIter, double maxDiff)
<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)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight)
<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)
<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)
<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)
<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)
<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)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight)
<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)
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>	Analyst.radius(PgxGraph 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)
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>>	Analyst.radiusAsync(PgxGraph 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)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.salsaAsync(BipartiteGraph graph)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.salsaAsync(BipartiteGraph graph, double maxDiff, int maxIter)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.salsaAsync(BipartiteGraph graph, double maxDiff, int maxIter, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.salsaAsync(BipartiteGraph graph, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.vertexBetweennessCentralityAsync(PgxGraph graph)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.vertexBetweennessCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)

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

Modifier and Type	Method and Description
<ID> VertexProperty<ID,java.lang.Double>	Analyst.approximateVertexBetweennessCentrality(PgxGraph graph, int k, VertexProperty<ID,java.lang.Double> bc)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph graph, int k, VertexProperty<ID,java.lang.Double> bc)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.approximateVertexBetweennessCentralityFromSeeds(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc, PgxVertex<ID>... seeds)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc, PgxVertex<ID>... seeds)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.closenessCentralityDoubleLength(PgxGraph graph, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> cc)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> cc)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.closenessCentralityUnitLength(PgxGraph graph, VertexProperty<ID,java.lang.Double> cc)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.closenessCentralityUnitLengthAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> cc)
<ID> Partition<ID>	Analyst.communitiesConductanceMinimization(PgxGraph graph, int max, VertexProperty<ID,java.lang.Long> partitonDistribution)
<ID> Partition<ID>	Analyst.communitiesConductanceMinimization(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution)
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph, int max, VertexProperty<ID,java.lang.Long> partitionDistribution)
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution)
<ID> Partition<ID>	Analyst.communitiesLabelPropagation(PgxGraph graph, int maxIterations, VertexProperty<ID,java.lang.Long> partitonDistribution)
<ID> Partition<ID>	Analyst.communitiesLabelPropagation(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution)
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesLabelPropagationAsync(PgxGraph graph, int maxIteration, VertexProperty<ID,java.lang.Long> partitionDistribution)
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesLabelPropagationAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution)
<ID> AllPaths<ID>	PgxGraph.createAllPaths(PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> dist, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Blocking version of PgxGraph.createAllPathsAsync(PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty).
<ID> AllPaths<ID>	PgxGraph.createAllPaths(PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> dist, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Blocking version of PgxGraph.createAllPathsAsync(PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty).
<ID> AllPaths<ID>	PgxGraph.createAllPaths(PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> dist, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Blocking version of PgxGraph.createAllPathsAsync(PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty).
<ID> PgxFuture<AllPaths<ID>>	PgxGraph.createAllPathsAsync(PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> dist, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Creates a AllPaths object representing all the shortest paths from a single source to all the possible destinations (shortest regarding the given edge costs).
<ID> PgxFuture<AllPaths<ID>>	PgxGraph.createAllPathsAsync(PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> dist, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Creates a AllPaths object representing all the shortest paths from a single source to all the possible destinations (shortest regarding the given edge costs).
<ID> PgxFuture<AllPaths<ID>>	PgxGraph.createAllPathsAsync(PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> dist, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Creates a AllPaths object representing all the shortest paths from a single source to all the possible destinations (shortest regarding the given edge costs).
<ID> Partition<ID>	PgxGraph.createComponents(VertexProperty<ID,java.lang.Long> components, long numComponents) Blocking version of PgxGraph.createComponentsAsync(VertexProperty, long).
<ID> PgxFuture<Partition<ID>>	PgxGraph.createComponentsAsync(VertexProperty<ID,java.lang.Long> components, long numComponents) Creates a Partition object holding a collection of vertex sets, each representing a component.
<ID> PgxPath<ID>	PgxGraph.createPath(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Blocking version of PgxGraph.createPathAsync(PgxVertex, PgxVertex, EdgeProperty, VertexProperty, VertexProperty).
<ID> PgxPath<ID>	PgxGraph.createPath(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Blocking version of PgxGraph.createPathAsync(PgxVertex, PgxVertex, EdgeProperty, VertexProperty, VertexProperty).
<ID> PgxFuture<PgxPath<ID>>	PgxGraph.createPathAsync(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.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> PgxFuture<PgxPath<ID>>	PgxGraph.createPathAsync(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.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> VertexProperty<ID,java.lang.Integer>	Analyst.degreeCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.degreeCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
<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)
<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)
B	MutationStrategyBuilder.dropVertexProperty(VertexProperty<?,?> vertexProperty) Set vertex property that will be dropped after the mutation.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.eigenvectorCentrality(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge, VertexProperty<ID,java.lang.Double> ec)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.eigenvectorCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Double> ec)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.eigenvectorCentralityAsync(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge, VertexProperty<ID,java.lang.Double> ec)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.eigenvectorCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> ec)
<ID> AllPaths<ID>	Analyst.fattestPath(PgxGraph graph, ID rootId, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.fattestPath(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of a PgxVertex.
<ID> AllPaths<ID>	Analyst.fattestPath(PgxGraph graph, ID rootId, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.fattestPath(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of a PgxVertex.
<ID> AllPaths<ID>	Analyst.fattestPath(PgxGraph graph, ID rootId, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.fattestPath(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of a PgxVertex.
<ID> AllPaths<ID>	Analyst.fattestPath(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> AllPaths<ID>	Analyst.fattestPath(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> AllPaths<ID>	Analyst.fattestPath(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<AllPaths<ID>>	Analyst.fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<AllPaths<ID>>	Analyst.fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<AllPaths<ID>>	Analyst.fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent) Convenience wrapper around Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent) Convenience wrapper around Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, VertexProperty, VertexProperty) 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, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
<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)
<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)
<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)
<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)
<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)
<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)
<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)
<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)
<ID> VertexProperty<ID,java.lang.Integer>	Analyst.inDegreeCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.inDegreeCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
java.lang.Boolean	PgxGraph.isBipartiteGraph(VertexProperty<?,java.lang.Boolean> isLeft) Blocking version of PgxGraph.isBipartiteGraphAsync(VertexProperty).
<ID> PgxFuture<java.lang.Boolean>	PgxGraph.isBipartiteGraphAsync(VertexProperty<ID,java.lang.Boolean> isLeft) Checks whether a given graph is a bipartite graph.
<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)
<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)
<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)
<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)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.localClusteringCoefficient(PgxGraph graph, VertexProperty<ID,java.lang.Double> lcc)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.localClusteringCoefficientAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> lcc)
<ID> MatrixFactorizationModel<ID>	Analyst.matrixFactorizationGradientDescent(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength, VertexProperty<ID,PgxVect<java.lang.Double>> features)
<ID> MatrixFactorizationModel<ID>	Analyst.matrixFactorizationGradientDescent(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,PgxVect<java.lang.Double>> features)
<ID> PgxFuture<MatrixFactorizationModel<ID>>	Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength, VertexProperty<ID,PgxVect<java.lang.Double>> features)
<ID> PgxFuture<MatrixFactorizationModel<ID>>	Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,PgxVect<java.lang.Double>> features)
<ID> VertexProperty<ID,java.lang.Integer>	Analyst.outDegreeCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.outDegreeCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerank(PgxGraph graph, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerank(PgxGraph graph, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerank(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerank(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerankApproximate(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerankApproximate(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankApproximateAsync(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankApproximateAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank) Convenience wrapper around #personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, boolean, VertexProperty<ID, Double>) taking a vertex ID instead of a PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, VertexProperty<ID,java.lang.Double> rank) Convenience wrapper around #personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, VertexProperty<ID, Double>) taking a vertex ID instead of a PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<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)
<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)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<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)
<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)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, ID v, java.math.BigDecimal d, int maxIterations, java.math.BigDecimal maxDiff, VertexProperty<ID,java.lang.Double> salsaRank) Convenience wrapper around #personalizedSalsa(BipartiteGraph, PgxVertex, BigDecimal, int, BigDecimal, VertexProperty<ID, Double>) taking a vertex ID instead of PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIter, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> salsaRank)
<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)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIter, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> salsaRank)
<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)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Convenience wrapper around #personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, boolean, EdgeProperty, VertexProperty<ID, Double>) taking a vertex ID instead of a PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Convenience wrapper around #personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, EdgeProperty, VertexProperty<ID, Double>) taking a vertex ID instead of a PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<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)
<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)
<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)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<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)
<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)
<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)
<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)
<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)
<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)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.salsa(BipartiteGraph graph, double maxDiff, int maxIter, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.salsa(BipartiteGraph graph, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.salsaAsync(BipartiteGraph graph, double maxDiff, int maxIter, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.salsaAsync(BipartiteGraph graph, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> Partition<ID>	Analyst.sccKosaraju(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution)
<ID> PgxFuture<Partition<ID>>	Analyst.sccKosarajuAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution)
<ID> Partition<ID>	Analyst.sccTarjan(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution)
<ID> PgxFuture<Partition<ID>>	Analyst.sccTarjanAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution)
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFord(PgxGraph graph, ID srcId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathBellmanFord(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex.
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFord(PgxGraph graph, ID srcId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathBellmanFord(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex.
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFord(PgxGraph graph, ID srcId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathBellmanFord(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex.
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFord(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFord(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFord(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFordReverse(PgxGraph graph, ID srcId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathBellmanFordReverse(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex.
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFordReverse(PgxGraph graph, ID srcId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathBellmanFordReverse(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex.
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFordReverse(PgxGraph graph, ID srcId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathBellmanFordReverse(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex.
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFordReverse(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFordReverse(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFordReverse(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxPath<ID>	Analyst.shortestPathDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty) taking vertex IDs instead of PgxVertex.
<ID> PgxPath<ID>	Analyst.shortestPathDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty) taking vertex IDs instead of PgxVertex.
<ID> PgxPath<ID>	Analyst.shortestPathDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxPath<ID>	Analyst.shortestPathDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxPath<ID>	Analyst.shortestPathDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty) taking vertex IDs instead of PgxVertex.
<ID> PgxPath<ID>	Analyst.shortestPathDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty) taking vertex IDs instead of PgxVertex.
<ID> PgxPath<ID>	Analyst.shortestPathDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxPath<ID>	Analyst.shortestPathDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathFilteredDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter) taking vertex IDs instead of PgxVertex.
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathFilteredDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter) taking vertex IDs instead of PgxVertex.
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter) taking vertex IDs instead of PgxVertex.
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter) taking vertex IDs instead of PgxVertex.
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> AllPaths<ID>	Analyst.shortestPathHopDist(PgxGraph graph, ID srcId, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathHopDist(PgxGraph, PgxVertex, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex.
<ID> AllPaths<ID>	Analyst.shortestPathHopDist(PgxGraph graph, ID srcId, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathHopDist(PgxGraph, PgxVertex, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex.
<ID> AllPaths<ID>	Analyst.shortestPathHopDist(PgxGraph graph, ID srcId, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathHopDist(PgxGraph, PgxVertex, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex.
<ID> AllPaths<ID>	Analyst.shortestPathHopDist(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> AllPaths<ID>	Analyst.shortestPathHopDist(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> AllPaths<ID>	Analyst.shortestPathHopDist(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathHopDistAsync(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathHopDistAsync(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathHopDistAsync(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> AllPaths<ID>	Analyst.shortestPathHopDistReverse(PgxGraph graph, ID srcId, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathHopDistReverse(PgxGraph, PgxVertex, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex.
<ID> AllPaths<ID>	Analyst.shortestPathHopDistReverse(PgxGraph graph, ID srcId, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathHopDistReverse(PgxGraph, PgxVertex, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex.
<ID> AllPaths<ID>	Analyst.shortestPathHopDistReverse(PgxGraph graph, ID srcId, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathHopDistReverse(PgxGraph, PgxVertex, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex.
<ID> AllPaths<ID>	Analyst.shortestPathHopDistReverse(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> AllPaths<ID>	Analyst.shortestPathHopDistReverse(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> AllPaths<ID>	Analyst.shortestPathHopDistReverse(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathHopDistReverseAsync(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathHopDistReverseAsync(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathHopDistReverseAsync(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.vertexBetweennessCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.vertexBetweennessCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc)
<ID> Partition<ID>	Analyst.wcc(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution)
<ID> PgxFuture<Partition<ID>>	Analyst.wccAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)

Method parameters in oracle.pgx.api with type arguments of type VertexProperty

Modifier and Type	Method and Description
BipartiteGraph	PgxGraph.bipartiteSubGraphFromInDegree(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName) Blocking version of PgxGraph.bipartiteSubGraphFromInDegreeAsync(Collection, Collection, String).
BipartiteGraph	PgxGraph.bipartiteSubGraphFromInDegree(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName, java.lang.String isLeftPropName, boolean inPlace) Blocking version of PgxGraph.bipartiteSubGraphFromInDegreeAsync(Collection, Collection, String, String, boolean).
PgxFuture<BipartiteGraph>	PgxGraph.bipartiteSubGraphFromInDegreeAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName) Create a bipartite version of this graph with all vertices of in-degree = 0 being the left set.
PgxFuture<BipartiteGraph>	PgxGraph.bipartiteSubGraphFromInDegreeAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName, java.lang.String isLeftPropName, boolean inPlace) Create a bipartite version of this graph with all vertices of in-degree = 0 being the left set.
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).
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.
PgxGraph	PgxGraph.clone(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName) Blocking version of PgxGraph.cloneAsync().
PgxFuture<PgxGraph>	PgxGraph.cloneAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName) Creates a copy of this graph.
<ID,V> VertexProperty<ID,PgxVect<V>>	PgxGraph.combineVertexPropertiesIntoVectorProperty(java.util.List<VertexProperty<ID,V>> vertexPropertyList) Blocking version of PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List) Calls PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List) and waits for the returned PgxFuture to complete.
<ID,V> VertexProperty<ID,PgxVect<V>>	PgxGraph.combineVertexPropertiesIntoVectorProperty(java.util.List<VertexProperty<ID,V>> vertexPropertyList, java.lang.String name) Blocking version of PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List, String) Calls PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List, String) and waits for the returned PgxFuture to complete.
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>>	PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(java.util.List<VertexProperty<ID,V>> vertexPropertyList) Takes a list of scalar vertex properties of same type and creates a new vertex vector property by combining them.
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>>	PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(java.util.List<VertexProperty<ID,V>> vertexPropertyList, java.lang.String name) Takes a list of scalar vertex properties of same type and creates a new vertex vector property by combining them.
B	MutationStrategyBuilder.dropVertexProperties(java.util.Collection<VertexProperty<?,?>> vertexProperties) Set vertex properties that will be dropped after the mutation.
PgxGraph	PgxGraph.filter(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, GraphFilter graphFilter, java.lang.String newGraphName) Blocking version of PgxGraph.filterAsync(Collection, Collection, GraphFilter, String).
PgxFuture<PgxGraph>	PgxGraph.filterAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, GraphFilter graphFilter, java.lang.String newGraphName) Create a subgraph of this graph.
PgxGraph	PgxGraph.simplify(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, java.lang.String newGraphName) Blocking version of PgxGraph.simplifyAsync(Collection, Collection, MultiEdges, SelfEdges, TrivialVertices, Mode, String).
PgxFuture<PgxGraph>	PgxGraph.simplifyAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, java.lang.String newGraphName) Create a simplified version of a graph.
PgxGraph	PgxGraph.sortByDegree(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, PgxGraph.SortOrder sortOrder, PgxGraph.Degree degree, PgxGraph.Mode mode, java.lang.String newGraphName) Blocking version of PgxGraph.sortByDegreeAsync(Collection, Collection, SortOrder, Degree, Mode, String).
PgxFuture<PgxGraph>	PgxGraph.sortByDegreeAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, PgxGraph.SortOrder sortOrder, PgxGraph.Degree degree, PgxGraph.Mode mode, java.lang.String newGraphName) Create a sorted version of a graph and all its properties.
PgxGraph	PgxGraph.sparsify(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, double e, java.lang.String newGraphName) Blocking version of PgxGraph.sparsifyAsync(Collection, Collection, double, String).
PgxFuture<PgxGraph>	PgxGraph.sparsifyAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, double e, java.lang.String newGraphName) Sparsifies the given graph and returns a new graph with less edges.
FileGraphConfig	PgxGraph.store(Format targetFormat, java.lang.String targetPath, java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, boolean overwrite) Blocking version of PgxGraph.storeAsync(Format, String, Collection, Collection, boolean).
PgxFuture<FileGraphConfig>	PgxGraph.storeAsync(Format targetFormat, java.lang.String targetPath, java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, boolean overwrite) Stores this graph in a given file format on a file system.
PgxGraph	PgxGraph.transpose(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.util.Map<java.lang.String,java.lang.String> edgeLabelMapping, PgxGraph.Mode mode, java.lang.String newGraphName) Blocking version of PgxGraph.transposeAsync(Collection, Collection, Map, Mode, String)
PgxFuture<PgxGraph>	PgxGraph.transposeAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.util.Map<java.lang.String,java.lang.String> edgeLabelMapping, PgxGraph.Mode mode, java.lang.String newGraphName) Creates a transpose of this graph.
PgxGraph	PgxGraph.undirect(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, java.lang.String newGraphName) Blocking version of PgxGraph.undirectAsync(Collection, Collection, MultiEdges, SelfEdges, Mode, String).
PgxFuture<PgxGraph>	PgxGraph.undirectAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.Mode mode, java.lang.String newGraphName) Convenience method to create for PgxGraph.undirectAsync(MutationStrategy).