Uses of Class
oracle.pgx.api.PgxGraph

Packages that use PgxGraph

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

Uses of PgxGraph in oracle.pgx.api

Subclasses of PgxGraph in oracle.pgx.api

Modifier and Type	Class and Description
class	BipartiteGraph A bipartite PgxGraph.

Methods in oracle.pgx.api that return PgxGraph

Modifier and Type	Method and Description
PgxGraph	GraphBuilder.build() Blocking version of GraphBuilder.buildAsync().
PgxGraph	GraphBuilderImpl.build()
PgxGraph	GraphBuilder.build(java.lang.String newGraphName) Blocking version of GraphBuilder.buildAsync(String).
PgxGraph	GraphBuilderImpl.build(java.lang.String newGraphName)
PgxGraph	PgxGraph.clone() Blocking version of cloneAsync().
PgxGraph	PgxGraph.clone(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName) Blocking version of cloneAsync().
PgxGraph	PgxGraph.clone(java.lang.String newGraphName) Blocking version of cloneAsync(String).
PgxGraph	PgxGraph.filter(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, GraphFilter graphFilter, java.lang.String newGraphName) Blocking version of filterAsync(Collection, Collection, GraphFilter, String).
PgxGraph	PgxGraph.filter(GraphFilter graphFilter) Blocking version of filterAsync(GraphFilter).
PgxGraph	PgxGraph.filter(GraphFilter graphFilter, java.lang.String newGraphName) Blocking version of filterAsync(GraphFilter, String).
PgxGraph	PgxMap.getGraph() Gets the PgxGraph this map is bound to.
PgxGraph	PgxPath.getGraph() Gets the PgxGraph the Path is defined on.
PgxGraph	AllPaths.getGraph() Gets the graph.
PgxGraph	PgqlResultSet.getGraph() Gets the graph of this result set.
PgxGraph	Scalar.getGraph() Gets the graph the scalar is bound to.
PgxGraph	PgxEntity.getGraph() Gets the graph.
PgxGraph	Partition.getGraph() Gets the graph.
PgxGraph	PgxCollection.getGraph() Gets the graph.
PgxGraph	Property.getGraph() Gets the graph.
PgxGraph	PgxSession.readGraphAsOf(GraphConfig config, GraphMetaData metaData) Blocking version of PgxSession.readGraphAsOfAsync(GraphConfig, GraphMetaData).
PgxGraph	PgxSession.readGraphAsOf(GraphConfig config, GraphMetaData metaData, java.lang.String newGraphName) Blocking version of PgxSession.readGraphAsOfAsync(GraphConfig, GraphMetaData, String).
PgxGraph	PgxSession.readGraphAsOf(GraphConfig config, long creationTimestamp) Blocking version of PgxSession.readGraphAsOfAsync(GraphConfig, long).
PgxGraph	PgxSession.readGraphAsOf(GraphConfig config, long creationTimestamp, java.lang.String newGraphName) Blocking version of PgxSession.readGraphAsOfAsync(GraphConfig, long, String).
PgxGraph	PgxSession.readGraphFile(java.lang.String path) Blocking version of PgxSession.readGraphFileAsync(String).
PgxGraph	PgxSession.readGraphFile(java.lang.String path, Format format) Blocking version of PgxSession.readGraphFileAsync(String, Format).
PgxGraph	PgxSession.readGraphFile(java.lang.String path, Format format, java.lang.String newGraphName) Blocking version of PgxSession.readGraphFileAsync(String, Format, String).
PgxGraph	PgxSession.readGraphFile(java.lang.String path, java.lang.String newGraphName) Blocking version of PgxSession.readGraphFileAsync(String, String).
PgxGraph	PgxSession.readGraphWithProperties(GraphConfig config) Blocking version of PgxSession.readGraphWithPropertiesAsync(GraphConfig).
PgxGraph	PgxSession.readGraphWithProperties(GraphConfig config, boolean updateIfNotFresh) Blocking version of PgxSession.readGraphWithPropertiesAsync(GraphConfig, boolean).
PgxGraph	PgxSession.readGraphWithProperties(GraphConfig config, boolean updateIfNotFresh, java.lang.String newGraphName) Blocking version of PgxSession.readGraphWithPropertiesAsync(GraphConfig, boolean, String).
PgxGraph	PgxSession.readGraphWithProperties(GraphConfig config, long maxAge, java.util.concurrent.TimeUnit maxAgeTimeUnit) Blocking version of PgxSession.readGraphWithPropertiesAsync(GraphConfig, long, TimeUnit).
PgxGraph	PgxSession.readGraphWithProperties(GraphConfig config, long maxAge, java.util.concurrent.TimeUnit maxAgeTimeUnit, boolean blockIfFull, java.lang.String newGraphName) Blocking version of PgxSession.readGraphWithPropertiesAsync(GraphConfig, long, TimeUnit, boolean, String).
PgxGraph	PgxSession.readGraphWithProperties(GraphConfig config, java.lang.String newGraphName) Blocking version of PgxSession.readGraphWithPropertiesAsync(GraphConfig, String).
PgxGraph	PgxSession.readGraphWithProperties(java.lang.String path) Blocking version of PgxSession.readGraphWithPropertiesAsync(String).
PgxGraph	PgxSession.readGraphWithProperties(java.lang.String path, java.lang.String newGraphName) Blocking version of PgxSession.readGraphWithPropertiesAsync(String, String).
PgxGraph	PgxGraph.simplify() Blocking version of simplifyAsync().
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 simplifyAsync(Collection, Collection, MultiEdges, SelfEdges, TrivialVertices, Mode, String).
PgxGraph	PgxGraph.simplify(oracle.pgx.common.mutations.MutationStrategy mutationStrategy)
PgxGraph	PgxGraph.simplify(PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, java.lang.String newGraphName) Blocking version of simplifyAsync(MultiEdges, SelfEdges, TrivialVertices, Mode, String).
PgxGraph	PgxGraph.simplify(java.lang.String newGraphName) Blocking version of simplifyAsync(String).
PgxGraph	PgxGraph.sortByDegree() Blocking version of sortByDegreeAsync().
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 sortByDegreeAsync(Collection, Collection, SortOrder, Degree, Mode, String).
PgxGraph	PgxGraph.sortByDegree(PgxGraph.SortOrder sortOrder, PgxGraph.Degree degree, PgxGraph.Mode mode, java.lang.String newGraphName) Blocking version of sortByDegreeAsync(SortOrder, Degree, Mode, String).
PgxGraph	PgxGraph.sortByDegree(java.lang.String newGraphName) Blocking version of sortByDegreeAsync(String).
PgxGraph	PgxGraph.sparsify(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, double e, java.lang.String newGraphName) Blocking version of sparsifyAsync(Collection, Collection, double, String).
PgxGraph	PgxGraph.sparsify(double e) Blocking version of sparsifyAsync(double).
PgxGraph	PgxGraph.sparsify(double e, java.lang.String newGraphName) Blocking version of sparsifyAsync(double, String).
PgxGraph	PgxGraph.transpose() Blocking version of transposeAsync()
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 transposeAsync(Collection, Collection, Map, Mode, String)
PgxGraph	PgxGraph.transpose(PgxGraph.Mode mode) Blocking version of transposeAsync(Mode)
PgxGraph	PgxGraph.transpose(PgxGraph.Mode mode, java.lang.String newGraphName) Blocking version of transposeAsync(Mode, String)
PgxGraph	PgxGraph.transpose(java.lang.String newGraphName) Blocking version of transposeAsync(String)
PgxGraph	PgxGraph.undirect() Blocking version of undirectAsync().
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 undirectAsync(Collection, Collection, MultiEdges, SelfEdges, Mode, String).
PgxGraph	PgxGraph.undirect(oracle.pgx.common.mutations.MutationStrategy mutationStrategy) Blocking version of undirectAsync(MutationStrategy)
PgxGraph	PgxGraph.undirect(PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.Mode mode, java.lang.String newGraphName) Blocking version of undirectAsync(MultiEdges, SelfEdges, Mode, String).
PgxGraph	PgxGraph.undirect(java.lang.String newGraphName) Blocking version of undirectAsync(String).

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

