<V> EdgeProperty<java.lang.Double> |
Analyst.adamicAdarCounting(PgxGraph graph) |
The adamic-adar index compares the amount of neighbors shared between vertices, this measure can be used with communities.
|
<V> EdgeProperty<java.lang.Double> |
Analyst.adamicAdarCounting(PgxGraph graph,
EdgeProperty<java.lang.Double> aa) |
The adamic-adar index compares the amount of neighbors shared between vertices, this measure can be used with communities.
|
PgxFuture<EdgeProperty<java.lang.Double>> |
Analyst.adamicAdarCountingAsync(PgxGraph graph) |
The adamic-adar index compares the amount of neighbors shared between vertices, this measure can be used with communities.
|
PgxFuture<EdgeProperty<java.lang.Double>> |
Analyst.adamicAdarCountingAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> aa) |
The adamic-adar index compares the amount of neighbors shared between vertices, this measure can be used with communities.
|
<ID> org.apache.commons.lang3.tuple.Triple<VertexSet<ID>,EdgeSet,PgxMap<PgxVertex<ID>,java.lang.Integer>> |
Analyst.allReachableVerticesEdges(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int k) |
Finds all the vertices and edges on a path between the src and target of length smaller or equal to k.
|
<ID> PgxFuture<org.apache.commons.lang3.tuple.Triple<VertexSet<ID>,EdgeSet,PgxMap<PgxVertex<ID>,java.lang.Integer>>> |
Analyst.allReachableVerticesEdgesAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int k) |
Finds all the vertices and edges on a path between the src and target of length smaller or equal to k.
|
<ID> org.apache.commons.lang3.tuple.Triple<VertexSet<ID>,EdgeSet,PgxMap<PgxVertex<ID>,java.lang.Integer>> |
Analyst.allReachableVerticesEdgesFiltered(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int k,
EdgeFilter filter) |
Finds all the vertices and edges on a path between the src and target of length smaller or equal to k.
|
<ID> PgxFuture<org.apache.commons.lang3.tuple.Triple<VertexSet<ID>,EdgeSet,PgxMap<PgxVertex<ID>,java.lang.Integer>>> |
Analyst.allReachableVerticesEdgesFilteredAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int k,
EdgeFilter filter) |
Finds all the vertices and edges on a path between the src and target of length smaller or equal to k.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.approximateVertexBetweennessCentrality(PgxGraph graph,
int k) |
Faster, but less accurate than betweenness centrality, it identifies important vertices for the flow of information
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.approximateVertexBetweennessCentrality(PgxGraph graph,
int k,
VertexProperty<ID,java.lang.Double> bc) |
Faster, but less accurate than betweenness centrality, it identifies important vertices for the flow of information
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph graph,
int k) |
Faster, but less accurate than betweenness centrality, it identifies important vertices for the flow of information
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph graph,
int k,
VertexProperty<ID,java.lang.Double> bc) |
Faster, but less accurate than betweenness centrality, it identifies important vertices for the flow of information
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.approximateVertexBetweennessCentralityFromSeeds(PgxGraph graph,
PgxVertex<ID>... seeds) |
Faster, but less accurate than betweenness centrality, it identifies important vertices for the flow of information
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.approximateVertexBetweennessCentralityFromSeeds(PgxGraph graph,
VertexProperty<ID,java.lang.Double> bc,
PgxVertex<ID>... seeds) |
Faster, but less accurate than betweenness centrality, it identifies important vertices for the flow of information
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph,
PgxVertex<ID>... seeds) |
Faster, but less accurate than betweenness centrality, it identifies important vertices for the flow of information
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> bc,
PgxVertex<ID>... seeds) |
Faster, but less accurate than betweenness centrality, it identifies important vertices for the flow of information
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.articleRank(PgxGraph graph) |
ArticleRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.articleRank(PgxGraph graph,
boolean norm) |
ArticleRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.articleRank(PgxGraph graph,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
ArticleRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.articleRank(PgxGraph graph,
double e,
double d,
int max) |
ArticleRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.articleRank(PgxGraph graph,
double e,
double d,
int max,
boolean norm) |
ArticleRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.articleRank(PgxGraph graph,
double e,
double d,
int max,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
ArticleRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.articleRank(PgxGraph graph,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank) |
ArticleRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.articleRank(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank) |
ArticleRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.articleRankAsync(PgxGraph graph) |
ArticleRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.articleRankAsync(PgxGraph graph,
boolean norm) |
ArticleRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.articleRankAsync(PgxGraph graph,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
ArticleRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.articleRankAsync(PgxGraph graph,
double e,
double d,
int max) |
ArticleRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.articleRankAsync(PgxGraph graph,
double e,
double d,
int max,
boolean norm) |
ArticleRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.articleRankAsync(PgxGraph graph,
double e,
double d,
int max,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
ArticleRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.articleRankAsync(PgxGraph graph,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank) |
ArticleRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.articleRankAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank) |
ArticleRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Boolean> |
Analyst.bipartiteCheck(PgxGraph graph,
VertexProperty<ID,java.lang.Boolean> isLeft) |
Bipartite check verifies whether are graph is a bipartite graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Boolean>> |
Analyst.bipartiteCheckAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Boolean> isLeft) |
Bipartite check verifies whether are graph is a bipartite graph.
|
<ID> VertexSet<ID> |
Analyst.center(PgxGraph graph) |
Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
|
<ID> VertexSet<ID> |
Analyst.center(PgxGraph graph,
VertexSet<ID> center) |
Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
|
<ID> PgxFuture<VertexSet<ID>> |
Analyst.centerAsync(PgxGraph graph) |
Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
|
<ID> PgxFuture<VertexSet<ID>> |
Analyst.centerAsync(PgxGraph graph,
VertexSet<ID> center) |
Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.closenessCentralityDoubleLength(PgxGraph graph,
EdgeProperty<java.lang.Double> cost) |
Closeness centrality measures the centrality of the vertices based on weighted distances, allowing to find well-connected vertices
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.closenessCentralityDoubleLength(PgxGraph graph,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,java.lang.Double> cc) |
Closeness centrality measures the centrality of the vertices based on weighted distances, allowing to find well-connected vertices
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> cost) |
Closeness centrality measures the centrality of the vertices based on weighted distances, allowing to find well-connected vertices
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,java.lang.Double> cc) |
Closeness centrality measures the centrality of the vertices based on weighted distances, allowing to find well-connected vertices
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.closenessCentralityUnitLength(PgxGraph graph) |
Closeness centrality measures the centrality of the vertices based on distances, allowing to find well-connected vertices
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.closenessCentralityUnitLength(PgxGraph graph,
VertexProperty<ID,java.lang.Double> cc) |
Closeness centrality measures the centrality of the vertices based on distances, allowing to find well-connected vertices
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityUnitLengthAsync(PgxGraph graph) |
Closeness centrality measures the centrality of the vertices based on distances, allowing to find well-connected vertices
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityUnitLengthAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> cc) |
Closeness centrality measures the centrality of the vertices based on distances, allowing to find well-connected vertices
|
<ID> Partition<ID> |
Analyst.communitiesConductanceMinimization(PgxGraph graph) |
Soman and Narang can find communities in a graph taking weighted edges into account
|
<ID> Partition<ID> |
Analyst.communitiesConductanceMinimization(PgxGraph graph,
int maxIterations) |
Soman and Narang can find communities in a graph taking weighted edges into account
|
<ID> Partition<ID> |
Analyst.communitiesConductanceMinimization(PgxGraph graph,
int maxIterations,
VertexProperty<ID,java.lang.Long> partitionDistribution) |
Soman and Narang can find communities in a graph taking weighted edges into account
|
<ID> Partition<ID> |
Analyst.communitiesConductanceMinimization(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution) |
Soman and Narang can find communities in a graph taking weighted edges into account
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph) |
Soman and Narang can find communities in a graph taking weighted edges into account
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph,
int max) |
Soman and Narang can find communities in a graph taking weighted edges into account
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph,
int maxIterations,
VertexProperty<ID,java.lang.Long> partitionDistribution) |
Soman and Narang can find communities in a graph taking weighted edges into account
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution) |
Soman and Narang can find communities in a graph taking weighted edges into account
|
<ID> Partition<ID> |
Analyst.communitiesInfomap(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight) |
Infomap can find high quality communities in a graph.
|
<ID> Partition<ID> |
Analyst.communitiesInfomap(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight,
double tau,
double tol,
int maxIter) |
Infomap can find high quality communities in a graph.
|
<ID> Partition<ID> |
Analyst.communitiesInfomap(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight,
double tau,
double tol,
int maxIter,
VertexProperty<ID,java.lang.Long> module) |
Infomap can find high quality communities in a graph.
|
<ID> Partition<ID> |
Analyst.communitiesInfomap(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Long> module) |
Infomap can find high quality communities in a graph.
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesInfomapAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight) |
Infomap can find high quality communities in a graph.
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesInfomapAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight,
double tau,
double tol,
int maxIter) |
Infomap can find high quality communities in a graph.
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesInfomapAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight,
double tau,
double tol,
int maxIter,
VertexProperty<ID,java.lang.Long> module) |
Infomap can find high quality communities in a graph.
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesInfomapAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Long> module) |
Infomap can find high quality communities in a graph.
|
<ID> Partition<ID> |
Analyst.communitiesLabelPropagation(PgxGraph graph) |
Label propagation can find communities in a graph relatively fast
|
<ID> Partition<ID> |
Analyst.communitiesLabelPropagation(PgxGraph graph,
int maxIterations) |
Label propagation can find communities in a graph relatively fast
|
<ID> Partition<ID> |
Analyst.communitiesLabelPropagation(PgxGraph graph,
int maxIterations,
VertexProperty<ID,java.lang.Long> partitionDistribution) |
Label propagation can find communities in a graph relatively fast
|
<ID> Partition<ID> |
Analyst.communitiesLabelPropagation(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitonDistribution) |
Label propagation can find communities in a graph relatively fast
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesLabelPropagationAsync(PgxGraph graph) |
Label propagation can find communities in a graph relatively fast
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesLabelPropagationAsync(PgxGraph graph,
int maxIterations) |
Label propagation can find communities in a graph relatively fast
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesLabelPropagationAsync(PgxGraph graph,
int maxIterations,
VertexProperty<ID,java.lang.Long> partitionDistribution) |
Label propagation can find communities in a graph relatively fast
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesLabelPropagationAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution) |
Label propagation can find communities in a graph relatively fast
|
<ID> Pair<PgxMap<java.lang.Integer,PgxVertex<ID>>,VertexSet<ID>> |
Analyst.computeHighDegreeVertices(PgxGraph graph,
int k) |
Computes the k vertices with the highest degrees in the graph.
|
<ID> Pair<PgxMap<java.lang.Integer,PgxVertex<ID>>,VertexSet<ID>> |
Analyst.computeHighDegreeVertices(PgxGraph graph,
int k,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices) |
Computes the k vertices with the highest degrees in the graph.
|
<ID> PgxFuture<Pair<PgxMap<java.lang.Integer,PgxVertex<ID>>,VertexSet<ID>>> |
Analyst.computeHighDegreeVerticesAsync(PgxGraph graph,
int k) |
Computes the k vertices with the highest degrees in the graph.
|
<ID> PgxFuture<Pair<PgxMap<java.lang.Integer,PgxVertex<ID>>,VertexSet<ID>>> |
Analyst.computeHighDegreeVerticesAsync(PgxGraph graph,
int k,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices) |
Computes the k vertices with the highest degrees in the graph.
|
<ID> Scalar<java.lang.Double> |
Analyst.conductance(PgxGraph graph,
Partition<ID> partition,
long partitionIndex) |
Conductance assesses the quality of a partition in a graph
|
<ID> Scalar<java.lang.Double> |
Analyst.conductance(PgxGraph graph,
Partition<ID> partition,
long partitionIndex,
Scalar<java.lang.Double> conductance) |
Conductance assesses the quality of a partition in a graph
|
<ID> PgxFuture<Scalar<java.lang.Double>> |
Analyst.conductanceAsync(PgxGraph graph,
Partition<ID> partition,
long partitionIndex) |
Conductance assesses the quality of a partition in a graph
|
<ID> PgxFuture<Scalar<java.lang.Double>> |
Analyst.conductanceAsync(PgxGraph graph,
Partition<ID> partition,
long partitionIndex,
Scalar<java.lang.Double> conductance) |
Conductance assesses the quality of a partition in a graph
|
long |
Analyst.countTriangles(PgxGraph graph,
boolean sortVerticesByDegree) |
triangle counting gives an overview of the amount of connections between vertices in neighborhoods
|
PgxFuture<java.lang.Long> |
Analyst.countTrianglesAsync(PgxGraph graph,
boolean sortVerticesByDegree) |
triangle counting gives an overview of the amount of connections between vertices in neighborhoods
|
<ID> VertexProperty<ID,PgxVect<java.lang.Integer>> |
Analyst.createDistanceIndex(PgxGraph graph,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices) |
Computes an index with distances to each high-degree vertex.
|
<ID> VertexProperty<ID,PgxVect<java.lang.Integer>> |
Analyst.createDistanceIndex(PgxGraph graph,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index) |
Computes an index with distances to each high-degree vertex.
|
<ID> PgxFuture<VertexProperty<ID,PgxVect<java.lang.Integer>>> |
Analyst.createDistanceIndexAsync(PgxGraph graph,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices) |
Computes an index with distances to each high-degree vertex.
|
<ID> PgxFuture<VertexProperty<ID,PgxVect<java.lang.Integer>>> |
Analyst.createDistanceIndexAsync(PgxGraph graph,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index) |
Computes an index with distances to each high-degree vertex.
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.degreeCentrality(PgxGraph graph) |
Degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.degreeCentrality(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> dc) |
Degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.degreeCentralityAsync(PgxGraph graph) |
Degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<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) |
Degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> |
Analyst.diameter(PgxGraph graph) |
Diameter/radius gives an overview of the distances in a graph
|
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> |
Analyst.diameter(PgxGraph graph,
Scalar<java.lang.Integer> diameter,
VertexProperty<ID,java.lang.Integer> eccentricity) |
Diameter/radius gives an overview of the distances in a graph
|
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
Analyst.diameterAsync(PgxGraph graph) |
Diameter/radius gives an overview of the distances in a graph
|
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
Analyst.diameterAsync(PgxGraph graph,
Scalar<java.lang.Integer> diameter,
VertexProperty<ID,java.lang.Integer> eccentricity) |
Diameter/radius gives an overview of the distances in a graph
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.eigenvectorCentrality(PgxGraph graph) |
Eigenvector centrality gets the centrality of the vertices in an intricate way using neighbors, allowing to find well-connected vertices
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.eigenvectorCentrality(PgxGraph graph,
int max,
double maxDiff,
boolean useL2Norm,
boolean useInEdge) |
Eigenvector centrality gets the centrality of the vertices in an intricate way using neighbors, allowing to find well-connected vertices
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.eigenvectorCentrality(PgxGraph graph,
int max,
double maxDiff,
boolean useL2Norm,
boolean useInEdge,
VertexProperty<ID,java.lang.Double> ec) |
Eigenvector centrality gets the centrality of the vertices in an intricate way using neighbors, allowing to find well-connected vertices
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.eigenvectorCentrality(PgxGraph graph,
VertexProperty<ID,java.lang.Double> ec) |
Eigenvector centrality gets the centrality of the vertices in an intricate way using neighbors, allowing to find well-connected vertices
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.eigenvectorCentralityAsync(PgxGraph graph) |
Eigenvector centrality gets the centrality of the vertices in an intricate way using neighbors, allowing to find well-connected vertices
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.eigenvectorCentralityAsync(PgxGraph graph,
int max,
double maxDiff,
boolean useL2Norm,
boolean useInEdge) |
Eigenvector centrality gets the centrality of the vertices in an intricate way using neighbors, allowing to find well-connected vertices
|
<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) |
Eigenvector centrality gets the centrality of the vertices in an intricate way using neighbors, allowing to find well-connected vertices
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.eigenvectorCentralityAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> ec) |
Eigenvector centrality gets the centrality of the vertices in an intricate way using neighbors, allowing to find well-connected vertices
|
<ID> org.apache.commons.lang3.tuple.Triple<ScalarSequence<java.lang.Integer>,VertexSequence<ID>,EdgeSequence> |
Analyst.enumerateSimplePaths(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int k,
VertexSet verticesOnPath,
EdgeSet edgesOnPath,
PgxMap<PgxVertex<ID>,java.lang.Integer> dist) |
Enumerate all simple paths between the source and destination vertex
|
<ID> PgxFuture<org.apache.commons.lang3.tuple.Triple<ScalarSequence<java.lang.Integer>,VertexSequence<ID>,EdgeSequence>> |
Analyst.enumerateSimplePathsAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int k,
VertexSet verticesOnPath,
EdgeSet edgesOnPath,
PgxMap<PgxVertex<ID>,java.lang.Integer> dist) |
Enumerate all simple paths between the source and destination vertex
|
<ID> AllPaths<ID> |
Analyst.fattestPath(PgxGraph graph,
ID rootId,
EdgeProperty<java.lang.Double> capacity) |
|
<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) |
|
<ID> AllPaths<ID> |
Analyst.fattestPath(PgxGraph graph,
PgxVertex<ID> root,
EdgeProperty<java.lang.Double> capacity) |
Fattest path is a fast algorithm for finding a shortest path adding constraints for flowing related matters
|
<ID> AllPaths<ID> |
Analyst.fattestPath(PgxGraph graph,
PgxVertex<ID> root,
EdgeProperty<java.lang.Double> capacity,
boolean ignoreEdgeDirection) |
Undirected Fattest path is variation of the fattest graph algorithm that ignores edge directions.
|
<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) |
Fattest path is a fast algorithm for finding a shortest path adding constraints for flowing related matters
|
<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,
boolean ignoreEdgeDirection) |
Undirected Fattest path is variation of the fattest graph algorithm that ignores edge directions.
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.fattestPathAsync(PgxGraph graph,
PgxVertex<ID> root,
EdgeProperty<java.lang.Double> capacity) |
Fattest path is a fast algorithm for finding a shortest path adding constraints for flowing related matters
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.fattestPathAsync(PgxGraph graph,
PgxVertex<ID> root,
EdgeProperty<java.lang.Double> capacity,
boolean ignoreEdgeDirection) |
Undirected Fattest path is variation of the fattest graph algorithm that ignores edge directions.
|
<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 path is a fast algorithm for finding a shortest path adding constraints for flowing related matters
|
<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,
boolean ignoreEdgeDirection) |
Undirected Fattest path is variation of the fattest graph algorithm that ignores edge directions.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
ID root) |
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
ID root,
int maxDepth) |
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root) |
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
int maxDepth) |
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator) |
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf) |
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
int maxDepth) |
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent) |
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent) |
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
int maxDepth) |
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root) |
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
int maxDepth) |
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator) |
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf) |
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
int maxDepth) |
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent) |
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent) |
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
int maxDepth) |
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
ID root) |
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
ID root,
int maxDepth) |
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root) |
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
int maxDepth) |
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator) |
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf) |
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
int maxDepth) |
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent) |
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent) |
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
int maxDepth) |
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root) |
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
int maxDepth) |
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator) |
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf) |
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
int maxDepth) |
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent) |
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent) |
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
int maxDepth) |
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> VertexProperty<ID,java.lang.String> |
Analyst.filteredSpeakerListenerLabelPropagation(PgxGraph graph,
java.lang.String labelsPropName,
int maxIter,
double threshold,
java.lang.String delimiter,
EdgeFilter filter) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> VertexProperty<ID,java.lang.String> |
Analyst.filteredSpeakerListenerLabelPropagation(PgxGraph graph,
java.lang.String labelsPropName,
EdgeFilter filter) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> VertexProperty<ID,java.lang.String> |
Analyst.filteredSpeakerListenerLabelPropagation(PgxGraph graph,
VertexProperty<ID,java.lang.String> labels,
int maxIter,
double threshold,
java.lang.String delimiter,
EdgeFilter filter) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.String>> |
Analyst.filteredSpeakerListenerLabelPropagationAsync(PgxGraph graph,
java.lang.String labelsPropName,
int maxIter,
double threshold,
java.lang.String delimiter,
EdgeFilter filter) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.String>> |
Analyst.filteredSpeakerListenerLabelPropagationAsync(PgxGraph graph,
java.lang.String labelsPropName,
EdgeFilter filter) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.String>> |
Analyst.filteredSpeakerListenerLabelPropagationAsync(PgxGraph graph,
VertexProperty<ID,java.lang.String> labels,
int maxIter,
double threshold,
java.lang.String delimiter,
EdgeFilter filter) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> VertexProperty<ID,java.lang.String> |
Analyst.filteredWeightedSpeakerListenerLabelPropagation(PgxGraph graph,
java.lang.String labelsPropName,
int maxIter,
double threshold,
java.lang.String delimiter,
EdgeProperty<java.lang.Double> weight,
EdgeFilter filter) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> VertexProperty<ID,java.lang.String> |
Analyst.filteredWeightedSpeakerListenerLabelPropagation(PgxGraph graph,
java.lang.String labelsPropName,
EdgeProperty<java.lang.Double> weight,
EdgeFilter filter) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> VertexProperty<ID,java.lang.String> |
Analyst.filteredWeightedSpeakerListenerLabelPropagation(PgxGraph graph,
VertexProperty<ID,java.lang.String> labels,
int maxIter,
double threshold,
java.lang.String delimiter,
EdgeProperty<java.lang.Double> weight,
EdgeFilter filter) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.String>> |
Analyst.filteredWeightedSpeakerListenerLabelPropagationAsync(PgxGraph graph,
java.lang.String labelsPropName,
int maxIter,
double threshold,
java.lang.String delimiter,
EdgeProperty<java.lang.Double> weight,
EdgeFilter filter) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.String>> |
Analyst.filteredWeightedSpeakerListenerLabelPropagationAsync(PgxGraph graph,
java.lang.String labelsPropName,
EdgeProperty<java.lang.Double> weight,
EdgeFilter filter) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.String>> |
Analyst.filteredWeightedSpeakerListenerLabelPropagationAsync(PgxGraph graph,
VertexProperty<ID,java.lang.String> labels,
int maxIter,
double threshold,
java.lang.String delimiter,
EdgeProperty<java.lang.Double> weight,
EdgeFilter filter) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> PgxPath<ID> |
Analyst.findCycle(PgxGraph graph) |
Find cycle looks for any loop in the graph.
|
<ID> PgxPath<ID> |
Analyst.findCycle(PgxGraph graph,
PgxVertex<ID> src) |
Find cycle looks for any loop in the graph.
|
<ID> PgxPath<ID> |
Analyst.findCycle(PgxGraph graph,
PgxVertex<ID> src,
VertexSequence<ID> nodeSeq,
EdgeSequence edgeSeq) |
Find cycle looks for any loop in the graph.
|
<ID> PgxPath<ID> |
Analyst.findCycle(PgxGraph graph,
VertexSequence<ID> nodeSeq,
EdgeSequence edgeSeq) |
Find cycle looks for any loop in the graph.
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.findCycleAsync(PgxGraph graph) |
Find cycle looks for any loop in the graph.
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.findCycleAsync(PgxGraph graph,
PgxVertex<ID> src) |
Find cycle looks for any loop in the graph.
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.findCycleAsync(PgxGraph graph,
PgxVertex<ID> src,
VertexSequence<ID> nodeSeq,
EdgeSequence edgeSeq) |
Find cycle looks for any loop in the graph.
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.findCycleAsync(PgxGraph graph,
VertexSequence<ID> nodeSeq,
EdgeSequence edgeSeq) |
Find cycle looks for any loop in the graph.
|
java.util.Deque<GraphMetaData> |
PgxSession.getAvailableSnapshots(PgxGraph snapshot) |
|
PgxFuture<java.util.Deque<GraphMetaData>> |
PgxSession.getAvailableSnapshotsAsync(PgxGraph graph) |
Gets a list of the GraphMetaData information of available in-memory snapshots of graph. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.harmonicCentrality(PgxGraph graph) |
Harmonic centrality measures node importance by considering the reciprocal of the sum of shortest path distances in the network.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.harmonicCentrality(PgxGraph graph,
VertexProperty<ID,java.lang.Double> hc) |
Harmonic centrality measures node importance by considering the reciprocal of the sum of shortest path distances in the network.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.harmonicCentralityAsync(PgxGraph graph) |
Harmonic centrality measures node importance by considering the reciprocal of the sum of shortest path distances in the network.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.harmonicCentralityAsync(PgxGraph graph,
java.lang.String propertyName) |
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.harmonicCentralityAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> hc) |
Harmonic centrality measures node importance by considering the reciprocal of the sum of shortest path distances in the network.
|
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
Analyst.hits(PgxGraph graph) |
HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
|
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
Analyst.hits(PgxGraph graph,
int max) |
HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
|
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
Analyst.hits(PgxGraph graph,
int max,
VertexProperty<ID,java.lang.Double> auth,
VertexProperty<ID,java.lang.Double> hubs) |
HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
|
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
Analyst.hits(PgxGraph graph,
VertexProperty<ID,java.lang.Double> auth,
VertexProperty<ID,java.lang.Double> hubs) |
HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph) |
HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph,
int max) |
HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph,
int max,
VertexProperty<ID,java.lang.Double> auth,
VertexProperty<ID,java.lang.Double> hubs) |
HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> auth,
VertexProperty<ID,java.lang.Double> hubs) |
HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.inDegreeCentrality(PgxGraph graph) |
In-degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.inDegreeCentrality(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> dc) |
In-degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.inDegreeCentralityAsync(PgxGraph graph) |
In-degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<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) |
In-degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
PgxMap<java.lang.Integer,java.lang.Long> |
Analyst.inDegreeDistribution(PgxGraph graph) |
In-degree distribution gives information about the incoming flows in a graph
|
PgxMap<java.lang.Integer,java.lang.Long> |
Analyst.inDegreeDistribution(PgxGraph graph,
PgxMap<java.lang.Integer,java.lang.Long> distribution) |
In-degree distribution gives information about the incoming flows in a graph
|
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> |
Analyst.inDegreeDistributionAsync(PgxGraph graph) |
In-degree distribution gives information about the incoming flows in a graph
|
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> |
Analyst.inDegreeDistributionAsync(PgxGraph graph,
PgxMap<java.lang.Integer,java.lang.Long> distribution) |
In-degree distribution gives information about the incoming flows in a graph
|
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> |
Analyst.kcore(PgxGraph graph) |
k-core decomposes a graph into layers revealing subgraphs with particular properties
|
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> |
Analyst.kcore(PgxGraph graph,
int minCore,
int maxCore) |
k-core decomposes a graph into layers revealing subgraphs with particular properties
|
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> |
Analyst.kcore(PgxGraph graph,
int minCore,
int maxCore,
Scalar<java.lang.Long> maxKCore,
VertexProperty<ID,java.lang.Long> kcore) |
k-core decomposes a graph into layers revealing subgraphs with particular properties
|
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> |
Analyst.kcore(PgxGraph graph,
Scalar<java.lang.Long> maxKCore,
VertexProperty<ID,java.lang.Long> kcore) |
k-core decomposes a graph into layers revealing subgraphs with particular properties
|
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
Analyst.kcoreAsync(PgxGraph graph) |
k-core decomposes a graph into layers revealing subgraphs with particular properties
|
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
Analyst.kcoreAsync(PgxGraph graph,
int minCore,
int maxCore) |
k-core decomposes a graph into layers revealing subgraphs with particular properties
|
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
Analyst.kcoreAsync(PgxGraph graph,
int minCore,
int maxCore,
Scalar<java.lang.Long> maxKCore,
VertexProperty<ID,java.lang.Long> kcore) |
k-core decomposes a graph into layers revealing subgraphs with particular properties
|
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
Analyst.kcoreAsync(PgxGraph graph,
Scalar<java.lang.Long> maxKCore,
VertexProperty<ID,java.lang.Long> kcore) |
k-core decomposes a graph into layers revealing subgraphs with particular properties
|
<ID> Pair<VertexSequence<ID>,EdgeSequence> |
Analyst.limitedShortestPathHopDist(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index) |
Computes the k-hop limited shortest path between two vertices.
|
<ID> Pair<VertexSequence<ID>,EdgeSequence> |
Analyst.limitedShortestPathHopDist(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index,
VertexSequence<ID> pathVertices,
EdgeSequence pathEdges) |
Computes the k-hop limited shortest path between two vertices.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>> |
Analyst.limitedShortestPathHopDistAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index) |
Computes the k-hop limited shortest path between two vertices.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>> |
Analyst.limitedShortestPathHopDistAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index,
VertexSequence<ID> pathVertices,
EdgeSequence pathEdges) |
Computes the k-hop limited shortest path between two vertices.
|
<ID> Pair<VertexSequence<ID>,EdgeSequence> |
Analyst.limitedShortestPathHopDistFiltered(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index,
EdgeFilter filter) |
Computes the k-hop limited shortest path between two vertices.
|
<ID> Pair<VertexSequence<ID>,EdgeSequence> |
Analyst.limitedShortestPathHopDistFiltered(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index,
EdgeFilter filter,
VertexSequence<ID> pathVertices,
EdgeSequence pathEdges) |
Computes the k-hop limited shortest path between two vertices.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>> |
Analyst.limitedShortestPathHopDistFilteredAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index,
EdgeFilter filter) |
Computes the k-hop limited shortest path between two vertices.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>> |
Analyst.limitedShortestPathHopDistFilteredAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index,
EdgeFilter filter,
VertexSequence<ID> pathVertices,
EdgeSequence pathEdges) |
Computes the k-hop limited shortest path between two vertices.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.localClusteringCoefficient(PgxGraph graph) |
LCC gives information about potential clustering options in a graph
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.localClusteringCoefficient(PgxGraph graph,
boolean ignoreEdgeDirection) |
LCC gives information about potential clustering options in a graph
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.localClusteringCoefficient(PgxGraph graph,
VertexProperty<ID,java.lang.Double> lcc) |
LCC gives information about potential clustering options in a graph
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.localClusteringCoefficient(PgxGraph graph,
VertexProperty<ID,java.lang.Double> lcc,
boolean ignoreEdgeDirection) |
LCC gives information about potential clustering options in a graph
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.localClusteringCoefficientAsync(PgxGraph graph) |
LCC gives information about potential clustering options in a graph
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.localClusteringCoefficientAsync(PgxGraph graph,
boolean ignoreEdgeDirection) |
LCC gives information about potential clustering options in a graph
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.localClusteringCoefficientAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> lcc) |
LCC gives information about potential clustering options in a graph
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.localClusteringCoefficientAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> lcc,
boolean ignoreEdgeDirection) |
LCC gives information about potential clustering options in a graph
|
<ID> VertexProperty<ID,java.lang.Long> |
Analyst.louvain(PgxGraph graph,
EdgeProperty<java.lang.Double> weight) |
Louvain can detect communities in a large graph relatively fast.
|
<ID> VertexProperty<ID,java.lang.Long> |
Analyst.louvain(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
int maxIter) |
Louvain can detect communities in a large graph relatively fast.
|
<ID> VertexProperty<ID,java.lang.Long> |
Analyst.louvain(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
int maxIter,
int nbrPass,
double tol,
VertexProperty<ID,java.lang.Long> community) |
Louvain can detect communities in a large graph relatively fast.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Long>> |
Analyst.louvainAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight) |
Louvain can detect communities in a large graph relatively fast.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Long>> |
Analyst.louvainAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
int maxIter) |
Louvain can detect communities in a large graph relatively fast.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Long>> |
Analyst.louvainAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
int maxIter,
int nbrPass,
double tol,
VertexProperty<ID,java.lang.Long> community) |
Louvain can detect communities in a large graph relatively fast.
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.outDegreeCentrality(PgxGraph graph) |
Out-degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.outDegreeCentrality(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> dc) |
Out-degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.outDegreeCentralityAsync(PgxGraph graph) |
Out-degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<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) |
Out-degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
PgxMap<java.lang.Integer,java.lang.Long> |
Analyst.outDegreeDistribution(PgxGraph graph) |
Out-degree distribution gives information about the outgoing flows in a graph
|
PgxMap<java.lang.Integer,java.lang.Long> |
Analyst.outDegreeDistribution(PgxGraph graph,
PgxMap<java.lang.Integer,java.lang.Long> distribution) |
Out-degree distribution gives information about the outgoing flows in a graph
|
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> |
Analyst.outDegreeDistributionAsync(PgxGraph graph) |
Out-degree distribution gives information about the outgoing flows in a graph
|
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> |
Analyst.outDegreeDistributionAsync(PgxGraph graph,
PgxMap<java.lang.Integer,java.lang.Long> distribution) |
Out-degree distribution gives information about the outgoing flows in a graph
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph) |
PageRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph,
boolean norm) |
PageRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
PageRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph,
double e,
double d,
int max) |
PageRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph,
double e,
double d,
int max,
boolean norm) |
PageRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph,
double e,
double d,
int max,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
PageRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank) |
PageRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank) |
PageRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerankApproximate(PgxGraph graph) |
Faster, but less accurate than pagerank.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerankApproximate(PgxGraph graph,
double e,
double d,
int max) |
Faster, but less accurate than pagerank.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerankApproximate(PgxGraph graph,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank) |
Faster, but less accurate than pagerank.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerankApproximate(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank) |
Faster, but less accurate than pagerank.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph) |
Faster, but less accurate than pagerank.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph,
double e,
double d,
int max) |
Faster, but less accurate than pagerank.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank) |
Faster, but less accurate than pagerank.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank) |
Faster, but less accurate than pagerank.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph) |
PageRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph,
boolean norm) |
PageRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
PageRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph,
double e,
double d,
int max) |
PageRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph,
double e,
double d,
int max,
boolean norm) |
PageRank computes ranking scores based on the edges in a graph.
|
<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) |
PageRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank) |
PageRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank) |
PageRank computes ranking scores based on the edges in a graph.
|
<ID> Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>> |
Analyst.partitionConductance(PgxGraph graph,
Partition<ID> partition) |
Partition conductance assesses the quality of many partitions in a graph
|
<ID> Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>> |
Analyst.partitionConductance(PgxGraph graph,
Partition<ID> partition,
Scalar<java.lang.Double> avgConductance,
Scalar<java.lang.Double> minConductance) |
Partition conductance assesses the quality of many partitions in a graph
|
<ID> PgxFuture<Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>>> |
Analyst.partitionConductanceAsync(PgxGraph graph,
Partition<ID> partition) |
Partition conductance assesses the quality of many partitions in a graph
|
<ID> PgxFuture<Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>>> |
Analyst.partitionConductanceAsync(PgxGraph graph,
Partition<ID> partition,
Scalar<java.lang.Double> avgConductance,
Scalar<java.lang.Double> minConductance) |
Partition conductance assesses the quality of many partitions in a graph
|
<ID> Scalar<java.lang.Double> |
Analyst.partitionModularity(PgxGraph graph,
Partition<ID> partition) |
Modularity summarizes information about the quality of components in a graph
|
<ID> Scalar<java.lang.Double> |
Analyst.partitionModularity(PgxGraph graph,
Partition<ID> partition,
Scalar<java.lang.Double> modularity) |
Modularity summarizes information about the quality of components in a graph
|
<ID> PgxFuture<Scalar<java.lang.Double>> |
Analyst.partitionModularityAsync(PgxGraph graph,
Partition<ID> partition) |
Modularity summarizes information about the quality of components in a graph
|
<ID> PgxFuture<Scalar<java.lang.Double>> |
Analyst.partitionModularityAsync(PgxGraph graph,
Partition<ID> partition,
java.lang.String modularityName) |
|
<ID> PgxFuture<Scalar<java.lang.Double>> |
Analyst.partitionModularityAsync(PgxGraph graph,
Partition<ID> partition,
Scalar<java.lang.Double> modularity) |
Modularity summarizes information about the quality of components in a graph
|
<ID> VertexSet<ID> |
Analyst.periphery(PgxGraph graph) |
Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
|
<ID> VertexSet<ID> |
Analyst.periphery(PgxGraph graph,
VertexSet<ID> periphery) |
Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
|
<ID> PgxFuture<VertexSet<ID>> |
Analyst.peripheryAsync(PgxGraph graph) |
Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
|
<ID> PgxFuture<VertexSet<ID>> |
Analyst.peripheryAsync(PgxGraph graph,
VertexSet<ID> periphery) |
Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
|
<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 {@link #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) |
|
<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) |
Personalized PageRank for a vertex of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
PgxVertex<ID> v,
boolean norm) |
Personalized PageRank for a vertex of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
PgxVertex<ID> v,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
Personalized PageRank for a vertex of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max) |
Personalized PageRank for a vertex of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
boolean norm) |
Personalized PageRank for a vertex of interest.
|
<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) |
Personalized PageRank for a vertex of interest.
|
<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) |
Personalized PageRank for a vertex of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
PgxVertex<ID> v,
VertexProperty<ID,java.lang.Double> rank) |
Personalized PageRank for a vertex of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices) |
Personalized PageRank for a set of vertices of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm) |
Personalized PageRank for a set of vertices of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
Personalized PageRank for a set of vertices of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max) |
Personalized PageRank for a set of vertices of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm) |
Personalized PageRank for a set of vertices of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
Personalized PageRank for a set of vertices of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank) |
Personalized PageRank for a set of vertices of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
VertexProperty<ID,java.lang.Double> rank) |
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v) |
Personalized PageRank for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
boolean norm) |
Personalized PageRank for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
Personalized PageRank for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max) |
Personalized PageRank for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
boolean norm) |
Personalized PageRank for a vertex of interest.
|
<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 for a vertex of interest.
|
<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 for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
VertexProperty<ID,java.lang.Double> rank) |
Personalized PageRank for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices) |
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm) |
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max) |
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm) |
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank) |
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
VertexProperty<ID,java.lang.Double> rank) |
Personalized PageRank for a set of vertices of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
ID vertexId,
java.math.BigDecimal e,
java.math.BigDecimal d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
|
<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) |
|
<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) |
Personalized weighted pagerank for a vertex and weighted edges.
|
<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) |
Personalized weighted pagerank for a vertex and weighted edges.
|
<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) |
Personalized weighted pagerank for a vertex and weighted edges.
|
<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) |
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight) |
Personalized weighted pagerank for a vertex and weighted edges.
|
<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) |
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
PgxVertex<ID> v,
EdgeProperty<java.lang.Double> weight) |
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
PgxVertex<ID> v,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight) |
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
EdgeProperty<java.lang.Double> weight) |
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
Personalized weighted pagerank for a vertex and weighted edges.
|
<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 for a vertex and weighted edges.
|
<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 for a vertex and weighted edges.
|
<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 for a vertex and weighted edges.
|
<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 for a vertex and weighted edges.
|
<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 for a vertex and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
EdgeProperty<java.lang.Double> weight) |
Personalized weighted pagerank for a vertex and weighted edges.
|
<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 for a vertex and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight) |
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
EdgeProperty<java.lang.Double> weight) |
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
Personalized pagerank for a set of vertices and weighted edges.
|
EdgeProperty<java.lang.Boolean> |
Analyst.prim(PgxGraph graph,
EdgeProperty<java.lang.Double> weight) |
prim reveals tree structures with shortest paths in a graph
|
EdgeProperty<java.lang.Boolean> |
Analyst.prim(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
java.lang.String mstName) |
|
EdgeProperty<java.lang.Boolean> |
Analyst.prim(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
EdgeProperty<java.lang.Boolean> mst) |
prim reveals tree structures with shortest paths in a graph
|
PgxFuture<EdgeProperty<java.lang.Boolean>> |
Analyst.primAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight) |
prim reveals tree structures with shortest paths in a graph
|
PgxFuture<EdgeProperty<java.lang.Boolean>> |
Analyst.primAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
EdgeProperty<java.lang.Boolean> mst) |
prim reveals tree structures with shortest paths in a graph
|
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> |
Analyst.radius(PgxGraph graph) |
Diameter/radius gives an overview of the distances in a graph
|
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> |
Analyst.radius(PgxGraph graph,
Scalar<java.lang.Integer> radius,
VertexProperty<ID,java.lang.Integer> eccentricity) |
Diameter/radius gives an overview of the distances in a graph
|
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
Analyst.radiusAsync(PgxGraph graph) |
Diameter/radius gives an overview of the distances in a graph
|
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
Analyst.radiusAsync(PgxGraph graph,
Scalar<java.lang.Integer> radius,
VertexProperty<ID,java.lang.Integer> eccentricity) |
Diameter/radius gives an overview of the distances in a graph
|
<ID> PgxMap<PgxVertex<ID>,java.lang.Integer> |
Analyst.randomWalkWithRestart(PgxGraph graph,
ID source,
int length,
java.math.BigDecimal resetProb,
PgxMap<PgxVertex<ID>,java.lang.Integer> visitCount) |
|
<ID> PgxMap<PgxVertex<ID>,java.lang.Integer> |
Analyst.randomWalkWithRestart(PgxGraph graph,
PgxVertex<ID> source,
int length,
double resetProb,
PgxMap<PgxVertex<ID>,java.lang.Integer> visitCount) |
random walk with restart does the what its name says, it can find approximate stationary distributions
|
<ID> PgxFuture<PgxMap<PgxVertex<ID>,java.lang.Integer>> |
Analyst.randomWalkWithRestartAsync(PgxGraph graph,
PgxVertex<ID> source,
int length,
double resetProb,
PgxMap<PgxVertex<ID>,java.lang.Integer> visitCount) |
random walk with restart does the what its name says, it can find approximate stationary distributions
|
<ID> java.lang.Integer |
Analyst.reachability(PgxGraph graph,
PgxVertex<ID> source,
PgxVertex<ID> dest,
int maxHops,
boolean ignoreEdgeDirection) |
Reachability is a fast way to check if two vertices are reachable from each other.
|
<ID> PgxFuture<java.lang.Integer> |
Analyst.reachabilityAsync(PgxGraph graph,
PgxVertex<ID> source,
PgxVertex<ID> dest,
int maxHops,
boolean ignoreEdgeDirection) |
Reachability is a fast way to check if two vertices are reachable from each other.
|
<ID> Partition<ID> |
Analyst.sccKosaraju(PgxGraph graph) |
Kosaraju finds strongly connected components in a graph
|
<ID> Partition<ID> |
Analyst.sccKosaraju(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution) |
Kosaraju finds strongly connected components in a graph
|
<ID> PgxFuture<Partition<ID>> |
Analyst.sccKosarajuAsync(PgxGraph graph) |
Kosaraju finds strongly connected components in a graph
|
<ID> PgxFuture<Partition<ID>> |
Analyst.sccKosarajuAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution) |
Kosaraju finds strongly connected components in a graph
|
<ID> Partition<ID> |
Analyst.sccTarjan(PgxGraph graph) |
Tarjan finds strongly connected components in a graph
|
<ID> Partition<ID> |
Analyst.sccTarjan(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution) |
Tarjan finds strongly connected components in a graph
|
<ID> PgxFuture<Partition<ID>> |
Analyst.sccTarjanAsync(PgxGraph graph) |
Tarjan finds strongly connected components in a graph
|
<ID> PgxFuture<Partition<ID>> |
Analyst.sccTarjanAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitonDistribution) |
Tarjan finds strongly connected components in a graph
|
Synchronizer.Builder<T> |
Synchronizer.Builder.setGraph(PgxGraph graph) |
Sets the target graph to synchronize.
|
void |
PgxSession.setSnapshot(PgxGraph graph,
long creationTimestamp) |
|
void |
PgxSession.setSnapshot(PgxGraph graph,
long creationTimestamp,
boolean forceDeleteProperties) |
|
void |
PgxSession.setSnapshot(PgxGraph graph,
GraphMetaData metaData) |
|
void |
PgxSession.setSnapshot(PgxGraph graph,
GraphMetaData metaData,
boolean forceDeleteProperties) |
|
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.
|
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.
|
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFord(PgxGraph graph,
ID srcId,
EdgeProperty<java.lang.Double> cost) |
|
<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) |
|
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFord(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost) |
Bellman-ford finds multiple shortest paths at the same time
|
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFord(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost,
boolean ignoreEdgeDirection) |
Bellman-ford finds multiple shortest paths at the same time
|
<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) |
Bellman-ford finds multiple shortest paths at the same time
|
<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,
boolean ignoreEdgeDirection) |
Bellman-ford finds multiple shortest paths at the same time
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathBellmanFordAsync(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost) |
Bellman-ford finds multiple shortest paths at the same time
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathBellmanFordAsync(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost,
boolean ignoreEdgeDirection) |
Bellman-ford finds multiple shortest paths at the same time
|
<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) |
Bellman-ford finds multiple shortest paths at the same time
|
<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,
boolean ignoreEdgeDirection) |
Bellman-ford finds multiple shortest paths at the same time
|
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFordReverse(PgxGraph graph,
ID srcId,
EdgeProperty<java.lang.Double> cost) |
|
<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) |
|
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFordReverse(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost) |
Reversed bellman-ford finds multiple shortest paths at the same time
|
<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) |
Reversed bellman-ford finds multiple shortest paths at the same time
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost) |
Reversed bellman-ford finds multiple shortest paths at the same time
|
<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) |
Reversed bellman-ford finds multiple shortest paths at the same time
|
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstra(PgxGraph graph,
ID srcId,
ID dstId,
EdgeProperty<java.lang.Double> cost) |
|
<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) |
|
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstra(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost) |
Dijkstra is a fast algorithm for finding a shortest path in a graph
|
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstra(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
boolean ignoreEdgeDirection) |
Undirected Dijkstra's algorithm is a variant of Dijkstra's algorithm that ignores edge directions.
|
<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) |
Dijkstra is a fast algorithm for finding a shortest path in a graph
|
<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,
boolean ignoreEdgeDirection) |
Undirected Dijkstra's algorithm is a variant of Dijkstra's algorithm that ignores edge directions.
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathDijkstraAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost) |
Dijkstra is a fast algorithm for finding a shortest path in a graph
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathDijkstraAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
boolean ignoreEdgeDirection) |
Undirected Dijkstra's algorithm is a variant of Dijkstra's algorithm that ignores edge directions.
|
<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) |
Dijkstra is a fast algorithm for finding a shortest path in a graph
|
<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,
boolean ignoreEdgeDirection) |
Undirected Dijkstra's algorithm is a variant of Dijkstra's algorithm that ignores edge directions.
|
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstraBidirectional(PgxGraph graph,
ID srcId,
ID dstId,
EdgeProperty<java.lang.Double> cost) |
|
<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) |
|
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstraBidirectional(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost) |
Bidirectional dijkstra is a fast algorithm for finding a shortest path in a graph
|
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstraBidirectional(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
boolean ignoreEdgeDirection) |
Undirected bidirectional dijkstra is a variant of bidirectional dijkstra that ignores edge directions
|
<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) |
Bidirectional dijkstra is a fast algorithm for finding a shortest path in a graph
|
<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,
boolean ignoreEdgeDirection) |
Undirected bidirectional dijkstra is a variant of bidirectional dijkstra that ignores edge directions
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost) |
Bidirectional dijkstra is a fast algorithm for finding a shortest path in a graph
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
boolean ignoreEdgeDirection) |
Undirected bidirectional dijkstra is a variant of bidirectional dijkstra that ignores edge directions
|
<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,
java.lang.String parentName,
java.lang.String parentEdgeName,
boolean ignoreEdgeDirection) |
|
<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) |
Bidirectional dijkstra is a fast algorithm for finding a shortest path in a graph
|
<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,
boolean ignoreEdgeDirection) |
Undirected bidirectional dijkstra is a variant of bidirectional dijkstra that ignores edge directions
|
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstra(PgxGraph graph,
ID srcId,
ID dstId,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr) |
|
<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) |
|
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstra(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr) |
Filtered Dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstra(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr,
boolean ignoreEdgeDirection) |
Undirected filtered djkstra is variation of the filtered djkstra's algorithm that ignores edge directions.
|
<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) |
Filtered Dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<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,
boolean ignoreEdgeDirection) |
Undirected filtered djkstra is variation of the filtered djkstra's algorithm that ignores edge directions.
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathFilteredDijkstraAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr) |
Filtered Dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathFilteredDijkstraAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr,
boolean ignoreEdgeDirection) |
Undirected filtered djkstra is variation of the filtered djkstra's algorithm that ignores edge directions.
|
<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) |
Filtered Dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<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,
boolean ignoreEdgeDirection) |
Undirected filtered djkstra is variation of the filtered djkstra's algorithm that ignores edge directions.
|
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph,
ID srcId,
ID dstId,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr) |
|
<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) |
|
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr) |
Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr,
boolean ignoreEdgeDirection) |
Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<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) |
Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<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,
boolean ignoreEdgeDirection) |
Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr) |
Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr,
boolean ignoreEdgeDirection) |
Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<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,
java.lang.String parentName,
java.lang.String parentEdgeName,
boolean ignoreEdgeDirection) |
|
<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) |
Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<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,
boolean ignoreEdgeDirection) |
Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<ID> AllPaths<ID> |
Analyst.shortestPathHopDist(PgxGraph graph,
ID srcId) |
|
<ID> AllPaths<ID> |
Analyst.shortestPathHopDist(PgxGraph graph,
ID srcId,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
|
<ID> AllPaths<ID> |
Analyst.shortestPathHopDist(PgxGraph graph,
PgxVertex<ID> src) |
Hop distance can give a relatively fast insight on the distances in a graph
|
<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) |
Hop distance can give a relatively fast insight on the distances in a graph
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathHopDistAsync(PgxGraph graph,
PgxVertex<ID> src) |
Hop distance can give a relatively fast insight on the distances in a 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) |
Hop distance can give a relatively fast insight on the distances in a graph
|
<ID> AllPaths<ID> |
Analyst.shortestPathHopDistReverse(PgxGraph graph,
ID srcId) |
|
<ID> AllPaths<ID> |
Analyst.shortestPathHopDistReverse(PgxGraph graph,
ID srcId,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
|
<ID> AllPaths<ID> |
Analyst.shortestPathHopDistReverse(PgxGraph graph,
PgxVertex<ID> src) |
Backwards hop distance can give a relatively fast insight on the distances in a graph
|
<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) |
Backwards hop distance can give a relatively fast insight on the distances in a graph
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathHopDistReverseAsync(PgxGraph graph,
PgxVertex<ID> src) |
Backwards hop distance can give a relatively fast insight on the distances in a 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) |
Backwards hop distance can give a relatively fast insight on the distances in a graph
|
<ID> AllPaths<ID> |
Analyst.shortestPathHopDistUndirected(PgxGraph graph,
PgxVertex<ID> src) |
Undirected hop distance can give a relatively fast insight on the distances in a graph
|
<ID> AllPaths<ID> |
Analyst.shortestPathHopDistUndirected(PgxGraph graph,
PgxVertex<ID> src,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
Undirected hop distance can give a relatively fast insight on the distances in a graph
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathHopDistUndirectedAsync(PgxGraph graph,
PgxVertex<ID> src) |
Undirected hop distance can give a relatively fast insight on the distances in a graph
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathHopDistUndirectedAsync(PgxGraph graph,
PgxVertex<ID> src,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
Undirected hop distance can give a relatively fast insight on the distances in a graph
|
<ID> AllPaths<ID> |
Analyst.shortestPathMultiDestinationDijkstra(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost) |
Dijkstra is a fast algorithm for finding a shortest path in a graph and goes to all destinations.
|
<ID> AllPaths<ID> |
Analyst.shortestPathMultiDestinationDijkstra(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) |
Dijkstra is a fast algorithm for finding a shortest path in a graph and goes to all destinations.
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathMultiDestinationDijkstraAsync(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost) |
Dijkstra is a fast algorithm for finding a shortest path in a graph and goes to all destinations.
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathMultiDestinationDijkstraAsync(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) |
Dijkstra is a fast algorithm for finding a shortest path in a graph and goes to all destinations.
|
<ID> VertexProperty<ID,java.lang.String> |
Analyst.speakerListenerLabelPropagation(PgxGraph graph,
java.lang.String labelsPropName) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> VertexProperty<ID,java.lang.String> |
Analyst.speakerListenerLabelPropagation(PgxGraph graph,
java.lang.String labelsPropName,
int maxIter,
double threshold,
java.lang.String delimiter) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> VertexProperty<ID,java.lang.String> |
Analyst.speakerListenerLabelPropagation(PgxGraph graph,
VertexProperty<ID,java.lang.String> labels,
int maxIter,
double threshold,
java.lang.String delimiter) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.String>> |
Analyst.speakerListenerLabelPropagationAsync(PgxGraph graph,
java.lang.String labelsPropName) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.String>> |
Analyst.speakerListenerLabelPropagationAsync(PgxGraph graph,
java.lang.String labelsPropName,
int maxIter,
double threshold,
java.lang.String delimiter) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.String>> |
Analyst.speakerListenerLabelPropagationAsync(PgxGraph graph,
VertexProperty<ID,java.lang.String> labels,
int maxIter,
double threshold,
java.lang.String delimiter) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.topologicalSchedule(PgxGraph graph,
VertexSet<ID> source) |
Topological schedule gives an order of visit for the reachable vertices from the source
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.topologicalSchedule(PgxGraph graph,
VertexSet<ID> source,
VertexProperty<ID,java.lang.Integer> topoSched) |
Topological sort gives an order of visit for vertices in directed acyclic graphs
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.topologicalScheduleAsync(PgxGraph graph,
VertexSet<ID> source) |
Topological schedule gives an order of visit for the reachable vertices from the source
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.topologicalScheduleAsync(PgxGraph graph,
VertexSet<ID> source,
VertexProperty<ID,java.lang.Integer> topoSched) |
Topological schedule gives an order of visit for the reachable vertices from the source
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.topologicalSort(PgxGraph graph) |
Topological sort gives an order of visit for vertices in directed acyclic graphs
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.topologicalSort(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> topoSort) |
Topological sort gives an order of visit for vertices in directed acyclic graphs
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.topologicalSortAsync(PgxGraph graph) |
Topological sort gives an order of visit for vertices in directed acyclic graphs
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.topologicalSortAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> topoSort) |
Topological sort gives an order of visit for vertices in directed acyclic graphs
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.vertexBetweennessCentrality(PgxGraph graph) |
Betweenness centrality measures the centrality of the vertices to identify important vertices for the flow of information
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.vertexBetweennessCentrality(PgxGraph graph,
VertexProperty<ID,java.lang.Double> bc) |
Betweenness centrality measures the centrality of the vertices to identify important vertices for the flow of information
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.vertexBetweennessCentralityAsync(PgxGraph graph) |
Betweenness centrality measures the centrality of the vertices to identify important vertices for the flow of information
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.vertexBetweennessCentralityAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> bc) |
Betweenness centrality measures the centrality of the vertices to identify important vertices for the flow of information
|
<ID> Partition<ID> |
Analyst.wcc(PgxGraph graph) |
Identifying weakly connected components can be useful for clustering graph data
|
<ID> Partition<ID> |
Analyst.wcc(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution) |
Identifying weakly connected components can be useful for clustering graph data
|
<ID> PgxFuture<Partition<ID>> |
Analyst.wccAsync(PgxGraph graph) |
Identifying weakly connected components can be useful for clustering graph data
|
<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> partitionDistribution) |
Identifying weakly connected components can be useful for clustering graph data
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
PageRank on weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
PageRank on weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
PageRank on weighted edges.
|
<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) |
PageRank on weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight) |
PageRank on weighted edges.
|
<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) |
PageRank on weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph,
EdgeProperty<java.lang.Double> weight) |
PageRank on weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
PageRank on weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
PageRank on weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
PageRank on weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
PageRank on weighted edges.
|
<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) |
PageRank on weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight) |
PageRank on weighted edges.
|
<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) |
PageRank on weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight) |
PageRank on weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
PageRank on weighted edges.
|
<ID> VertexProperty<ID,java.lang.String> |
Analyst.weightedSpeakerListenerLabelPropagation(PgxGraph graph,
java.lang.String labelsPropName,
int maxIter,
double threshold,
java.lang.String delimiter,
EdgeProperty<java.lang.Double> weight) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> VertexProperty<ID,java.lang.String> |
Analyst.weightedSpeakerListenerLabelPropagation(PgxGraph graph,
java.lang.String labelsPropName,
EdgeProperty<java.lang.Double> weight) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> VertexProperty<ID,java.lang.String> |
Analyst.weightedSpeakerListenerLabelPropagation(PgxGraph graph,
VertexProperty<ID,java.lang.String> labels,
int maxIter,
double threshold,
java.lang.String delimiter,
EdgeProperty<java.lang.Double> weight) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.String>> |
Analyst.weightedSpeakerListenerLabelPropagationAsync(PgxGraph graph,
java.lang.String labelsPropName,
int maxIter,
double threshold,
java.lang.String delimiter,
EdgeProperty<java.lang.Double> weight) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.String>> |
Analyst.weightedSpeakerListenerLabelPropagationAsync(PgxGraph graph,
java.lang.String labelsPropName,
EdgeProperty<java.lang.Double> weight) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.String>> |
Analyst.weightedSpeakerListenerLabelPropagationAsync(PgxGraph graph,
VertexProperty<ID,java.lang.String> labels,
int maxIter,
double threshold,
java.lang.String delimiter,
EdgeProperty<java.lang.Double> weight) |
Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
|
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
ID vertexId,
int topK) |
|
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
ID vertexId,
int topK,
int sizeCircleOfTrust) |
|
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
ID vertexId,
int topK,
int sizeCircleOfTrust,
int maxIter,
java.math.BigDecimal tol,
java.math.BigDecimal dampingFactor,
int salsaMaxIter,
java.math.BigDecimal salsaTol) |
|
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
ID vertexId,
int topK,
int sizeCircleOfTrust,
int maxIter,
java.math.BigDecimal tol,
java.math.BigDecimal dampingFactor,
int salsaMaxIter,
java.math.BigDecimal salsaTol,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities) |
Convenience wrapper around
Analyst.whomToFollow(PgxGraph, PgxVertex, int, int, int, BigDecimal, BigDecimal, int, BigDecimal, VertexSequence,
VertexSequence)
taking a vertex ID instead of a PgxVertex. |
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex) |
WTF is a recommendation algorithm.
|
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex,
int topK) |
WTF is a recommendation algorithm.
|
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust) |
WTF is a recommendation algorithm.
|
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust,
int maxIter,
double tol,
double dampingFactor,
int salsaMaxIter,
double salsaTol) |
WTF is a recommendation algorithm.
|
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust,
int maxIter,
double tol,
double dampingFactor,
int salsaMaxIter,
double salsaTol,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities) |
WTF is a recommendation algorithm.
|
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities) |
WTF is a recommendation algorithm.
|
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities) |
WTF is a recommendation algorithm.
|
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities) |
WTF is a recommendation algorithm.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex) |
WTF is a recommendation algorithm.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
int topK) |
WTF is a recommendation algorithm.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust) |
WTF is a recommendation algorithm.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust,
int maxIter,
double tol,
double dampingFactor,
int salsaMaxIter,
double salsaTol) |
WTF is a recommendation algorithm.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust,
int maxIter,
double tol,
double dampingFactor,
int salsaMaxIter,
double salsaTol,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities) |
WTF is a recommendation algorithm.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities) |
WTF is a recommendation algorithm.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities) |
WTF is a recommendation algorithm.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities) |
WTF is a recommendation algorithm.
|
static <V> V |
Property.wrap(V value,
PropertyType type,
PgxGraph graph) |
|