Modifier and Type	Method and Description
PgxFuture<PgxGraph>	GraphBuilder.buildAsync() Shortcut for GraphBuilder.buildAsync(String) without a name
PgxFuture<PgxGraph>	GraphBuilderImpl.buildAsync()
PgxFuture<PgxGraph>	GraphBuilder.buildAsync(java.lang.String newGraphName) Builds a new graph out of the changes in this graph builder
PgxFuture<PgxGraph>	GraphBuilderImpl.buildAsync(java.lang.String newGraphName)
PgxFuture<PgxGraph>	PgxGraph.cloneAsync() Convenience method of cloneAsync(String) Passing String(name) as null
PgxFuture<PgxGraph>	PgxGraph.cloneAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName) Creates a copy of this graph.
PgxFuture<PgxGraph>	PgxGraph.cloneAsync(java.lang.String newGraphName) Convenience method of cloneAsync(Collection, Collection, String) Passing Collection(vertexProperties) as VertexProperty.ALL Collection(edgeProperties) as EdgeProperty.ALL
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.
PgxFuture<PgxGraph>	PgxGraph.filterAsync(GraphFilter graphFilter) Create a subgraph of this graph.
PgxFuture<PgxGraph>	PgxGraph.filterAsync(GraphFilter graphFilter, java.lang.String newGraphName) Create a subgraph of this graph.
PgxFuture<PgxGraph>	PgxSession.readGraphAsOfAsync(GraphConfig config, GraphMetaData metaData) Reads a graph and its properties of a specific version (metaData) into memory.
PgxFuture<PgxGraph>	PgxSession.readGraphAsOfAsync(GraphConfig config, GraphMetaData metaData, java.lang.String newGraphName) Reads a graph and its properties of a specific version (metaData) into memory.
PgxFuture<PgxGraph>	PgxSession.readGraphAsOfAsync(GraphConfig config, long creationTimestamp) Reads a graph and its properties of a specific version (creationTimestamp) into memory.
PgxFuture<PgxGraph>	PgxSession.readGraphAsOfAsync(GraphConfig config, long creationTimestamp, java.lang.String newGraphName) Reads a graph and its properties of a specific version (creationTimestamp) into memory.
PgxFuture<PgxGraph>	PgxSession.readGraphFileAsync(java.lang.String path) Loads the graph contained in the file at the given path.
PgxFuture<PgxGraph>	PgxSession.readGraphFileAsync(java.lang.String path, Format format) Loads the graph contained in the file at the given path.
PgxFuture<PgxGraph>	PgxSession.readGraphFileAsync(java.lang.String path, Format format, java.lang.String newGraphName) Loads the graph contained in the files at the given path.
PgxFuture<PgxGraph>	PgxSession.readGraphFileAsync(java.lang.String path, java.lang.String newGraphName) Loads the graph contained in the file at the given path.
PgxFuture<PgxGraph>	PgxSession.readGraphFilesAsync(java.util.List<java.lang.String> filePaths, Format format, java.lang.String newGraphName) Loads the graph contained in the files at the given paths.
PgxFuture<PgxGraph>	PgxSession.readGraphWithPropertiesAsync(GraphConfig config) Reads a graph and its properties, specified a graph config, into memory.
PgxFuture<PgxGraph>	PgxSession.readGraphWithPropertiesAsync(GraphConfig config, boolean updateIfNotFresh) Reads a graph and its properties, specified a graph config, into memory.
PgxFuture<PgxGraph>	PgxSession.readGraphWithPropertiesAsync(GraphConfig config, boolean updateIfNotFresh, java.lang.String newGraphName) Reads a graph and its properties, specified a graph config, into memory.
PgxFuture<PgxGraph>	PgxSession.readGraphWithPropertiesAsync(GraphConfig config, long maxAge, java.util.concurrent.TimeUnit maxAgeTimeUnit) Reads a graph and its properties, specified a graph config, into memory.
PgxFuture<PgxGraph>	PgxSession.readGraphWithPropertiesAsync(GraphConfig config, long maxAge, java.util.concurrent.TimeUnit maxAgeTimeUnit, boolean blockIfFull, java.lang.String newGraphName) Reads a graph and its properties, specified a graph config, into memory.
PgxFuture<PgxGraph>	PgxSession.readGraphWithPropertiesAsync(GraphConfig config, java.lang.String newGraphName) Reads a graph and its properties, specified a graph config, into memory.
PgxFuture<PgxGraph>	PgxSession.readGraphWithPropertiesAsync(java.lang.String path) Reads a graph and its properties, specified by a path to a graph config, into memory.
PgxFuture<PgxGraph>	PgxSession.readGraphWithPropertiesAsync(java.lang.String path, java.lang.String newGraphName) Reads a graph and its properties, specified by a path to a graph config, into memory.
PgxFuture<PgxGraph>	PgxGraph.simplifyAsync() Convenience method around simplifyAsync(String) passing null as graphName
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.
PgxFuture<PgxGraph>	PgxGraph.simplifyAsync(oracle.pgx.common.mutations.MutationStrategy mutationStrategy)
PgxFuture<PgxGraph>	PgxGraph.simplifyAsync(PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, java.lang.String newGraphName) Convenience method for simplifyAsync(Collection, Collection, MultiEdges, SelfEdges, TrivialVertices, Mode, String) Passing Collection(vertexProperties) as VertexProperty.ALL Collection(edgeProperties) as EdgeProperty.ALL Create a simplified version of a graph.
PgxFuture<PgxGraph>	PgxGraph.simplifyAsync(java.lang.String newGraphName) Convenience method for simplifyAsync(MultiEdges, SelfEdges, TrivialVertices, Mode, String) Passing StrategyType as StrategyType.REMOVE_MULTI_EDGES SelfEdges as SelfEdges.REMOVE_SELF_EDGES Trivial Vertices as TrivialVertices.REMOVE_TRIVIAL_VERTICES Mode as Mode.CREATE_COPY Create a simplified version of a graph.
PgxFuture<PgxGraph>	PgxGraph.sortByDegreeAsync() Create a sorted version of a graph and all its properties.
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.
PgxFuture<PgxGraph>	PgxGraph.sortByDegreeAsync(PgxGraph.SortOrder sortOrder, PgxGraph.Degree degree, PgxGraph.Mode mode, java.lang.String newGraphName) Create a sorted version of a graph and all its properties.
PgxFuture<PgxGraph>	PgxGraph.sortByDegreeAsync(java.lang.String newGraphName) Create a sorted version of a graph and all its properties.
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.
PgxFuture<PgxGraph>	PgxGraph.sparsifyAsync(double e) Sparsifies the given graph and returns a new graph with less edges. Convenience method around sparsify(double, String) Passing newGraphName as null
PgxFuture<PgxGraph>	PgxGraph.sparsifyAsync(double e, java.lang.String newGraphName) Sparsifies the given graph and returns a new graph with less edges. Convenience method around sparsify(Collection, Collection, double, String) Passing vertexProps as VertexProperty.ALL edgeProps as EdgeProperty.ALL
PgxFuture<PgxGraph>	PgxGraph.transposeAsync() Convenience method around transposeAsync(String) passing null as graphName
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.
PgxFuture<PgxGraph>	PgxGraph.transposeAsync(PgxGraph.Mode mode) Convenience method around transposeAsync(Mode, String) passing null as graphName
PgxFuture<PgxGraph>	PgxGraph.transposeAsync(PgxGraph.Mode mode, java.lang.String newGraphName) Convenience method around transposeAsync(Collection, Collection, Map, Mode, String) Passing Collection(vertexProps) as VertexProperty.ALL Collection(edgeProps) as EdgeProperty.ALL*
PgxFuture<PgxGraph>	PgxGraph.transposeAsync(java.lang.String newGraphName) Convenience method around transposeAsync(Mode, String) Passing Mode as Mode.CREATE_COPY
PgxFuture<PgxGraph>	PgxGraph.undirectAsync() Convenience method around undirectAsync(String) passing null as graphName
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 undirectAsync(MutationStrategy).
PgxFuture<PgxGraph>	PgxGraph.undirectAsync(oracle.pgx.common.mutations.MutationStrategy mutationStrategy) Create an undirected version of a graph.
PgxFuture<PgxGraph>	PgxGraph.undirectAsync(PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.Mode mode, java.lang.String newGraphName) Convenience method for undirectAsync(Collection, Collection, MultiEdges, SelfEdges, Mode, String) Passing Collection(vertexProps) as VertexProperty.ALL and Collection(edgeProps) as EdgeProperty.ALL
PgxFuture<PgxGraph>	PgxGraph.undirectAsync(java.lang.String newGraphName) Convenience method around undirectAsync(MultiEdges, SelfEdges, Mode, String) Passing StrategyType as StrategyType.KEEP_MULTI_EDGES SelfEdges as SelfEdges.KEEP_SELF_EDGES Trivial Vertices as TrivialVertices.KEEP_TRIVIALVERTICES Mode as Mode.CREATE_COPY

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

Modifier and Type	Method and Description
<V> EdgeProperty<java.lang.Double>	Analyst.adamicAdarCounting(PgxGraph graph) Blocking version of Analyst.adamicAdarCountingAsync(PgxGraph).
<V> EdgeProperty<java.lang.Double>	Analyst.adamicAdarCounting(PgxGraph graph, EdgeProperty<java.lang.Double> aa) Blocking version of #adamicAdarCountingAsync(PgxGraph, EdgeProperty<Double>).
PgxFuture<EdgeProperty<java.lang.Double>>	Analyst.adamicAdarCountingAsync(PgxGraph graph) Computes 'Adamic-Adar measure' for each edge in the graph.
PgxFuture<EdgeProperty<java.lang.Double>>	Analyst.adamicAdarCountingAsync(PgxGraph graph, EdgeProperty<java.lang.Double> aa) Computes 'Adamic-Adar measure' for each edge in the graph.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.approximateVertexBetweennessCentrality(PgxGraph graph, int k) Blocking version of Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph, int).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.approximateVertexBetweennessCentrality(PgxGraph graph, int k, VertexProperty<ID,java.lang.Double> bc) Blocking version of Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph, int).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph graph, int k) Approximate vertex betweenness centrality (without considering edge length).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph graph, int k, VertexProperty<ID,java.lang.Double> bc) Approximate vertex betweenness centrality (without considering edge length).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.approximateVertexBetweennessCentralityFromSeeds(PgxGraph graph, PgxVertex<ID>... seeds) Blocking version of Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph, PgxVertex[]).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.approximateVertexBetweennessCentralityFromSeeds(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc, PgxVertex<ID>... seeds) Blocking version of Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph, PgxVertex[]).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph, PgxVertex<ID>... seeds) Approximate vertex betweenness centrality (without considering edge length).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc, PgxVertex<ID>... seeds) Approximate vertex betweenness centrality (without considering edge length).
<ID> VertexSet<ID>	Analyst.center(PgxGraph graph) Blocking version of Analyst.centerAsync(PgxGraph).
<ID> VertexSet<ID>	Analyst.center(PgxGraph graph, VertexSet<ID> center) Blocking version of Analyst.centerAsync(PgxGraph, VertexSet).
<ID> PgxFuture<VertexSet<ID>>	Analyst.centerAsync(PgxGraph graph) Computes the center of the (undirected) graph.
<ID> PgxFuture<VertexSet<ID>>	Analyst.centerAsync(PgxGraph graph, VertexSet<ID> center)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.closenessCentralityDoubleLength(PgxGraph graph, EdgeProperty<java.lang.Double> cost) Blocking version of Analyst.closenessCentralityDoubleLengthAsync(PgxGraph, EdgeProperty).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.closenessCentralityDoubleLength(PgxGraph graph, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> cc) Blocking version of #closenessCentralityDoubleLengthAsync(PgxGraph, EdgeProperty, VertexProperty<ID, Double>).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<java.lang.Double> cost) Compute closeness centrality.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> cc) Compute closeness centrality.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.closenessCentralityUnitLength(PgxGraph graph) Blocking version of Analyst.closenessCentralityUnitLengthAsync(PgxGraph).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.closenessCentralityUnitLength(PgxGraph graph, VertexProperty<ID,java.lang.Double> cc) Blocking version of #closenessCentralityUnitLengthAsync(PgxGraph, VertexProperty<ID, Double>).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.closenessCentralityUnitLengthAsync(PgxGraph graph) Compute closeness centrality.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.closenessCentralityUnitLengthAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> cc) Compute closeness centrality.
<ID> Partition<ID>	Analyst.communitiesConductanceMinimization(PgxGraph graph) Blocking version of Analyst.communitiesConductanceMinimizationAsync(PgxGraph).
<ID> Partition<ID>	Analyst.communitiesConductanceMinimization(PgxGraph graph, int max) Blocking version of Analyst.communitiesConductanceMinimizationAsync(PgxGraph, int).
<ID> Partition<ID>	Analyst.communitiesConductanceMinimization(PgxGraph graph, int max, VertexProperty<ID,java.lang.Long> partitonDistribution) Blocking version of #communitiesConductanceMinimizationAsync(PgxGraph, int, VertexProperty<ID, Long>).
<ID> Partition<ID>	Analyst.communitiesConductanceMinimization(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution) Blocking version of #communitiesConductanceMinimizationAsync(PgxGraph, VertexProperty<ID, Long>).
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph) Detect communities using greedy conductance minimization.
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph, int max) Detect communities using greedy conductance minimization.
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph, int max, VertexProperty<ID,java.lang.Long> partitionDistribution) Detect communities using greedy conductance minimization.
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution) Detect communities using greedy conductance minimization.
<ID> Partition<ID>	Analyst.communitiesLabelPropagation(PgxGraph graph) Blocking version of Analyst.communitiesLabelPropagationAsync(PgxGraph).
<ID> Partition<ID>	Analyst.communitiesLabelPropagation(PgxGraph graph, int maxIterations) Blocking version of Analyst.communitiesLabelPropagationAsync(PgxGraph, int).
<ID> Partition<ID>	Analyst.communitiesLabelPropagation(PgxGraph graph, int maxIterations, VertexProperty<ID,java.lang.Long> partitonDistribution) Blocking version of #communitiesLabelPropagationAsync(PgxGraph, int, VertexProperty<ID, Long>).
<ID> Partition<ID>	Analyst.communitiesLabelPropagation(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution) Blocking version of #communitiesLabelPropagationAsync(PgxGraph, VertexProperty<ID, Long>).
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesLabelPropagationAsync(PgxGraph graph) Detect communities using parallel label propagation.
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesLabelPropagationAsync(PgxGraph graph, int maxIteration) Detect communities using parallel label propagation with the possibility to limit the number of iterations.
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesLabelPropagationAsync(PgxGraph graph, int maxIteration, VertexProperty<ID,java.lang.Long> partitionDistribution) Detect communities using parallel label propagation with the possibility to limit the number of iterations.
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesLabelPropagationAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution) Detect communities using parallel label propagation with the possibility to limit the number of iterations.
<ID> Scalar<java.lang.Double>	Analyst.conductance(PgxGraph graph, Partition<ID> partition, long partitionIndex) Blocking version of Analyst.conductanceAsync(PgxGraph, Partition, long).
<ID> Scalar<java.lang.Double>	Analyst.conductance(PgxGraph graph, Partition<ID> partition, long partitionIndex, Scalar<java.lang.Double> conductance) Blocking version of #conductanceAsync(PgxGraph, Partition, long, Scalar<Double>).
<ID> PgxFuture<Scalar<java.lang.Double>>	Analyst.conductanceAsync(PgxGraph graph, Partition<ID> partition, long partitionIndex) Compute the conductance of a single vertex partition.
<ID> PgxFuture<Scalar<java.lang.Double>>	Analyst.conductanceAsync(PgxGraph graph, Partition<ID> partition, long partitionIndex, Scalar<java.lang.Double> conductance) Compute the conductance of a single vertex partition.
long	Analyst.countTriangles(PgxGraph graph, boolean sortVerticesByDegree) Blocking version of Analyst.countTrianglesAsync(PgxGraph, boolean).
PgxFuture<java.lang.Long>	Analyst.countTrianglesAsync(PgxGraph graph, boolean sortVerticesByDegree) Counts the number of 'triads' in the given undirected graph.
<ID> VertexProperty<ID,java.lang.Integer>	Analyst.degreeCentrality(PgxGraph graph) Blocking version of Analyst.degreeCentralityAsync(PgxGraph).
<ID> VertexProperty<ID,java.lang.Integer>	Analyst.degreeCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc) Blocking version of Analyst.degreeCentralityAsync(PgxGraph).
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.degreeCentralityAsync(PgxGraph graph) Compute vertex centrality based on the sum of in- and out-degree.
<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) Compute vertex centrality based on the sum of in- and out-degree.
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>	Analyst.diameter(PgxGraph graph) Blocking version of Analyst.diameterAsync(PgxGraph).
<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) Blocking version of Analyst.diameterAsync(PgxGraph, Scalar, VertexProperty).
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>>	Analyst.diameterAsync(PgxGraph graph) Computes the diameter of the (undirected) 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) Computes the diameter of the (undirected) graph.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.eigenvectorCentrality(PgxGraph graph) Blocking version of Analyst.eigenvectorCentralityAsync(PgxGraph).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.eigenvectorCentrality(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge) Blocking version of Analyst.eigenvectorCentralityAsync(PgxGraph, int, double, boolean, boolean).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.eigenvectorCentrality(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge, VertexProperty<ID,java.lang.Double> ec) Blocking version of #eigenvectorCentralityAsync(PgxGraph, int, double, boolean, boolean, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.eigenvectorCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Double> ec) Blocking version of #eigenvectorCentralityAsync(PgxGraph, VertexProperty<ID, Double>).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.eigenvectorCentralityAsync(PgxGraph graph) Compute eigenvector centrality using power iteration (with L1 norm).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.eigenvectorCentralityAsync(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge) Compute eigenvector centrality using power iteration (with L1 norm).
<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) Compute eigenvector centrality using power iteration (with L1 norm).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.eigenvectorCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> ec) Compute eigenvector centrality using power iteration (with L1 norm).
<ID> AllPaths<ID>	Analyst.fattestPath(PgxGraph graph, ID rootId, EdgeProperty<java.lang.Double> capacity) Convenience wrapper around Analyst.fattestPath(PgxGraph, PgxVertex, EdgeProperty) 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) Blocking version of Analyst.fattestPathAsync(PgxGraph, PgxVertex, EdgeProperty).
<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) Blocking version of Analyst.fattestPathAsync(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty).
<ID> PgxFuture<AllPaths<ID>>	Analyst.fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity) Fattest Tree Algorithm - Computes the fattest path from a source vertex to all vertices in the graph.
<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) Fattest Tree Algorithm - Computes the fattest path from a source vertex to all vertices in the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, ID root) Convenience wrapper around Analyst.filteredBfs(PgxGraph, PgxVertex) taking a vertex ID instead of PgxVertex.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, ID root, 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, 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) Blocking version of Analyst.filteredBfsAsync(PgxGraph, PgxVertex).
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator) Blocking version of Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter, VertexFilter).
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf) Blocking version of Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean).
<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) Blocking version of Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, VertexProperty, VertexProperty).
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root) An algorithm to traverse a graph, breadth-first.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator) An algorithm to traverse a graph, breadth-first.
<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) An algorithm to traverse a graph, breadth-first.
<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) An algorithm to traverse a graph, breadth-first.
java.util.Deque<GraphMetaData>	PgxSession.getAvailableSnapshots(PgxGraph snapshot) Blocking version of PgxSession.getAvailableSnapshotsAsync(PgxGraph).
PgxFuture<java.util.Deque<GraphMetaData>>	PgxSession.getAvailableSnapshotsAsync(PgxGraph snapshot) Gets a list of available in-memory snapshots of a given snapshot.
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>	Analyst.hits(PgxGraph graph) Blocking version of Analyst.hitsAsync(PgxGraph).
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>	Analyst.hits(PgxGraph graph, int max) Blocking version of Analyst.hitsAsync(PgxGraph, int).
<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) Blocking version of Analyst.hitsAsync(PgxGraph, int, VertexProperty, VertexProperty) } Calls Analyst.hitsAsync(PgxGraph, int, VertexProperty, VertexProperty) and waits for the returned PgxFuture to complete.
<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) Blocking version of Analyst.hitsAsync(PgxGraph, VertexProperty, VertexProperty).
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>>	Analyst.hitsAsync(PgxGraph graph) This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>>	Analyst.hitsAsync(PgxGraph graph, int max) This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
<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) This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
<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) This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
<ID> VertexProperty<ID,java.lang.Integer>	Analyst.inDegreeCentrality(PgxGraph graph) Blocking version of Analyst.inDegreeCentralityAsync(PgxGraph).
<ID> VertexProperty<ID,java.lang.Integer>	Analyst.inDegreeCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc) Blocking version of Analyst.inDegreeCentralityAsync(PgxGraph).
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.inDegreeCentralityAsync(PgxGraph graph) Compute vertex centrality based on the in-degree.
<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) Compute vertex centrality based on the in-degree.
PgxMap<java.lang.Integer,java.lang.Long>	Analyst.inDegreeDistribution(PgxGraph graph) Blocking version of Analyst.inDegreeDistributionAsync(PgxGraph).
PgxMap<java.lang.Integer,java.lang.Long>	Analyst.inDegreeDistribution(PgxGraph graph, PgxMap<java.lang.Integer,java.lang.Long> distribution) Blocking version of #inDegreeDistributionAsync(PgxGraph, PgxMap<Integer, Long>).
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>>	Analyst.inDegreeDistributionAsync(PgxGraph graph) Computes the indegree distribution of the given graph and stores it in a map.
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>>	Analyst.inDegreeDistributionAsync(PgxGraph graph, PgxMap<java.lang.Integer,java.lang.Long> distribution) Computes the indegree distribution of the given graph and stores it in a map.
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>	Analyst.kcore(PgxGraph graph) Blocking version of Analyst.kcoreAsync(PgxGraph).
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>	Analyst.kcore(PgxGraph graph, int minCore, int maxCore) Blocking version of Analyst.kcoreAsync(PgxGraph, int, int).
<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) Blocking version of Analyst.kcoreAsync(PgxGraph, int, int, Scalar, VertexProperty).
<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) Blocking version of Analyst.kcoreAsync(PgxGraph, Scalar, VertexProperty).
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>>	Analyst.kcoreAsync(PgxGraph graph) Computes the k-core decomposition of the graph.
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>>	Analyst.kcoreAsync(PgxGraph graph, int minCore, int maxCore) Computes the k-core decomposition of the graph.
<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) Computes the k-core decomposition of the graph.
<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) Computes the k-core decomposition of the graph.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.localClusteringCoefficient(PgxGraph graph) Blocking version of Analyst.localClusteringCoefficientAsync(PgxGraph).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.localClusteringCoefficient(PgxGraph graph, VertexProperty<ID,java.lang.Double> lcc) Blocking version of Analyst.localClusteringCoefficientAsync(PgxGraph, VertexProperty).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.localClusteringCoefficientAsync(PgxGraph graph) Computes the local clustering coefficient for each node in an undirected graph.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.localClusteringCoefficientAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> lcc)
<ID> VertexProperty<ID,java.lang.Integer>	Analyst.outDegreeCentrality(PgxGraph graph) Blocking version of Analyst.outDegreeCentralityAsync(PgxGraph).
<ID> VertexProperty<ID,java.lang.Integer>	Analyst.outDegreeCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc) Blocking version of Analyst.outDegreeCentralityAsync(PgxGraph).
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.outDegreeCentralityAsync(PgxGraph graph) Compute vertex centrality based on the out-degree.
<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) Compute vertex centrality based on the out-degree.
PgxMap<java.lang.Integer,java.lang.Long>	Analyst.outDegreeDistribution(PgxGraph graph) Blocking version of Analyst.outDegreeDistributionAsync(PgxGraph).
PgxMap<java.lang.Integer,java.lang.Long>	Analyst.outDegreeDistribution(PgxGraph graph, PgxMap<java.lang.Integer,java.lang.Long> distribution) Blocking version of #outDegreeDistributionAsync(PgxGraph, PgxMap<Integer, Long>).
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>>	Analyst.outDegreeDistributionAsync(PgxGraph graph) Computes the outdegree distribution of the given graph and stores it in a map.
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>>	Analyst.outDegreeDistributionAsync(PgxGraph graph, PgxMap<java.lang.Integer,java.lang.Long> distribution) Computes the outdegree distribution of the given graph and stores it in a map.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerank(PgxGraph graph) Blocking version of Analyst.pagerankAsync(PgxGraph).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerank(PgxGraph graph, boolean norm) Blocking version of Analyst.pagerankAsync(PgxGraph, boolean).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerank(PgxGraph graph, boolean norm, VertexProperty<ID,java.lang.Double> rank) Blocking version of #pagerankAsync(PgxGraph, boolean, VertexProperty<ID, Double>) Calls #pagerankAsync(PgxGraph, boolean, VertexProperty<ID, Double>) and waits for the returned PgxFuture to complete.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerank(PgxGraph graph, double e, double d, int max) Blocking version of Analyst.pagerankAsync(PgxGraph, double, double, int).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerank(PgxGraph graph, double e, double d, int max, boolean norm) Blocking version of Analyst.pagerankAsync(PgxGraph, double, double, int, boolean).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerank(PgxGraph graph, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank) Blocking version of #pagerankAsync(PgxGraph, double, double, int, boolean, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerank(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank) Blocking version of #pagerankAsync(PgxGraph, double, double, int, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerank(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank) Blocking version of #pagerankAsync(PgxGraph, VertexProperty<ID, Double>) Calls #pagerankAsync(PgxGraph, VertexProperty<ID, Double>) and waits for the returned PgxFuture to complete.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerankApproximate(PgxGraph graph) Blocking version of Analyst.pagerankApproximateAsync(PgxGraph).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerankApproximate(PgxGraph graph, double e, double d, int max) Blocking version of Analyst.pagerankApproximateAsync(PgxGraph, double, double, int).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerankApproximate(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank) Blocking version of #pagerankApproximateAsync(PgxGraph, double, double, int, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerankApproximate(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank) Blocking version of #pagerankApproximateAsync(PgxGraph, VertexProperty<ID, Double>).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankApproximateAsync(PgxGraph graph) Computes an approximate pagerank.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankApproximateAsync(PgxGraph graph, double e, double d, int max) Computes an approximate pagerank.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankApproximateAsync(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank) Computes an approximate pagerank.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankApproximateAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank) Computes an approximate pagerank.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph) Classic pagerank algorithm.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph, boolean norm) Classic pagerank algorithm.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph, boolean norm, VertexProperty<ID,java.lang.Double> rank) Classic pagerank algorithm.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max) Classic pagerank algorithm.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm) Classic pagerank algorithm.
<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) Classic pagerank algorithm.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank) Classic pagerank algorithm.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank) Classic pagerank algorithm.
<ID> Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>>	Analyst.partitionConductance(PgxGraph graph, Partition<ID> components) Blocking version of Analyst.partitionModularityAsync(PgxGraph, Partition).
<ID> Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>>	Analyst.partitionConductance(PgxGraph graph, Partition<ID> components, Scalar<java.lang.Double> avgConductance, Scalar<java.lang.Double> minConductance) Blocking version of Analyst.partitionConductanceAsync(PgxGraph, Partition, Scalar, Scalar).
<ID> PgxFuture<Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>>>	Analyst.partitionConductanceAsync(PgxGraph graph, Partition<ID> partition) Compute the average and minimum conductance among all partitions in a vertex partition.
<ID> PgxFuture<Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>>>	Analyst.partitionConductanceAsync(PgxGraph graph, Partition<ID> partition, Scalar<java.lang.Double> avgConductance, Scalar<java.lang.Double> minConductance) Compute the average and minimum conductance among all partitions in a vertex partition.
<ID> Scalar<java.lang.Double>	Analyst.partitionModularity(PgxGraph graph, Partition<ID> components) Blocking version of Analyst.partitionConductanceAsync(PgxGraph, Partition).
<ID> Scalar<java.lang.Double>	Analyst.partitionModularity(PgxGraph graph, Partition<ID> components, Scalar<java.lang.Double> modularity) Blocking version of #partitionModularityAsync(PgxGraph, Partition, Scalar<Double>).
<ID> PgxFuture<Scalar<java.lang.Double>>	Analyst.partitionModularityAsync(PgxGraph graph, Partition<ID> partition) Compute the modularity of a partition.
<ID> PgxFuture<Scalar<java.lang.Double>>	Analyst.partitionModularityAsync(PgxGraph graph, Partition<ID> partition, Scalar<java.lang.Double> modularity) Compute the modularity of a partition.
<ID> PgxFuture<Scalar<java.lang.Double>>	Analyst.partitionModularityAsync(PgxGraph graph, Partition<ID> partition, java.lang.String modularityName)
<ID> VertexSet<ID>	Analyst.periphery(PgxGraph graph) Blocking version of Analyst.peripheryAsync(PgxGraph).
<ID> VertexSet<ID>	Analyst.periphery(PgxGraph graph, VertexSet<ID> periphery) Blocking version of Analyst.peripheryAsync(PgxGraph, VertexSet).
<ID> PgxFuture<VertexSet<ID>>	Analyst.peripheryAsync(PgxGraph graph) Computes the periphery of the (undirected) graph.
<ID> PgxFuture<VertexSet<ID>>	Analyst.peripheryAsync(PgxGraph graph, VertexSet<ID> periphery)
<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) Blocking version of Analyst.personalizedPagerankAsync(PgxGraph, PgxVertex).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, boolean norm) Blocking version of Analyst.personalizedPagerankAsync(PgxGraph, PgxVertex, boolean).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, boolean norm, VertexProperty<ID,java.lang.Double> rank) Blocking version of #personalizedPagerankAsync(PgxGraph, PgxVertex, boolean, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max) Blocking version of Analyst.personalizedPagerankAsync(PgxGraph, PgxVertex, double, double, int).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm) Blocking version of Analyst.personalizedPagerankAsync(PgxGraph, PgxVertex, double, double, int, boolean).
<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) Blocking version of #personalizedPagerankAsync(PgxGraph, PgxVertex, double, double, int, boolean, VertexProperty<ID, Double>).
<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) Blocking version of #personalizedPagerankAsync(PgxGraph, PgxVertex, double, double, int, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> rank) Blocking version of #personalizedPagerankAsync(PgxGraph, PgxVertex, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices) Blocking version of Analyst.personalizedPagerankAsync(PgxGraph, VertexSet).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm) Blocking version of Analyst.personalizedPagerankAsync(PgxGraph, VertexSet, boolean).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, VertexProperty<ID,java.lang.Double> rank) Blocking version of #personalizedPagerankAsync(PgxGraph, VertexSet, boolean, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max) Blocking version of Analyst.personalizedPagerankAsync(PgxGraph, VertexSet, double, double, int).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm) Blocking version of Analyst.personalizedPagerankAsync(PgxGraph, VertexSet, double, double, int, boolean).
<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) Blocking version of #personalizedPagerankAsync(PgxGraph, VertexSet, double, double, int, boolean, VertexProperty<ID, Double>).
<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) Blocking version of #personalizedPagerankAsync(PgxGraph, VertexSet, double, double, int, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> rank) Blocking version of #personalizedPagerankAsync(PgxGraph, VertexSet, VertexProperty<ID, Double>).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v) Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm) Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, VertexProperty<ID,java.lang.Double> rank) Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max) Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm) Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
<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) Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
<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) Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> rank) Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices) Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm) Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, VertexProperty<ID,java.lang.Double> rank) Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max) Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm) Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank) Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank) Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> rank) Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
<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) Blocking version of Analyst.personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, boolean, EdgeProperty).
<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) Blocking version of #personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, boolean, EdgeProperty,VertexProperty<ID, Double>).
<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) Blocking version of Analyst.personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, double, double, int, boolean, EdgeProperty).
<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) Blocking version of #personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, double, double, int, boolean, EdgeProperty, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, double, double, int, EdgeProperty).
<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) Blocking version of #personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, double, double, int, EdgeProperty, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, EdgeProperty) }.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Blocking version of #personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, EdgeProperty, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.personalizedWeightedPagerankAsync(PgxGraph, VertexSet, boolean, EdgeProperty).
<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) Blocking version of #personalizedWeightedPagerankAsync(PgxGraph, VertexSet, boolean, EdgeProperty,VertexProperty<ID, Double>).
<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) Blocking version of Analyst.personalizedWeightedPagerankAsync(PgxGraph, VertexSet, double, double, int, boolean, EdgeProperty).
<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) Blocking version of #personalizedWeightedPagerankAsync(PgxGraph, VertexSet, double, double, int, boolean, EdgeProperty, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.personalizedWeightedPagerankAsync(PgxGraph, VertexSet, double, double, int, EdgeProperty).
<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) Blocking version of #personalizedWeightedPagerankAsync(PgxGraph, VertexSet, double, double, int, EdgeProperty, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.personalizedWeightedPagerankAsync(PgxGraph, VertexSet, EdgeProperty).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Blocking version of #personalizedWeightedPagerankAsync(PgxGraph, VertexSet, EdgeProperty,VertexProperty<ID, Double>).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<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) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<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) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<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) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<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) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<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) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<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) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
EdgeProperty<java.lang.Boolean>	Analyst.prim(PgxGraph graph, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.primAsync(PgxGraph, EdgeProperty).
EdgeProperty<java.lang.Boolean>	Analyst.prim(PgxGraph graph, EdgeProperty<java.lang.Double> weight, EdgeProperty<java.lang.Boolean> mst) Blocking version of Analyst.primAsync(PgxGraph, EdgeProperty, EdgeProperty).
EdgeProperty<java.lang.Boolean>	Analyst.prim(PgxGraph graph, EdgeProperty<java.lang.Double> weight, java.lang.String mstName) Blocking version of Analyst.primAsync(PgxGraph, EdgeProperty, String).
PgxFuture<EdgeProperty<java.lang.Boolean>>	Analyst.primAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight) Computes the minimum spanning tree of a graph.
PgxFuture<EdgeProperty<java.lang.Boolean>>	Analyst.primAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight, EdgeProperty<java.lang.Boolean> mst) Computes the minimum spanning tree of a graph.
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>	Analyst.radius(PgxGraph graph) Blocking version of Analyst.radiusAsync(PgxGraph).
<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) Blocking version of Analyst.radiusAsync(PgxGraph, Scalar, VertexProperty).
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>>	Analyst.radiusAsync(PgxGraph graph) Computes the radius of the (undirected) 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) Computes the radius of the (undirected) graph.
<ID> Partition<ID>	Analyst.sccKosaraju(PgxGraph graph) Blocking version of Analyst.sccKosarajuAsync(PgxGraph).
<ID> Partition<ID>	Analyst.sccKosaraju(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution) Blocking version of #sccKosarajuAsync(PgxGraph, VertexProperty<ID, Long>).
<ID> PgxFuture<Partition<ID>>	Analyst.sccKosarajuAsync(PgxGraph graph) Find strongly connected components using Kosaraju's algorithm.
<ID> PgxFuture<Partition<ID>>	Analyst.sccKosarajuAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution) Find strongly connected components using Kosaraju's algorithm.
<ID> Partition<ID>	Analyst.sccTarjan(PgxGraph graph) Blocking version of Analyst.sccTarjanAsync(PgxGraph).
<ID> Partition<ID>	Analyst.sccTarjan(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution) Blocking version of #sccTarjanAsync(PgxGraph, VertexProperty<ID, Long>).
<ID> PgxFuture<Partition<ID>>	Analyst.sccTarjanAsync(PgxGraph graph) Find strongly connected components using Tarjan's algorithm.
<ID> PgxFuture<Partition<ID>>	Analyst.sccTarjanAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution) Find strongly connected components using Tarjan's algorithm.
void	PgxSession.setSnapshot(PgxGraph graph, GraphMetaData metaData) Blocking version of PgxSession.setSnapshotAsync(PgxGraph, GraphMetaData).
void	PgxSession.setSnapshot(PgxGraph graph, GraphMetaData metaData, boolean forceDeleteProperties) Blocking version of PgxSession.setSnapshotAsync(PgxGraph, GraphMetaData, boolean).
void	PgxSession.setSnapshot(PgxGraph graph, long creationTimestamp) Blocking version of PgxSession.setSnapshotAsync(PgxGraph, long).
void	PgxSession.setSnapshot(PgxGraph graph, long creationTimestamp, boolean forceDeleteProperties) Blocking version of PgxSession.setSnapshotAsync(PgxGraph, long, boolean).
PgxFuture<java.lang.Void>	PgxSession.setSnapshotAsync(PgxGraph graph, GraphMetaData metaData) Sets a graph to a specific snapshot.
PgxFuture<java.lang.Void>	PgxSession.setSnapshotAsync(PgxGraph graph, GraphMetaData metaData, boolean forceDeleteTransientProperties) Sets a graph to a specific snapshot.
PgxFuture<java.lang.Void>	PgxSession.setSnapshotAsync(PgxGraph graph, long creationTimestamp) Sets a graph to a specific snapshot.
PgxFuture<java.lang.Void>	PgxSession.setSnapshotAsync(PgxGraph graph, long creationTimestamp, boolean forceDeleteTransientProperties) Sets a graph to a specific snapshot.
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFord(PgxGraph graph, ID srcId, EdgeProperty<java.lang.Double> cost) Convenience wrapper around Analyst.shortestPathBellmanFord(PgxGraph, PgxVertex, EdgeProperty) 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) Blocking version of Analyst.shortestPathBellmanFordAsync(PgxGraph, PgxVertex, EdgeProperty).
<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) Blocking version of Analyst.shortestPathBellmanFordAsync(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty).
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost) Compute single source shortest paths using Bellman & Ford algorithm Time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length
<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) Compute single source shortest paths using Bellman & Ford algorithm Time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFordReverse(PgxGraph graph, ID srcId, EdgeProperty<java.lang.Double> cost) Convenience wrapper around Analyst.shortestPathBellmanFordReverse(PgxGraph, PgxVertex, EdgeProperty) 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) Blocking version of Analyst.shortestPathBellmanFordReverseAsync(PgxGraph, PgxVertex, EdgeProperty).
<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) Blocking version of Analyst.shortestPathBellmanFordReverseAsync(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty).
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost) Compute reverse single source shortest paths using Bellman & Ford algorithm Time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length
<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) Compute reverse single source shortest paths using Bellman & Ford algorithm Time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length
<ID> PgxPath<ID>	Analyst.shortestPathDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost) 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) Blocking version of Analyst.shortestPathDijkstraAsync(PgxGraph, PgxVertex, PgxVertex, EdgeProperty).
<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) Blocking version of Analyst.shortestPathDijkstraAsync(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, VertexProperty, VertexProperty).
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost) Compute shortest path using Dijkstra's algorithm.
<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) Compute shortest path using Dijkstra's algorithm.
<ID> PgxPath<ID>	Analyst.shortestPathDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost) 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) Blocking version of Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph, PgxVertex, PgxVertex, EdgeProperty).
<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) Blocking version of Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, VertexProperty, VertexProperty).
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost) Compute shortest path using a bi-directional Dijkstra variant.
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, java.lang.String parentName, java.lang.String parentEdgeName)
<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) Compute shortest path using a bi-directional Dijkstra variant.
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr) 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) Blocking version of Analyst.shortestPathFilteredDijkstraAsync(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter).
<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) Blocking version of Analyst.shortestPathFilteredDijkstraAsync(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter, VertexProperty, VertexProperty).
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr) Compute shortest path using Dijkstra's algorithm on a filtered graph The filter specified by the given filter expression is applied on each edge during traversal of the graph.
<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) Compute shortest path using Dijkstra's algorithm on a filtered graph The filter specified by the given filter expression is applied on each edge during traversal of the graph.
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr) 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) Blocking version of Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter).
<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) Blocking version of Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter, VertexProperty, VertexProperty).
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr) Compute shortest path using a bi-directional Dijkstra variant on a filtered graph.
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, java.lang.String parentName, java.lang.String parentEdgeName)
<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) Compute shortest path using a bi-directional Dijkstra variant on a filtered graph.
<ID> AllPaths<ID>	Analyst.shortestPathHopDist(PgxGraph graph, ID srcId) Convenience wrapper around Analyst.shortestPathHopDist(PgxGraph, PgxVertex) 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) Blocking version of Analyst.shortestPathHopDistAsync(PgxGraph, 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) Blocking version of Analyst.shortestPathHopDistAsync(PgxGraph, PgxVertex, VertexProperty, VertexProperty, VertexProperty).
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathHopDistAsync(PgxGraph graph, PgxVertex<ID> src) Compute hop-distance from given vertex to every other vertex Time complexity: O(E * d) with E = number of edges, d = diameter of graph
<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) Compute hop-distance from given vertex to every other vertex Time complexity: O(E * d) with E = number of edges, d = diameter of graph
<ID> AllPaths<ID>	Analyst.shortestPathHopDistReverse(PgxGraph graph, ID srcId) Convenience wrapper around Analyst.shortestPathHopDistReverse(PgxGraph, PgxVertex) 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) Blocking version of Analyst.shortestPathHopDistReverseAsync(PgxGraph, 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) Blocking version of Analyst.shortestPathHopDistReverseAsync(PgxGraph, PgxVertex, VertexProperty, VertexProperty, VertexProperty).
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathHopDistReverseAsync(PgxGraph graph, PgxVertex<ID> src) Compute reverse hop-distance from given vertex to every other vertex Time complexity: O(E * d) with E = number of edges, d = diameter of graph
<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) Compute reverse hop-distance from given vertex to every other vertex Time complexity: O(E * d) with E = number of edges, d = diameter of graph
<ID> VertexProperty<ID,java.lang.Double>	Analyst.vertexBetweennessCentrality(PgxGraph graph) Blocking version of Analyst.vertexBetweennessCentralityAsync(PgxGraph).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.vertexBetweennessCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc) Blocking version of #vertexBetweennessCentralityAsync(PgxGraph, VertexProperty<ID, Double>).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.vertexBetweennessCentralityAsync(PgxGraph graph) Compute vertex betweenness centrality (without considering edge length).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.vertexBetweennessCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc) Compute vertex betweenness centrality (without considering edge length).
<ID> Partition<ID>	Analyst.wcc(PgxGraph graph) Blocking version of Analyst.wccAsync(PgxGraph).
<ID> Partition<ID>	Analyst.wcc(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution) Blocking version of #wccAsync(PgxGraph, VertexProperty<ID, Long>).
<ID> PgxFuture<Partition<ID>>	Analyst.wccAsync(PgxGraph graph) Find weakly connected components through label propagation Time complexity: O(E * D) with E = number of edges, D = diameter of the graph
<ID> PgxFuture<Partition<ID>>	Analyst.wccAsync(PgxGraph graph, java.lang.String partitonDistributionName)
<ID> PgxFuture<Partition<ID>>	Analyst.wccAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution) Find weakly connected components through label propagation Time complexity: O(E * D) with E = number of edges, D = diameter of the graph
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.weightedPagerankAsync(PgxGraph, boolean, EdgeProperty).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Blocking version of #weightedPagerankAsync(PgxGraph, boolean, EdgeProperty, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.weightedPagerankAsync(PgxGraph, double, double, int, boolean, EdgeProperty).
<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) Blocking version of #weightedPagerankAsync(PgxGraph, double, double, int, boolean, EdgeProperty, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.weightedPagerankAsync(PgxGraph, double, double, int, EdgeProperty).
<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) Blocking version of #weightedPagerankAsync(PgxGraph, double, double, int, EdgeProperty, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.weightedPagerankAsync(PgxGraph, EdgeProperty).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Blocking version of #weightedPagerankAsync(PgxGraph, EdgeProperty, VertexProperty<ID, Double>).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight) Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight) Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
<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) Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight) Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
<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) Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight) Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, ID vertexId, int max) Convenience wrapper around Analyst.whomToFollow(PgxGraph, PgxVertex, int) taking a vertex ID instead of a PgxVertex.
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, ID vertexId, int max, int circleOfTrustSize, int randomWalkSteps, java.math.BigDecimal randomWalkResetProbablitiy, java.math.BigDecimal salsaDampingFactor, int salsaMaxIterations, java.math.BigDecimal salsaMaxDiff) Convenience wrapper around Analyst.whomToFollow(PgxGraph, PgxVertex, int, int, int, BigDecimal, BigDecimal, int, BigDecimal) taking a vertex ID instead of a PgxVertex.
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, ID vertexId, int max, int circleOfTrustSize, int randomWalkSteps, java.math.BigDecimal randomWalkResetProbablitiy, java.math.BigDecimal salsaDampingFactor, int salsaMaxIterations, java.math.BigDecimal salsaMaxDiff, VertexSequence<ID> hubs, VertexSequence<ID> authorities) Convenience wrapper around Analyst.whomToFollow(PgxGraph, PgxVertex, int, int, int, BigDecimal, BigDecimal, int, BigDecimal, VertexSequence, VertexSequence) taking a vertex ID instead of a PgxVertex.
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, PgxVertex<ID> vertex) Blocking version of Analyst.whomToFollowAsync(PgxGraph, PgxVertex).
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int max) Blocking version of Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int).
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int max, int circleOfTrustSize, int randomWalkSteps, double randomWalkResetProbablitiy, double salsaDampingFactor, int salsaMaxIterations, double salsaMaxDiff) Blocking version of Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int, int, int, double, double, int, double).
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int max, int circleOfTrustSize, int randomWalkSteps, double randomWalkResetProbablitiy, double salsaDampingFactor, int salsaMaxIterations, double salsaMaxDiff, VertexSequence<ID> hubs, VertexSequence<ID> authorities) Blocking version of Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int, int, int, double, double, int, double, VertexSequence, VertexSequence).
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int max, VertexSequence<ID> hubs, VertexSequence<ID> authorities) Blocking version of Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int, VertexSequence, VertexSequence).
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, VertexSequence<ID> hubs, VertexSequence<ID> authorities) Blocking version of Analyst.whomToFollowAsync(PgxGraph, PgxVertex, VertexSequence, VertexSequence).
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex) Convenience method around Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int, int, int, double, double, int, double) using max = 100 circleOfTrustSize = 500 randomWalkSteps = 50000 randomWalkResetProbablitiy = 0.15 salsaDampingFactor = 0.85 salsaMaxIterations = 1000 salsaMaxDiff = 0.01
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int max) Convenience method around Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int, int, int, double, double, int, double) using circleOfTrustSize = 500 randomWalkSteps = 50000 randomWalkResetProbablitiy = 0.15 salsaDampingFactor = 0.85 salsaMaxIterations = 1000 salsaMaxDiff = 0.01
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int max, int circleOfTrustSize, int randomWalkSteps, double randomWalkResetProbablitiy, double salsaDampingFactor, int salsaMaxIterations, double salsaMaxDiff) The Who to Follow recommendation algorithm by Twitter, Inc.
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int max, int circleOfTrustSize, int randomWalkSteps, double randomWalkResetProbablitiy, double salsaDampingFactor, int salsaMaxIterations, double salsaMaxDiff, VertexSequence<ID> hubs, VertexSequence<ID> authorities) The Who to Follow recommendation algorithm by Twitter, Inc.
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int max, VertexSequence<ID> hubs, VertexSequence<ID> authorities) Convenience method around Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int, int, int, double, double, int, double, VertexSequence, VertexSequence) using circleOfTrustSize = 500 randomWalkSteps = 50000 randomWalkResetProbablitiy = 0.15 salsaDampingFactor = 0.85 salsaMaxIterations = 1000 salsaMaxDiff = 0.01
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, VertexSequence<ID> hubs, VertexSequence<ID> authorities) Convenience method around Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int, int, int, double, double, int, double, VertexSequence, VertexSequence) using circleOfTrustSize = 100 circleOfTrustSize = 500 randomWalkSteps = 50000 randomWalkResetProbablitiy = 0.15 salsaDampingFactor = 0.85 salsaMaxIterations = 1000 salsaMaxDiff = 0.01

Constructors in oracle.pgx.api with parameters of type PgxGraph

Constructor and Description
ComponentCollection(PgxGraph graph, java.lang.String collectionNamespace, long id)
EdgeLabel(PgxGraph graph, oracle.pgx.api.internal.Property pr)
VertexLabels(PgxGraph graph, oracle.pgx.api.internal.Property pr)