public class Analyst extends Destroyable
Destroyable.destroy() is invoked, all transient data returned by the Analyst gets freed and cannot be used anymore.| Modifier and Type | Method and Description |
|---|---|
<V> EdgeProperty<java.lang.Double> |
adamicAdarCounting(PgxGraph graph) |
<V> EdgeProperty<java.lang.Double> |
adamicAdarCounting(PgxGraph graph,
EdgeProperty<java.lang.Double> aa) |
PgxFuture<EdgeProperty<java.lang.Double>> |
adamicAdarCountingAsync(PgxGraph graph) |
PgxFuture<EdgeProperty<java.lang.Double>> |
adamicAdarCountingAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> aa) |
<ID> VertexProperty<ID,java.lang.Double> |
approximateVertexBetweennessCentrality(PgxGraph graph,
int k) |
<ID> VertexProperty<ID,java.lang.Double> |
approximateVertexBetweennessCentrality(PgxGraph graph,
int k,
VertexProperty<ID,java.lang.Double> bc) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
approximateVertexBetweennessCentralityAsync(PgxGraph graph,
int k) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
approximateVertexBetweennessCentralityAsync(PgxGraph graph,
int k,
VertexProperty<ID,java.lang.Double> bc) |
<ID> VertexProperty<ID,java.lang.Double> |
approximateVertexBetweennessCentralityFromSeeds(PgxGraph graph,
PgxVertex<ID>... seeds) |
<ID> VertexProperty<ID,java.lang.Double> |
approximateVertexBetweennessCentralityFromSeeds(PgxGraph graph,
VertexProperty<ID,java.lang.Double> bc,
PgxVertex<ID>... seeds) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph,
PgxVertex<ID>... seeds) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> bc,
PgxVertex<ID>... seeds) |
<ID> VertexSet<ID> |
center(PgxGraph graph) |
<ID> VertexSet<ID> |
center(PgxGraph graph,
VertexSet<ID> center) |
<ID> PgxFuture<VertexSet<ID>> |
centerAsync(PgxGraph graph) |
<ID> PgxFuture<VertexSet<ID>> |
centerAsync(PgxGraph graph,
VertexSet<ID> center) |
<ID> VertexProperty<ID,java.lang.Double> |
closenessCentralityDoubleLength(PgxGraph graph,
EdgeProperty<java.lang.Double> cost) |
<ID> VertexProperty<ID,java.lang.Double> |
closenessCentralityDoubleLength(PgxGraph graph,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,java.lang.Double> cc) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
closenessCentralityDoubleLengthAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> cost) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
closenessCentralityDoubleLengthAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,java.lang.Double> cc) |
<ID> VertexProperty<ID,java.lang.Double> |
closenessCentralityUnitLength(PgxGraph graph) |
<ID> VertexProperty<ID,java.lang.Double> |
closenessCentralityUnitLength(PgxGraph graph,
VertexProperty<ID,java.lang.Double> cc) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
closenessCentralityUnitLengthAsync(PgxGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
closenessCentralityUnitLengthAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> cc) |
<ID> Partition<ID> |
communitiesConductanceMinimization(PgxGraph graph) |
<ID> Partition<ID> |
communitiesConductanceMinimization(PgxGraph graph,
int max) |
<ID> Partition<ID> |
communitiesConductanceMinimization(PgxGraph graph,
int max,
VertexProperty<ID,java.lang.Long> partitonDistribution) |
<ID> Partition<ID> |
communitiesConductanceMinimization(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitonDistribution) |
<ID> PgxFuture<Partition<ID>> |
communitiesConductanceMinimizationAsync(PgxGraph graph) |
<ID> PgxFuture<Partition<ID>> |
communitiesConductanceMinimizationAsync(PgxGraph graph,
int max) |
<ID> PgxFuture<Partition<ID>> |
communitiesConductanceMinimizationAsync(PgxGraph graph,
int max,
VertexProperty<ID,java.lang.Long> partitionDistribution) |
<ID> PgxFuture<Partition<ID>> |
communitiesConductanceMinimizationAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution) |
<ID> Partition<ID> |
communitiesInfomap(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight) |
<ID> Partition<ID> |
communitiesInfomap(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight,
double tau,
double tol,
int maxIter) |
<ID> Partition<ID> |
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) |
<ID> Partition<ID> |
communitiesInfomap(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Long> module) |
<ID> PgxFuture<Partition<ID>> |
communitiesInfomapAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<Partition<ID>> |
communitiesInfomapAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight,
double tau,
double tol,
int maxIter) |
<ID> PgxFuture<Partition<ID>> |
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) |
<ID> PgxFuture<Partition<ID>> |
communitiesInfomapAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Long> module) |
<ID> Partition<ID> |
communitiesLabelPropagation(PgxGraph graph) |
<ID> Partition<ID> |
communitiesLabelPropagation(PgxGraph graph,
int maxIterations) |
<ID> Partition<ID> |
communitiesLabelPropagation(PgxGraph graph,
int maxIterations,
VertexProperty<ID,java.lang.Long> partitonDistribution) |
<ID> Partition<ID> |
communitiesLabelPropagation(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitonDistribution) |
<ID> PgxFuture<Partition<ID>> |
communitiesLabelPropagationAsync(PgxGraph graph) |
<ID> PgxFuture<Partition<ID>> |
communitiesLabelPropagationAsync(PgxGraph graph,
int maxIteration) |
<ID> PgxFuture<Partition<ID>> |
communitiesLabelPropagationAsync(PgxGraph graph,
int maxIteration,
VertexProperty<ID,java.lang.Long> partitionDistribution) |
<ID> PgxFuture<Partition<ID>> |
communitiesLabelPropagationAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution) |
<ID> Scalar<java.lang.Double> |
conductance(PgxGraph graph,
Partition<ID> partition,
long partitionIndex) |
<ID> Scalar<java.lang.Double> |
conductance(PgxGraph graph,
Partition<ID> partition,
long partitionIndex,
Scalar<java.lang.Double> conductance) |
<ID> PgxFuture<Scalar<java.lang.Double>> |
conductanceAsync(PgxGraph graph,
Partition<ID> partition,
long partitionIndex) |
<ID> PgxFuture<Scalar<java.lang.Double>> |
conductanceAsync(PgxGraph graph,
Partition<ID> partition,
long partitionIndex,
Scalar<java.lang.Double> conductance) |
long |
countTriangles(PgxGraph graph,
boolean sortVerticesByDegree) |
PgxFuture<java.lang.Long> |
countTrianglesAsync(PgxGraph graph,
boolean sortVerticesByDegree) |
<ID> VertexProperty<ID,java.lang.Integer> |
degreeCentrality(PgxGraph graph) |
<ID> VertexProperty<ID,java.lang.Integer> |
degreeCentrality(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> dc) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
degreeCentralityAsync(PgxGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
degreeCentralityAsync(PgxGraph graph,
java.lang.String propertyName) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
degreeCentralityAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> dc) |
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> |
diameter(PgxGraph graph) |
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> |
diameter(PgxGraph graph,
Scalar<java.lang.Integer> diameter,
VertexProperty<ID,java.lang.Integer> eccentricity) |
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
diameterAsync(PgxGraph graph) |
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
diameterAsync(PgxGraph graph,
Scalar<java.lang.Integer> diameter,
VertexProperty<ID,java.lang.Integer> eccentricity) |
<ID> VertexProperty<ID,java.lang.Double> |
eigenvectorCentrality(PgxGraph graph) |
<ID> VertexProperty<ID,java.lang.Double> |
eigenvectorCentrality(PgxGraph graph,
int max,
double maxDiff,
boolean useL2Norm,
boolean useInEdge) |
<ID> VertexProperty<ID,java.lang.Double> |
eigenvectorCentrality(PgxGraph graph,
int max,
double maxDiff,
boolean useL2Norm,
boolean useInEdge,
VertexProperty<ID,java.lang.Double> ec) |
<ID> VertexProperty<ID,java.lang.Double> |
eigenvectorCentrality(PgxGraph graph,
VertexProperty<ID,java.lang.Double> ec) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
eigenvectorCentralityAsync(PgxGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
eigenvectorCentralityAsync(PgxGraph graph,
int max,
double maxDiff,
boolean useL2Norm,
boolean useInEdge) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
eigenvectorCentralityAsync(PgxGraph graph,
int max,
double maxDiff,
boolean useL2Norm,
boolean useInEdge,
VertexProperty<ID,java.lang.Double> ec) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
eigenvectorCentralityAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> ec) |
<ID> AllPaths<ID> |
fattestPath(PgxGraph graph,
ID rootId,
EdgeProperty<java.lang.Double> capacity)
Convenience wrapper around
fattestPath(PgxGraph, PgxVertex, EdgeProperty) taking a vertex ID instead of a
PgxVertex. |
<ID> AllPaths<ID> |
fattestPath(PgxGraph graph,
ID rootId,
EdgeProperty<java.lang.Double> capacity,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
fattestPath(PgxGraph, PgxVertex, EdgeProperty, VertexProperty,
VertexProperty, VertexProperty) taking a vertex ID instead of a
PgxVertex. |
<ID> AllPaths<ID> |
fattestPath(PgxGraph graph,
PgxVertex<ID> root,
EdgeProperty<java.lang.Double> capacity) |
<ID> AllPaths<ID> |
fattestPath(PgxGraph graph,
PgxVertex<ID> root,
EdgeProperty<java.lang.Double> capacity,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
<ID> PgxFuture<AllPaths<ID>> |
fattestPathAsync(PgxGraph graph,
PgxVertex<ID> root,
EdgeProperty<java.lang.Double> capacity) |
<ID> PgxFuture<AllPaths<ID>> |
fattestPathAsync(PgxGraph graph,
PgxVertex<ID> root,
EdgeProperty<java.lang.Double> capacity,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredBfs(PgxGraph graph,
ID root)
Convenience wrapper around
filteredBfs(PgxGraph, PgxVertex)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredBfs(PgxGraph graph,
ID root,
int maxDepth)
Convenience wrapper around
filteredBfs(PgxGraph, PgxVertex, int)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredBfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator)
Convenience wrapper around
filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredBfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf)
Convenience wrapper around
filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredBfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth)
Convenience wrapper around
filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, int)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredBfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
Convenience wrapper around
filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, int, VertexProperty,
VertexProperty)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredBfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
Convenience wrapper around
filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, VertexProperty,
VertexProperty)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredBfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator,
int maxDepth)
Convenience wrapper around
filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, int)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredBfs(PgxGraph graph,
PgxVertex<ID> root) |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
int maxDepth) |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator) |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf) |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth) |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent) |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent) |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
int maxDepth) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
int maxDepth) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
int maxDepth) |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredDfs(PgxGraph graph,
ID root)
Convenience wrapper around
filteredDfs(PgxGraph, PgxVertex)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredDfs(PgxGraph graph,
ID root,
int maxDepth)
Convenience wrapper around
filteredDfs(PgxGraph, PgxVertex, int)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredDfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator)
Convenience wrapper around
filteredDfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredDfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf)
Convenience wrapper around
filteredDfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredDfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth)
Convenience wrapper around
filteredDfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, int)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredDfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
Convenience wrapper around
filteredDfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, int, VertexProperty,
VertexProperty)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredDfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
Convenience wrapper around
filteredDfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, VertexProperty,
VertexProperty)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredDfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator,
int maxDepth)
Convenience wrapper around
filteredDfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, int)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredDfs(PgxGraph graph,
PgxVertex<ID> root) |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
int maxDepth) |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator) |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf) |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth) |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent) |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent) |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
int maxDepth) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
int maxDepth) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
int maxDepth) |
<ID> PgxPath<ID> |
findCycle(PgxGraph graph) |
<ID> PgxPath<ID> |
findCycle(PgxGraph graph,
PgxVertex<ID> src) |
<ID> PgxPath<ID> |
findCycle(PgxGraph graph,
PgxVertex<ID> src,
VertexSequence<ID> nodeSeq,
EdgeSequence edgeSeq) |
<ID> PgxPath<ID> |
findCycle(PgxGraph graph,
VertexSequence<ID> nodeSeq,
EdgeSequence edgeSeq) |
<ID> PgxFuture<PgxPath<ID>> |
findCycleAsync(PgxGraph graph) |
<ID> PgxFuture<PgxPath<ID>> |
findCycleAsync(PgxGraph graph,
PgxVertex<ID> src) |
<ID> PgxFuture<PgxPath<ID>> |
findCycleAsync(PgxGraph graph,
PgxVertex<ID> src,
VertexSequence<ID> nodeSeq,
EdgeSequence edgeSeq) |
<ID> PgxFuture<PgxPath<ID>> |
findCycleAsync(PgxGraph graph,
VertexSequence<ID> nodeSeq,
EdgeSequence edgeSeq) |
PgxSession |
getSession()
Gets the session.
|
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
hits(PgxGraph graph) |
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
hits(PgxGraph graph,
int max) |
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
hits(PgxGraph graph,
int max,
VertexProperty<ID,java.lang.Double> auth,
VertexProperty<ID,java.lang.Double> hubs) |
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
hits(PgxGraph graph,
VertexProperty<ID,java.lang.Double> auth,
VertexProperty<ID,java.lang.Double> hubs) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
hitsAsync(PgxGraph graph) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
hitsAsync(PgxGraph graph,
int max) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
hitsAsync(PgxGraph graph,
int max,
VertexProperty<ID,java.lang.Double> auth,
VertexProperty<ID,java.lang.Double> hubs) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
hitsAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> auth,
VertexProperty<ID,java.lang.Double> hubs) |
<ID> VertexProperty<ID,java.lang.Integer> |
inDegreeCentrality(PgxGraph graph) |
<ID> VertexProperty<ID,java.lang.Integer> |
inDegreeCentrality(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> dc) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
inDegreeCentralityAsync(PgxGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
inDegreeCentralityAsync(PgxGraph graph,
java.lang.String propertyName) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
inDegreeCentralityAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> dc) |
PgxMap<java.lang.Integer,java.lang.Long> |
inDegreeDistribution(PgxGraph graph) |
PgxMap<java.lang.Integer,java.lang.Long> |
inDegreeDistribution(PgxGraph graph,
PgxMap<java.lang.Integer,java.lang.Long> distribution) |
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> |
inDegreeDistributionAsync(PgxGraph graph) |
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> |
inDegreeDistributionAsync(PgxGraph graph,
PgxMap<java.lang.Integer,java.lang.Long> distribution) |
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> |
kcore(PgxGraph graph) |
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> |
kcore(PgxGraph graph,
int minCore,
int maxCore) |
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> |
kcore(PgxGraph graph,
int minCore,
int maxCore,
Scalar<java.lang.Long> maxKCore,
VertexProperty<ID,java.lang.Long> kcore) |
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> |
kcore(PgxGraph graph,
Scalar<java.lang.Long> maxKCore,
VertexProperty<ID,java.lang.Long> kcore) |
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
kcoreAsync(PgxGraph graph) |
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
kcoreAsync(PgxGraph graph,
int minCore,
int maxCore) |
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
kcoreAsync(PgxGraph graph,
int minCore,
int maxCore,
Scalar<java.lang.Long> maxKCore,
VertexProperty<ID,java.lang.Long> kcore) |
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
kcoreAsync(PgxGraph graph,
Scalar<java.lang.Long> maxKCore,
VertexProperty<ID,java.lang.Long> kcore) |
<ID> VertexProperty<ID,java.lang.Double> |
localClusteringCoefficient(PgxGraph graph) |
<ID> VertexProperty<ID,java.lang.Double> |
localClusteringCoefficient(PgxGraph graph,
VertexProperty<ID,java.lang.Double> lcc) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
localClusteringCoefficientAsync(PgxGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
localClusteringCoefficientAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> lcc) |
<ID> MatrixFactorizationModel<ID> |
matrixFactorizationGradientDescent(BipartiteGraph graph,
EdgeProperty<java.lang.Double> weight) |
<ID> MatrixFactorizationModel<ID> |
matrixFactorizationGradientDescent(BipartiteGraph graph,
EdgeProperty<java.lang.Double> weight,
double learningRate,
double changePerStep,
double lambda,
int maxStep,
int vectorLength) |
<ID> MatrixFactorizationModel<ID> |
matrixFactorizationGradientDescent(BipartiteGraph graph,
EdgeProperty<java.lang.Double> weight,
double learningRate,
double changePerStep,
double lambda,
int maxStep,
int vectorLength,
VertexProperty<ID,PgxVect<java.lang.Double>> features) |
<ID> MatrixFactorizationModel<ID> |
matrixFactorizationGradientDescent(BipartiteGraph graph,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,PgxVect<java.lang.Double>> features) |
<ID> PgxFuture<MatrixFactorizationModel<ID>> |
matrixFactorizationGradientDescentAsync(BipartiteGraph graph,
EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<MatrixFactorizationModel<ID>> |
matrixFactorizationGradientDescentAsync(BipartiteGraph graph,
EdgeProperty<java.lang.Double> weight,
double learningRate,
double changePerStep,
double lambda,
int maxStep,
int vectorLength) |
<ID> PgxFuture<MatrixFactorizationModel<ID>> |
matrixFactorizationGradientDescentAsync(BipartiteGraph graph,
EdgeProperty<java.lang.Double> weight,
double learningRate,
double changePerStep,
double lambda,
int maxStep,
int vectorLength,
VertexProperty<ID,PgxVect<java.lang.Double>> features) |
<ID> PgxFuture<MatrixFactorizationModel<ID>> |
matrixFactorizationGradientDescentAsync(BipartiteGraph graph,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,PgxVect<java.lang.Double>> features) |
<ID> VertexProperty<ID,java.lang.Integer> |
outDegreeCentrality(PgxGraph graph) |
<ID> VertexProperty<ID,java.lang.Integer> |
outDegreeCentrality(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> dc) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
outDegreeCentralityAsync(PgxGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
outDegreeCentralityAsync(PgxGraph graph,
java.lang.String propertyName) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
outDegreeCentralityAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> dc) |
PgxMap<java.lang.Integer,java.lang.Long> |
outDegreeDistribution(PgxGraph graph) |
PgxMap<java.lang.Integer,java.lang.Long> |
outDegreeDistribution(PgxGraph graph,
PgxMap<java.lang.Integer,java.lang.Long> distribution) |
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> |
outDegreeDistributionAsync(PgxGraph graph) |
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> |
outDegreeDistributionAsync(PgxGraph graph,
PgxMap<java.lang.Integer,java.lang.Long> distribution) |
<ID> VertexProperty<ID,java.lang.Double> |
pagerank(PgxGraph graph) |
<ID> VertexProperty<ID,java.lang.Double> |
pagerank(PgxGraph graph,
boolean norm) |
<ID> VertexProperty<ID,java.lang.Double> |
pagerank(PgxGraph graph,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
pagerank(PgxGraph graph,
double e,
double d,
int max) |
<ID> VertexProperty<ID,java.lang.Double> |
pagerank(PgxGraph graph,
double e,
double d,
int max,
boolean norm) |
<ID> VertexProperty<ID,java.lang.Double> |
pagerank(PgxGraph graph,
double e,
double d,
int max,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
pagerank(PgxGraph graph,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
pagerank(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
pagerankApproximate(PgxGraph graph) |
<ID> VertexProperty<ID,java.lang.Double> |
pagerankApproximate(PgxGraph graph,
double e,
double d,
int max) |
<ID> VertexProperty<ID,java.lang.Double> |
pagerankApproximate(PgxGraph graph,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
pagerankApproximate(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
pagerankApproximateAsync(PgxGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
pagerankApproximateAsync(PgxGraph graph,
double e,
double d,
int max) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
pagerankApproximateAsync(PgxGraph graph,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
pagerankApproximateAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
pagerankAsync(PgxGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
pagerankAsync(PgxGraph graph,
boolean norm) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
pagerankAsync(PgxGraph graph,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
pagerankAsync(PgxGraph graph,
double e,
double d,
int max) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
pagerankAsync(PgxGraph graph,
double e,
double d,
int max,
boolean norm) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
pagerankAsync(PgxGraph graph,
double e,
double d,
int max,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
pagerankAsync(PgxGraph graph,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
pagerankAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank) |
<ID> Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>> |
partitionConductance(PgxGraph graph,
Partition<ID> partition) |
<ID> Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>> |
partitionConductance(PgxGraph graph,
Partition<ID> partition,
Scalar<java.lang.Double> avgConductance,
Scalar<java.lang.Double> minConductance) |
<ID> PgxFuture<Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>>> |
partitionConductanceAsync(PgxGraph graph,
Partition<ID> partition) |
<ID> PgxFuture<Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>>> |
partitionConductanceAsync(PgxGraph graph,
Partition<ID> partition,
Scalar<java.lang.Double> avgConductance,
Scalar<java.lang.Double> minConductance) |
<ID> Scalar<java.lang.Double> |
partitionModularity(PgxGraph graph,
Partition<ID> partition) |
<ID> Scalar<java.lang.Double> |
partitionModularity(PgxGraph graph,
Partition<ID> partition,
Scalar<java.lang.Double> modularity) |
<ID> PgxFuture<Scalar<java.lang.Double>> |
partitionModularityAsync(PgxGraph graph,
Partition<ID> partition) |
<ID> PgxFuture<Scalar<java.lang.Double>> |
partitionModularityAsync(PgxGraph graph,
Partition<ID> partition,
Scalar<java.lang.Double> modularity) |
<ID> PgxFuture<Scalar<java.lang.Double>> |
partitionModularityAsync(PgxGraph graph,
Partition<ID> partition,
java.lang.String modularityName) |
<ID> VertexSet<ID> |
periphery(PgxGraph graph) |
<ID> VertexSet<ID> |
periphery(PgxGraph graph,
VertexSet<ID> periphery) |
<ID> PgxFuture<VertexSet<ID>> |
peripheryAsync(PgxGraph graph) |
<ID> PgxFuture<VertexSet<ID>> |
peripheryAsync(PgxGraph graph,
VertexSet<ID> periphery) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedPagerank(PgxGraph graph,
ID vertexId,
java.math.BigDecimal e,
java.math.BigDecimal d,
int max)
Convenience wrapper around
personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int,)
taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedPagerank(PgxGraph graph,
ID vertexId,
java.math.BigDecimal e,
java.math.BigDecimal d,
int max,
boolean norm)
Convenience wrapper around
personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int,
boolean) taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
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 taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
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 taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedPagerank(PgxGraph graph,
PgxVertex<ID> v) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedPagerank(PgxGraph graph,
PgxVertex<ID> v,
boolean norm) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedPagerank(PgxGraph graph,
PgxVertex<ID> v,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedPagerank(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedPagerank(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
boolean norm) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedPagerank(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedPagerank(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedPagerank(PgxGraph graph,
PgxVertex<ID> v,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
boolean norm) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
boolean norm) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedSalsa(BipartiteGraph graph,
ID v,
java.math.BigDecimal d,
int maxIterations,
java.math.BigDecimal maxDiff)
Convenience wrapper around
personalizedSalsa(BipartiteGraph, PgxVertex, BigDecimal, int, BigDecimal)
taking a vertex ID instead of PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedSalsa(BipartiteGraph graph,
ID v,
java.math.BigDecimal d,
int maxIterations,
java.math.BigDecimal maxDiff,
VertexProperty<ID,java.lang.Double> salsaRank)
Convenience wrapper around
#personalizedSalsa(BipartiteGraph, PgxVertex, BigDecimal, int, BigDecimal, VertexProperty
taking a vertex ID instead of PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedSalsa(BipartiteGraph graph,
PgxVertex<ID> v) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedSalsa(BipartiteGraph graph,
PgxVertex<ID> v,
double d,
int maxIter,
double maxDiff) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedSalsa(BipartiteGraph graph,
PgxVertex<ID> v,
double d,
int maxIter,
double maxDiff,
VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedSalsa(BipartiteGraph graph,
PgxVertex<ID> v,
VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedSalsa(BipartiteGraph graph,
VertexSet<ID> vertices) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedSalsa(BipartiteGraph graph,
VertexSet<ID> vertices,
double d,
int maxIter,
double maxDiff) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedSalsa(BipartiteGraph graph,
VertexSet<ID> vertices,
double d,
int maxIter,
double maxDiff,
VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedSalsa(BipartiteGraph graph,
VertexSet<ID> vertices,
VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedSalsaAsync(BipartiteGraph graph,
PgxVertex<ID> v) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedSalsaAsync(BipartiteGraph graph,
PgxVertex<ID> v,
double d,
int maxIter,
double maxDiff) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedSalsaAsync(BipartiteGraph graph,
PgxVertex<ID> v,
double d,
int maxIter,
double maxDiff,
VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedSalsaAsync(BipartiteGraph graph,
PgxVertex<ID> v,
VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedSalsaAsync(BipartiteGraph graph,
VertexSet<ID> vertices) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedSalsaAsync(BipartiteGraph graph,
VertexSet<ID> vertices,
double d,
int maxIter,
double maxDiff) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedSalsaAsync(BipartiteGraph graph,
VertexSet<ID> vertices,
double d,
int maxIter,
double maxDiff,
VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedSalsaAsync(BipartiteGraph graph,
VertexSet<ID> vertices,
VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedWeightedPagerank(PgxGraph graph,
ID vertexId,
java.math.BigDecimal e,
java.math.BigDecimal d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight)
Convenience wrapper around
personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int,
boolean, EdgeProperty) taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
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 taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedWeightedPagerank(PgxGraph graph,
ID vertexId,
java.math.BigDecimal e,
java.math.BigDecimal d,
int max,
EdgeProperty<java.lang.Double> weight)
Convenience wrapper around
personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int,
EdgeProperty) taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
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 taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedWeightedPagerank(PgxGraph graph,
PgxVertex<ID> v,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedWeightedPagerank(PgxGraph graph,
PgxVertex<ID> v,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedWeightedPagerank(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedWeightedPagerank(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedWeightedPagerank(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedWeightedPagerank(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedWeightedPagerank(PgxGraph graph,
PgxVertex<ID> v,
EdgeProperty<java.lang.Double> weight) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedWeightedPagerank(PgxGraph graph,
PgxVertex<ID> v,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
EdgeProperty<java.lang.Double> weight) |
<ID> VertexProperty<ID,java.lang.Double> |
personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedWeightedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedWeightedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedWeightedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedWeightedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedWeightedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedWeightedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedWeightedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedWeightedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
EdgeProperty<java.lang.Boolean> |
prim(PgxGraph graph,
EdgeProperty<java.lang.Double> weight) |
EdgeProperty<java.lang.Boolean> |
prim(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
EdgeProperty<java.lang.Boolean> mst) |
EdgeProperty<java.lang.Boolean> |
prim(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
java.lang.String mstName)
Convenience wrapper around
prim(PgxGraph, EdgeProperty, String) |
PgxFuture<EdgeProperty<java.lang.Boolean>> |
primAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight) |
PgxFuture<EdgeProperty<java.lang.Boolean>> |
primAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
EdgeProperty<java.lang.Boolean> mst) |
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> |
radius(PgxGraph graph) |
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> |
radius(PgxGraph graph,
Scalar<java.lang.Integer> radius,
VertexProperty<ID,java.lang.Integer> eccentricity) |
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
radiusAsync(PgxGraph graph) |
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
radiusAsync(PgxGraph graph,
Scalar<java.lang.Integer> radius,
VertexProperty<ID,java.lang.Integer> eccentricity) |
<ID> java.lang.Integer |
reachability(PgxGraph graph,
PgxVertex<ID> source,
PgxVertex<ID> dest,
int maxHops,
boolean ignoreEdgeDirection) |
<ID> PgxFuture<java.lang.Integer> |
reachabilityAsync(PgxGraph graph,
PgxVertex<ID> source,
PgxVertex<ID> dest,
int maxHops,
boolean ignoreEdgeDirection) |
<ID> VertexProperty<ID,java.lang.Double> |
salsa(BipartiteGraph graph) |
<ID> VertexProperty<ID,java.lang.Double> |
salsa(BipartiteGraph graph,
double maxDiff,
int maxIter) |
<ID> VertexProperty<ID,java.lang.Double> |
salsa(BipartiteGraph graph,
double maxDiff,
int maxIter,
VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> VertexProperty<ID,java.lang.Double> |
salsa(BipartiteGraph graph,
VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
salsaAsync(BipartiteGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
salsaAsync(BipartiteGraph graph,
double maxDiff,
int maxIter) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
salsaAsync(BipartiteGraph graph,
double maxDiff,
int maxIter,
VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
salsaAsync(BipartiteGraph graph,
VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> Partition<ID> |
sccKosaraju(PgxGraph graph) |
<ID> Partition<ID> |
sccKosaraju(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution) |
<ID> PgxFuture<Partition<ID>> |
sccKosarajuAsync(PgxGraph graph) |
<ID> PgxFuture<Partition<ID>> |
sccKosarajuAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitonDistribution) |
<ID> Partition<ID> |
sccTarjan(PgxGraph graph) |
<ID> Partition<ID> |
sccTarjan(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution) |
<ID> PgxFuture<Partition<ID>> |
sccTarjanAsync(PgxGraph graph) |
<ID> PgxFuture<Partition<ID>> |
sccTarjanAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitonDistribution) |
<ID> AllPaths<ID> |
shortestPathBellmanFord(PgxGraph graph,
ID srcId,
EdgeProperty<java.lang.Double> cost)
Convenience wrapper around
shortestPathBellmanFord(PgxGraph, PgxVertex, EdgeProperty) taking a vertex ID
instead of PgxVertex. |
<ID> AllPaths<ID> |
shortestPathBellmanFord(PgxGraph graph,
ID srcId,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
shortestPathBellmanFord(PgxGraph, PgxVertex, EdgeProperty, VertexProperty,
VertexProperty, VertexProperty) taking a vertex ID
instead of PgxVertex. |
<ID> AllPaths<ID> |
shortestPathBellmanFord(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost) |
<ID> AllPaths<ID> |
shortestPathBellmanFord(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
<ID> PgxFuture<AllPaths<ID>> |
shortestPathBellmanFordAsync(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost) |
<ID> PgxFuture<AllPaths<ID>> |
shortestPathBellmanFordAsync(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
<ID> AllPaths<ID> |
shortestPathBellmanFordReverse(PgxGraph graph,
ID srcId,
EdgeProperty<java.lang.Double> cost)
Convenience wrapper around
shortestPathBellmanFordReverse(PgxGraph, PgxVertex, EdgeProperty) taking a
vertex ID instead of PgxVertex. |
<ID> AllPaths<ID> |
shortestPathBellmanFordReverse(PgxGraph graph,
ID srcId,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
shortestPathBellmanFordReverse(PgxGraph, PgxVertex, EdgeProperty,
VertexProperty, VertexProperty, VertexProperty) taking a
vertex ID instead of PgxVertex. |
<ID> AllPaths<ID> |
shortestPathBellmanFordReverse(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost) |
<ID> AllPaths<ID> |
shortestPathBellmanFordReverse(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
<ID> PgxFuture<AllPaths<ID>> |
shortestPathBellmanFordReverseAsync(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost) |
<ID> PgxFuture<AllPaths<ID>> |
shortestPathBellmanFordReverseAsync(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
<ID> PgxPath<ID> |
shortestPathDijkstra(PgxGraph graph,
ID srcId,
ID dstId,
EdgeProperty<java.lang.Double> cost)
Convenience wrapper around
shortestPathDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty) taking
vertex IDs instead of PgxVertex. |
<ID> PgxPath<ID> |
shortestPathDijkstra(PgxGraph graph,
ID srcId,
ID dstId,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
shortestPathDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty) taking
vertex IDs instead of PgxVertex. |
<ID> PgxPath<ID> |
shortestPathDijkstra(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost) |
<ID> PgxPath<ID> |
shortestPathDijkstra(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
<ID> PgxFuture<PgxPath<ID>> |
shortestPathDijkstraAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost) |
<ID> PgxFuture<PgxPath<ID>> |
shortestPathDijkstraAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
<ID> PgxPath<ID> |
shortestPathDijkstraBidirectional(PgxGraph graph,
ID srcId,
ID dstId,
EdgeProperty<java.lang.Double> cost)
Convenience wrapper around
shortestPathDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty)
taking vertex IDs instead of PgxVertex. |
<ID> PgxPath<ID> |
shortestPathDijkstraBidirectional(PgxGraph graph,
ID srcId,
ID dstId,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
shortestPathDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty)
taking vertex IDs instead of PgxVertex. |
<ID> PgxPath<ID> |
shortestPathDijkstraBidirectional(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost) |
<ID> PgxPath<ID> |
shortestPathDijkstraBidirectional(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
<ID> PgxFuture<PgxPath<ID>> |
shortestPathDijkstraBidirectionalAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost) |
<ID> PgxFuture<PgxPath<ID>> |
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>> |
shortestPathDijkstraBidirectionalAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
<ID> PgxPath<ID> |
shortestPathFilteredDijkstra(PgxGraph graph,
ID srcId,
ID dstId,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr)
Convenience wrapper around
shortestPathFilteredDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter) taking vertex IDs
instead of PgxVertex. |
<ID> PgxPath<ID> |
shortestPathFilteredDijkstra(PgxGraph graph,
ID srcId,
ID dstId,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
shortestPathFilteredDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter) taking vertex IDs
instead of PgxVertex. |
<ID> PgxPath<ID> |
shortestPathFilteredDijkstra(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr) |
<ID> PgxPath<ID> |
shortestPathFilteredDijkstra(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
<ID> PgxFuture<PgxPath<ID>> |
shortestPathFilteredDijkstraAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr) |
<ID> PgxFuture<PgxPath<ID>> |
shortestPathFilteredDijkstraAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
<ID> PgxPath<ID> |
shortestPathFilteredDijkstraBidirectional(PgxGraph graph,
ID srcId,
ID dstId,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr)
Convenience wrapper around
shortestPathFilteredDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter)
taking vertex IDs instead of PgxVertex. |
<ID> PgxPath<ID> |
shortestPathFilteredDijkstraBidirectional(PgxGraph graph,
ID srcId,
ID dstId,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
shortestPathFilteredDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter)
taking vertex IDs instead of PgxVertex. |
<ID> PgxPath<ID> |
shortestPathFilteredDijkstraBidirectional(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr) |
<ID> PgxPath<ID> |
shortestPathFilteredDijkstraBidirectional(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
<ID> PgxFuture<PgxPath<ID>> |
shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr) |
<ID> PgxFuture<PgxPath<ID>> |
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>> |
shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
<ID> AllPaths<ID> |
shortestPathHopDist(PgxGraph graph,
ID srcId)
Convenience wrapper around
shortestPathHopDist(PgxGraph, PgxVertex) taking a vertex ID instead of
PgxVertex. |
<ID> AllPaths<ID> |
shortestPathHopDist(PgxGraph graph,
ID srcId,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
shortestPathHopDist(PgxGraph, PgxVertex, VertexProperty, VertexProperty,
VertexProperty) taking a vertex ID instead of
PgxVertex. |
<ID> AllPaths<ID> |
shortestPathHopDist(PgxGraph graph,
PgxVertex<ID> src) |
<ID> AllPaths<ID> |
shortestPathHopDist(PgxGraph graph,
PgxVertex<ID> src,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
<ID> PgxFuture<AllPaths<ID>> |
shortestPathHopDistAsync(PgxGraph graph,
PgxVertex<ID> src) |
<ID> PgxFuture<AllPaths<ID>> |
shortestPathHopDistAsync(PgxGraph graph,
PgxVertex<ID> src,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
<ID> AllPaths<ID> |
shortestPathHopDistReverse(PgxGraph graph,
ID srcId)
Convenience wrapper around
shortestPathHopDistReverse(PgxGraph, PgxVertex) taking a vertex ID instead of
PgxVertex. |
<ID> AllPaths<ID> |
shortestPathHopDistReverse(PgxGraph graph,
ID srcId,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
shortestPathHopDistReverse(PgxGraph, PgxVertex, VertexProperty, VertexProperty,
VertexProperty) taking a vertex ID instead of
PgxVertex. |
<ID> AllPaths<ID> |
shortestPathHopDistReverse(PgxGraph graph,
PgxVertex<ID> src) |
<ID> AllPaths<ID> |
shortestPathHopDistReverse(PgxGraph graph,
PgxVertex<ID> src,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
<ID> PgxFuture<AllPaths<ID>> |
shortestPathHopDistReverseAsync(PgxGraph graph,
PgxVertex<ID> src) |
<ID> PgxFuture<AllPaths<ID>> |
shortestPathHopDistReverseAsync(PgxGraph graph,
PgxVertex<ID> src,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge) |
<ID> VertexProperty<ID,java.lang.Integer> |
topologicalSchedule(PgxGraph graph,
VertexSet<ID> source) |
<ID> VertexProperty<ID,java.lang.Integer> |
topologicalSchedule(PgxGraph graph,
VertexSet<ID> source,
VertexProperty<ID,java.lang.Integer> topoSched) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
topologicalScheduleAsync(PgxGraph graph,
VertexSet<ID> source) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
topologicalScheduleAsync(PgxGraph graph,
VertexSet<ID> source,
VertexProperty<ID,java.lang.Integer> topoSched) |
<ID> VertexProperty<ID,java.lang.Integer> |
topologicalSort(PgxGraph graph) |
<ID> VertexProperty<ID,java.lang.Integer> |
topologicalSort(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> topoSort) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
topologicalSortAsync(PgxGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
topologicalSortAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> topoSort) |
java.lang.String |
toString() |
<ID> VertexProperty<ID,java.lang.Double> |
vertexBetweennessCentrality(PgxGraph graph) |
<ID> VertexProperty<ID,java.lang.Double> |
vertexBetweennessCentrality(PgxGraph graph,
VertexProperty<ID,java.lang.Double> bc) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
vertexBetweennessCentralityAsync(PgxGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
vertexBetweennessCentralityAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> bc) |
<ID> Partition<ID> |
wcc(PgxGraph graph) |
<ID> Partition<ID> |
wcc(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution) |
<ID> PgxFuture<Partition<ID>> |
wccAsync(PgxGraph graph) |
<ID> PgxFuture<Partition<ID>> |
wccAsync(PgxGraph graph,
java.lang.String partitonDistributionName) |
<ID> PgxFuture<Partition<ID>> |
wccAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitonDistribution) |
<ID> VertexProperty<ID,java.lang.Double> |
weightedPagerank(PgxGraph graph,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
<ID> VertexProperty<ID,java.lang.Double> |
weightedPagerank(PgxGraph graph,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
weightedPagerank(PgxGraph graph,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
<ID> VertexProperty<ID,java.lang.Double> |
weightedPagerank(PgxGraph graph,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
weightedPagerank(PgxGraph graph,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight) |
<ID> VertexProperty<ID,java.lang.Double> |
weightedPagerank(PgxGraph graph,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> VertexProperty<ID,java.lang.Double> |
weightedPagerank(PgxGraph graph,
EdgeProperty<java.lang.Double> weight) |
<ID> VertexProperty<ID,java.lang.Double> |
weightedPagerank(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
weightedPagerankAsync(PgxGraph graph,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
weightedPagerankAsync(PgxGraph graph,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
weightedPagerankAsync(PgxGraph graph,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
weightedPagerankAsync(PgxGraph graph,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
weightedPagerankAsync(PgxGraph graph,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
weightedPagerankAsync(PgxGraph graph,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
weightedPagerankAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
weightedPagerankAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank) |
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
whomToFollow(PgxGraph graph,
ID vertexId,
int topK)
Convenience wrapper around
whomToFollow(PgxGraph, PgxVertex, int) taking a vertex ID instead of a
PgxVertex. |
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
whomToFollow(PgxGraph graph,
ID vertexId,
int topK,
int sizeCircleOfTrust)
Convenience wrapper around
whomToFollow(PgxGraph, PgxVertex, int, int) taking a vertex ID instead of a
PgxVertex. |
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
whomToFollow(PgxGraph graph,
ID vertexId,
int topK,
int sizeCircleOfTrust,
int maxIter,
java.math.BigDecimal tol,
java.math.BigDecimal dampingFactor,
int salsaMaxIter,
java.math.BigDecimal salsaTol)
Convenience wrapper around
whomToFollow(PgxGraph, PgxVertex, int, int, int, BigDecimal, BigDecimal, int, BigDecimal)
taking a vertex ID instead of a PgxVertex. |
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
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
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>> |
whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex) |
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex,
int topK) |
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust) |
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust,
int maxIter,
double tol,
double dampingFactor,
int salsaMaxIter,
double salsaTol) |
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
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) |
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities) |
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities) |
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities) |
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex) |
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
int topK) |
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust) |
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust,
int maxIter,
double tol,
double dampingFactor,
int salsaMaxIter,
double salsaTol) |
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
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) |
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities) |
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities) |
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities) |
close, destroy, destroyAsyncpublic <V> EdgeProperty<java.lang.Double> adamicAdarCounting(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
EdgeProperty<Double> adamicAdar = analyst.adamicAdarCounting(graph);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + adamicAdar.getName() + " MATCH (x) ORDER BY x." + adamicAdar.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <V> EdgeProperty<java.lang.Double> adamicAdarCounting(PgxGraph graph, EdgeProperty<java.lang.Double> aa) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - aa - (out argument)
PgxGraph graph = ...;
EdgeProperty<Double> aa = graph.createEdgeProperty(PropertyType.DOUBLE);
EdgeProperty<Double> adamicAdar = analyst.adamicAdarCounting(graph, aa);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + adamicAdar.getName() + " MATCH (x) ORDER BY x." + adamicAdar.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic PgxFuture<EdgeProperty<java.lang.Double>> adamicAdarCountingAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<EdgeProperty<Double>> promise = analyst.adamicAdarCountingAsync(graph);
promise.thenCompose(adamicAdar -> graph.queryPgqlAsync(
"SELECT x, x." + adamicAdar.getName() + " MATCH (x) ORDER BY x." + adamicAdar.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public PgxFuture<EdgeProperty<java.lang.Double>> adamicAdarCountingAsync(PgxGraph graph, EdgeProperty<java.lang.Double> aa)
graph - aa - (out argument)
PgxGraph graph = ...;
EdgeProperty<Double> aa = graph.createEdgeProperty(PropertyType.DOUBLE);
PgxFuture<EdgeProperty<Double>> promise = analyst.adamicAdarCountingAsync(graph, aa);
promise.thenCompose(adamicAdar -> graph.queryPgqlAsync(
"SELECT x, x." + adamicAdar.getName() + " MATCH (x) ORDER BY x." + adamicAdar.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> VertexProperty<ID,java.lang.Double> approximateVertexBetweennessCentrality(PgxGraph graph, int k) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - k -
PgxGraph graph = ...;
VertexProperty<Integer, Double> betweenness = analyst.approximateVertexBetweennessCentrality(graph, 100);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + betweenness.getName() + " MATCH (x) ORDER BY x." + betweenness.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> approximateVertexBetweennessCentrality(PgxGraph graph, int k, VertexProperty<ID,java.lang.Double> bc) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - k - bc - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> bc = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> betweenness = analyst.approximateVertexBetweennessCentrality(graph, 100, bc);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + betweenness.getName() + " MATCH (x) ORDER BY x." + betweenness.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> approximateVertexBetweennessCentralityAsync(PgxGraph graph, int k)
graph - k -
PgxGraph graph = ...;
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.approximateVertexBetweennessCentralityAsync(
graph, 100);
promise.thenCompose(betweenness -> graph.queryPgqlAsync(
"SELECT x, x." + betweenness.getName() + " MATCH (x) ORDER BY x." + betweenness.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> approximateVertexBetweennessCentralityAsync(PgxGraph graph, int k, VertexProperty<ID,java.lang.Double> bc)
graph - k - bc - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> bc = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.approximateVertexBetweennessCentralityAsync(
graph, 100, bc);
promise.thenCompose(betweenness -> graph.queryPgqlAsync(
"SELECT x, x." + betweenness.getName() + " MATCH (x) ORDER BY x." + betweenness.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
@SafeVarargs public final <ID> VertexProperty<ID,java.lang.Double> approximateVertexBetweennessCentralityFromSeeds(PgxGraph graph, PgxVertex<ID>... seeds) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - seeds - the (unique) chosen nodes to be used to compute the approximated betweenness centrality coeficients.
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexProperty<Integer, Double> betweenness =
analyst.approximateVertexBetweennessCentralityFromSeeds(graph, vertex);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + betweenness.getName() + " MATCH (x) ORDER BY x." + betweenness.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedException@SafeVarargs public final <ID> VertexProperty<ID,java.lang.Double> approximateVertexBetweennessCentralityFromSeeds(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc, PgxVertex<ID>... seeds) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - bc - (out argument)
seeds - the (unique) chosen nodes to be used to compute the approximated betweenness centrality coeficients.
PgxGraph graph = ...;
VertexProperty<Integer, Double> bc = graph.createVertexProperty(PropertyType.DOUBLE);
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexProperty<Integer, Double> betweenness =
analyst.approximateVertexBetweennessCentralityFromSeeds(graph, bc, vertex);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + betweenness.getName() + " MATCH (x) ORDER BY x." + betweenness.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedException@SafeVarargs public final <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph, PgxVertex<ID>... seeds)
graph - seeds - the (unique) chosen nodes to be used to compute the approximated betweenness centrality coeficients.
PgxGraph graph = ...;
PgxVertex<Integer> v1 = graph.getVertex(128);
PgxVertex<Integer> v2 = graph.getVertex(333);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.approximateVertexBetweennessCentralityFromSeedsAsync(
graph, v1, v2);
promise.thenCompose(betweenness -> graph.queryPgqlAsync(
"SELECT x, x." + betweenness.getName() + " MATCH (x) ORDER BY x." + betweenness.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
@SafeVarargs public final <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc, PgxVertex<ID>... seeds)
graph - bc - (out argument)
seeds - the (unique) chosen nodes to be used to compute the approximated betweenness centrality coeficients.
PgxGraph graph = ...;
VertexProperty<Integer, Double> bc = graph.createVertexProperty(PropertyType.DOUBLE);
PgxVertex<Integer> v1 = graph.getVertex(128);
PgxVertex<Integer> v2 = graph.getVertex(333);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.approximateVertexBetweennessCentralityFromSeedsAsync(
graph, bc, v1, v2);
promise.thenCompose(betweenness -> graph.queryPgqlAsync(
"SELECT x, x." + betweenness.getName() + " MATCH (x) ORDER BY x." + betweenness.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> VertexSet<ID> center(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
VertexSet<Integer> center = analyst.center(graph);
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexSet<ID> center(PgxGraph graph, VertexSet<ID> center) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - center - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.createVertexSet();
VertexSet<Integer> center = analyst.center(graph, vertices);
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<VertexSet<ID>> centerAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<VertexSet<Integer>> promise = analyst.centerAsync(graph);
promise.thenAccept(center -> {
...;
});
public <ID> PgxFuture<VertexSet<ID>> centerAsync(PgxGraph graph, VertexSet<ID> center)
graph - center - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.createVertexSet();
PgxFuture<VertexSet<Integer>> promise = analyst.centerAsync(graph, vertices);
promise.thenAccept(center -> {
...;
});
public <ID> VertexProperty<ID,java.lang.Double> closenessCentralityDoubleLength(PgxGraph graph, EdgeProperty<java.lang.Double> cost) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - cost -
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> closeness = analyst.closenessCentralityDoubleLength(graph, cost);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + closeness.getName() + " MATCH (x) ORDER BY x." + closeness.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> closenessCentralityDoubleLength(PgxGraph graph, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> cc) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - cost - cc - (out argument)
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> cc = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> closeness = analyst.closenessCentralityDoubleLength(graph, cost, cc);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + closeness.getName() + " MATCH (x) ORDER BY x." + closeness.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<java.lang.Double> cost)
graph - cost -
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.closenessCentralityDoubleLengthAsync(graph, cost);
promise.thenCompose(closeness -> graph.queryPgqlAsync(
"SELECT x, x." + closeness.getName() + " MATCH (x) ORDER BY x." + closeness.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> cc)
graph - cost - cc - (out argument)
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> cc = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.closenessCentralityDoubleLengthAsync(graph, cost, cc);
promise.thenCompose(closeness -> graph.queryPgqlAsync(
"SELECT x, x." + closeness.getName() + " MATCH (x) ORDER BY x." + closeness.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> VertexProperty<ID,java.lang.Double> closenessCentralityUnitLength(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
VertexProperty<Integer, Double> closeness = analyst.closenessCentralityUnitLength(graph);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + closeness.getName() + " MATCH (x) ORDER BY x." + closeness.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> closenessCentralityUnitLength(PgxGraph graph, VertexProperty<ID,java.lang.Double> cc) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - cc - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> cc = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> closeness = analyst.closenessCentralityUnitLength(graph, cc);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + closeness.getName() + " MATCH (x) ORDER BY x." + closeness.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> closenessCentralityUnitLengthAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.closenessCentralityUnitLengthAsync(graph);
promise.thenCompose(closeness -> graph.queryPgqlAsync(
"SELECT x, x." + closeness.getName() + " MATCH (x) ORDER BY x." + closeness.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> closenessCentralityUnitLengthAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> cc)
graph - cc - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> cc = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.closenessCentralityUnitLengthAsync(graph, cc);
promise.thenCompose(closeness -> graph.queryPgqlAsync(
"SELECT x, x." + closeness.getName() + " MATCH (x) ORDER BY x." + closeness.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> Partition<ID> communitiesConductanceMinimization(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
Partition<Integer> conductance = analyst.communitiesConductanceMinimization(graph);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + conductance.getPropertyName() + " MATCH (x) ORDER BY x." + conductance.getPropertyName() +
" DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Partition<ID> communitiesConductanceMinimization(PgxGraph graph, int max) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - maxIteration -
PgxGraph graph = ...;
Partition<Integer> conductance = analyst.communitiesConductanceMinimization(graph, 100);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + conductance.getPropertyName() + " MATCH (x) ORDER BY x." + conductance.getPropertyName() +
" DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Partition<ID> communitiesConductanceMinimization(PgxGraph graph, int max, VertexProperty<ID,java.lang.Long> partitonDistribution) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - maxIteration - partitionDistribution -
PgxGraph graph = ...;
VertexProperty<Integer, Long> pd = graph.createVertexProperty(PropertyType.LONG);
Partition<Integer> conductance = analyst.communitiesConductanceMinimization(graph, 100, pd);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + conductance.getPropertyName() + " MATCH (x) ORDER BY x." + conductance.getPropertyName() +
" DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Partition<ID> communitiesConductanceMinimization(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - partitionDistribution -
PgxGraph graph = ...;
VertexProperty<Integer, Long> pd = graph.createVertexProperty(PropertyType.LONG);
Partition<Integer> conductance = analyst.communitiesConductanceMinimization(graph, pd);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + conductance.getPropertyName() + " MATCH (x) ORDER BY x." + conductance.getPropertyName() +
" DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<Partition<ID>> communitiesConductanceMinimizationAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<Partition<Integer>> promise = analyst.communitiesConductanceMinimizationAsync(graph);
promise.thenCompose(conductance -> graph.queryPgqlAsync(
"SELECT x, x." + conductance.getPropertyName() + " MATCH (x) ORDER BY x." + conductance.getPropertyName() +
" DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Partition<ID>> communitiesConductanceMinimizationAsync(PgxGraph graph, int max)
graph - max -
PgxGraph graph = ...;
PgxFuture<Partition<Integer>> promise = analyst.communitiesConductanceMinimizationAsync(graph, 100);
promise.thenCompose(conductance -> graph.queryPgqlAsync(
"SELECT x, x." + conductance.getPropertyName() + " MATCH (x) ORDER BY x." + conductance.getPropertyName() +
" DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Partition<ID>> communitiesConductanceMinimizationAsync(PgxGraph graph, int max, VertexProperty<ID,java.lang.Long> partitionDistribution)
graph - maxIteration - partitionDistribution -
PgxGraph graph = ...;
VertexProperty<Integer, Long> pd = graph.createVertexProperty(PropertyType.LONG);
PgxFuture<Partition<Integer>> promise = analyst.communitiesConductanceMinimizationAsync(graph, 100, pd);
promise.thenCompose(conductance -> graph.queryPgqlAsync(
"SELECT x, x." + conductance.getPropertyName() + " MATCH (x) ORDER BY x." + conductance.getPropertyName() +
" DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Partition<ID>> communitiesConductanceMinimizationAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution)
graph - partitionDistribution -
PgxGraph graph = ...;
VertexProperty<Integer, Long> pd = graph.createVertexProperty(PropertyType.LONG);
PgxFuture<Partition<Integer>> promise = analyst.communitiesConductanceMinimizationAsync(graph, pd);
promise.thenCompose(conductance -> graph.queryPgqlAsync(
"SELECT x, x." + conductance.getPropertyName() + " MATCH (x) ORDER BY x." + conductance.getPropertyName() +
" DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> Partition<ID> communitiesInfomap(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank, EdgeProperty<java.lang.Double> weight) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - rank - weight -
PgxGraph graph = ...;
EdgeProperty<Double> weight = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = analyst.weightedPagerank(graph, 1e-16, 0.85, 1000, true, weight);
VertexProperty<Integer, Long> module = graph.createVertexProperty(PropertyType.LONG);
Partition<Integer> promise = analyst.communitiesInfomap(graph, rank, weight);
first_component = promise.getPartitionByIndex(0)
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Partition<ID> communitiesInfomap(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank, EdgeProperty<java.lang.Double> weight, double tau, double tol, int maxIter) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - rank - weight - tau - tol - maxIter -
PgxGraph graph = ...;
EdgeProperty<Double> weight = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = analyst.weightedPagerank(graph, 1e-16, 0.85, 1000, true, weight);
VertexProperty<Integer, Long> module = graph.createVertexProperty(PropertyType.LONG);
Partition<Integer> promise = analyst.communitiesInfomap(graph, rank, weight, 0.15, 0.0001, 10);
first_component = promise.getPartitionByIndex(0)
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Partition<ID> 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) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - rank - weight - tau - tol - maxIter - module -
PgxGraph graph = ...;
EdgeProperty<Double> weight = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = analyst.weightedPagerank(graph, 1e-16, 0.85, 1000, true, weight);
VertexProperty<Integer, Long> module = graph.createVertexProperty(PropertyType.LONG);
Partition<Integer> promise = analyst.communitiesInfomap(graph, rank, weight, 0.15, 0.0001, 10, module);
first_component = promise.getPartitionByIndex(0)
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Partition<ID> communitiesInfomap(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Long> module) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - rank - weight - module -
PgxGraph graph = ...;
EdgeProperty<Double> weight = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = analyst.weightedPagerank(graph, 1e-16, 0.85, 1000, true, weight);
VertexProperty<Integer, Long> module = graph.createVertexProperty(PropertyType.LONG);
Partition<Integer> promise = analyst.communitiesInfomap(graph, rank, weight, module);
first_component = promise.getPartitionByIndex(0)
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<Partition<ID>> communitiesInfomapAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank, EdgeProperty<java.lang.Double> weight)
graph - rank - weight -
PgxGraph graph = ...;
EdgeProperty<Double> weight = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = analyst.weightedPagerank(graph, 1e-16, 0.85, 1000, true, weight);
VertexProperty<Integer, Long> module = graph.createVertexProperty(PropertyType.LONG);
PgxFuture<Partition<Integer>> promise = analyst.communitiesInfomapAsync(graph, rank, weight);
partition = promise.get()
first_component = partition.getPartitionByIndex(0)
public <ID> PgxFuture<Partition<ID>> communitiesInfomapAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank, EdgeProperty<java.lang.Double> weight, double tau, double tol, int maxIter)
graph - rank - weight - tau - tol - maxIter -
PgxGraph graph = ...;
EdgeProperty<Double> weight = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = analyst.weightedPagerank(graph, 1e-16, 0.85, 1000, true, weight);
VertexProperty<Integer, Long> module = graph.createVertexProperty(PropertyType.LONG);
PgxFuture<Partition<Integer>> promise = analyst.communitiesInfomapAsync(graph, rank, weight, 0.15, 0.0001, 10);
partition = promise.get()
first_component = partition.getPartitionByIndex(0)
public <ID> PgxFuture<Partition<ID>> 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)
graph - rank - weight - tau - tol - maxIter - module -
PgxGraph graph = ...;
EdgeProperty<Double> weight = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = analyst.weightedPagerank(graph, 1e-16, 0.85, 1000, true, weight);
VertexProperty<Integer, Long> module = graph.createVertexProperty(PropertyType.LONG);
PgxFuture<Partition<Integer>> promise = analyst.communitiesInfomapAsync(graph, rank, weight, 0.15, 0.0001,
10, module);
partition = promise.get()
first_component = partition.getPartitionByIndex(0)
public <ID> PgxFuture<Partition<ID>> communitiesInfomapAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Long> module)
graph - rank - weight - module -
PgxGraph graph = ...;
EdgeProperty<Double> weight = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = analyst.weightedPagerank(graph, 1e-16, 0.85, 1000, true, weight);
VertexProperty<Integer, Long> module = graph.createVertexProperty(PropertyType.LONG);
PgxFuture<Partition<Integer>> promise = analyst.communitiesInfomapAsync(graph, rank, weight, module);
partition = promise.get()
first_component = partition.getPartitionByIndex(0)
public <ID> Partition<ID> communitiesLabelPropagation(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
Partition<Integer> conductance = analyst.communitiesLabelPropagation(graph);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + conductance.getPropertyName() + " MATCH (x) ORDER BY x." + conductance.getPropertyName() +
" DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Partition<ID> communitiesLabelPropagation(PgxGraph graph, int maxIterations) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - maxIteration -
PgxGraph graph = ...;
Partition<Integer> conductance = analyst.communitiesLabelPropagation(graph, 100);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + conductance.getPropertyName() + " MATCH (x) ORDER BY x." + conductance.getPropertyName() +
" DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Partition<ID> communitiesLabelPropagation(PgxGraph graph, int maxIterations, VertexProperty<ID,java.lang.Long> partitonDistribution) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - maxIteration - partitionDistribution -
PgxGraph graph = ...;
VertexProperty<Integer, Long> pd = graph.createVertexProperty(PropertyType.LONG);
Partition<Integer> conductance = analyst.communitiesLabelPropagation(graph, 100, pd);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + conductance.getPropertyName() + " MATCH (x) ORDER BY x." + conductance.getPropertyName() +
" DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Partition<ID> communitiesLabelPropagation(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - partitionDistribution -
PgxGraph graph = ...;
VertexProperty<Integer, Long> pd = graph.createVertexProperty(PropertyType.LONG);
Partition<Integer> conductance = analyst.communitiesLabelPropagation(graph, pd);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + conductance.getPropertyName() + " MATCH (x) ORDER BY x." + conductance.getPropertyName() +
" DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<Partition<ID>> communitiesLabelPropagationAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<Partition<Integer>> promise = analyst.communitiesLabelPropagationAsync(graph);
promise.thenCompose(conductance -> graph.queryPgqlAsync(
"SELECT x, x." + conductance.getPropertyName() + " MATCH (x) ORDER BY x." + conductance.getPropertyName() +
" DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Partition<ID>> communitiesLabelPropagationAsync(PgxGraph graph, int maxIteration)
graph - maxIteration -
PgxGraph graph = ...;
PgxFuture<Partition<Integer>> promise = analyst.communitiesLabelPropagationAsync(graph, 100);
promise.thenCompose(conductance -> graph.queryPgqlAsync(
"SELECT x, x." + conductance.getPropertyName() + " MATCH (x) ORDER BY x." + conductance.getPropertyName() +
" DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Partition<ID>> communitiesLabelPropagationAsync(PgxGraph graph, int maxIteration, VertexProperty<ID,java.lang.Long> partitionDistribution)
graph - maxIteration - partitionDistribution -
PgxGraph graph = ...;
VertexProperty<Integer, Long> pd = graph.createVertexProperty(PropertyType.LONG);
PgxFuture<Partition<Integer>> promise = analyst.communitiesLabelPropagationAsync(graph, 100, pd);
promise.thenCompose(conductance -> graph.queryPgqlAsync(
"SELECT x, x." + conductance.getPropertyName() + " MATCH (x) ORDER BY x." + conductance.getPropertyName() +
" DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Partition<ID>> communitiesLabelPropagationAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution)
graph - partitionDistribution -
PgxGraph graph = ...;
VertexProperty<Integer, Long> pd = graph.createVertexProperty(PropertyType.LONG);
PgxFuture<Partition<Integer>> promise = analyst.communitiesLabelPropagationAsync(graph, pd);
promise.thenCompose(conductance -> graph.queryPgqlAsync(
"SELECT x, x." + conductance.getPropertyName() + " MATCH (x) ORDER BY x." + conductance.getPropertyName() +
" DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> Scalar<java.lang.Double> conductance(PgxGraph graph, Partition<ID> partition, long partitionIndex) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - partition - Partition of the graph with the corresponding node collections.partitionIndex -
PgxGraph graph = ...;
Partition<Integer> partition = analyst.communitiesConductanceMinimization(graph);
Scalar<Double> conductance = analyst.conductance(graph, partition, 0);
conductance.get();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Scalar<java.lang.Double> conductance(PgxGraph graph, Partition<ID> partition, long partitionIndex, Scalar<java.lang.Double> conductance) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - partition - Partition of the graph with the corresponding node collections.partitionIndex - conductance - Scalar (double) to store the conductance value of the given cut.
PgxGraph graph = ...;
Partition<Integer> partition = analyst.communitiesConductanceMinimization(graph);
Scalar<Double> scalar = graph.createScalar(PropertyType.DOUBLE);
Scalar<Double> conductance = analyst.conductance(graph, partition, 0, scalar);
conductance.get();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<Scalar<java.lang.Double>> conductanceAsync(PgxGraph graph, Partition<ID> partition, long partitionIndex)
graph - partition - Partition of the graph with the corresponding node collections.partitionIndex -
PgxGraph graph = ...;
Partition<Integer> partition = analyst.communitiesConductanceMinimization(graph);
PgxFuture<Scalar<Double>> promise = analyst.conductanceAsync(graph, partition, 0);
promise.thenAccept(conductance -> {
conductance.get();
});
public <ID> PgxFuture<Scalar<java.lang.Double>> conductanceAsync(PgxGraph graph, Partition<ID> partition, long partitionIndex, Scalar<java.lang.Double> conductance)
graph - partition - Partition of the graph with the corresponding node collections.partitionIndex - conductance - Scalar (double) to store the conductance value of the given cut.
PgxGraph graph = ...;
Scalar<Double> scalar = graph.createScalar(PropertyType.DOUBLE);
Partition<Integer> partition = analyst.communitiesConductanceMinimization(graph);
PgxFuture<Scalar<Double>> promise = analyst.conductanceAsync(graph, partition, 0, scalar);
promise.thenAccept(conductance -> {
conductance.get();
});
public long countTriangles(PgxGraph graph, boolean sortVerticesByDegree) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - sortVerticesByDegree - boolean flag for sorting the nodes by their degree as preprocessing step.
PgxGraph graph = ...;
long result = analyst.countTriangles(graph, true);
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic PgxFuture<java.lang.Long> countTrianglesAsync(PgxGraph graph, boolean sortVerticesByDegree)
graph - sortVerticesByDegree - boolean flag for sorting the nodes by their degree as preprocessing step.
PgxGraph graph = ...;
PgxFuture<Long> promise = analyst.countTrianglesAsync(graph, true);
promise.thenAccept(result -> {
...;
});
public <ID> VertexProperty<ID,java.lang.Integer> degreeCentrality(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
VertexProperty<Integer, Integer> degree = analyst.degreeCentrality(graph);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + degree.getName() + " MATCH (x) ORDER BY x." + degree.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Integer> degreeCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - dc - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Integer> dc = graph.createVertexProperty(PropertyType.INTEGER);
VertexProperty<Integer, Integer> degree = analyst.degreeCentrality(graph, dc);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + degree.getName() + " MATCH (x) ORDER BY x." + degree.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> degreeCentralityAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<VertexProperty<Integer, Integer>> promise = analyst.degreeCentralityAsync(graph);
promise.thenCompose(degree -> graph.queryPgqlAsync(
"SELECT x, x." + degree.getName() + " MATCH (x) ORDER BY x." + degree.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> degreeCentralityAsync(PgxGraph graph, java.lang.String propertyName)
public <ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> degreeCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
graph - dc - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Integer> dc = graph.createVertexProperty(PropertyType.INTEGER);
PgxFuture<VertexProperty<Integer, Integer>> promise = analyst.degreeCentralityAsync(graph, dc);
promise.thenCompose(degree -> graph.queryPgqlAsync(
"SELECT x, x." + degree.getName() + " MATCH (x) ORDER BY x." + degree.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> diameter(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
Pair<Scalar<Integer>, VertexProperty<Integer, Integer>> diameter = analyst.diameter(graph);
diameter.getFirst().get();
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + diameter.getSecond().getName() + " MATCH (x) ORDER BY x." + diameter.getSecond().getName() +
" DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> diameter(PgxGraph graph, Scalar<java.lang.Integer> diameter, VertexProperty<ID,java.lang.Integer> eccentricity) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - diameter - Scalar (integer) for holding the value of the diameter of the graph.eccentricity - (out argument)
PgxGraph graph = ...;
Scalar<Integer> scalar = graph.createScalar(PropertyType.INTEGER);
VertexProperty<Integer, Integer> prop = graph.CreateVertexProperty(PropertyType.INTEGER);
Pair<Scalar<Integer>, VertexProperty<Integer, Integer>> diameter = analyst.diameter(graph, scalar, prop);
diameter.getFirst().get();
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + diameter.getSecond().getName() + " MATCH (x) ORDER BY x." + diameter.getSecond().getName() +
" DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> diameterAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<Pair<Scalar<Integer>, VertexProperty<Integer, Integer>>> promise = analyst.diameterAsync(graph);
promise.thenCompose(diameter -> {
diameter.getFirst().get();
graph.queryPgqlAsync(
"SELECT x, x." + diameter.getSecond().getName() + " MATCH (x) ORDER BY x." + diameter.getSecond().getName() +
" DESC"))
.thenAccept(PgqlResultSet::print);
});
public <ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> diameterAsync(PgxGraph graph, Scalar<java.lang.Integer> diameter, VertexProperty<ID,java.lang.Integer> eccentricity)
graph - diameter - Scalar (integer) for holding the value of the diameter of the graph.eccentricity - (out argument)
PgxGraph graph = ...;
Scalar<Integer> scalar = graph.createScalar(PropertyType.INTEGER);
VertexProperty<Integer, Integer> prop = graph.createVertexProperty(PropertyType.INTEGER);
PgxFuture<Pair<Scalar<Integer>, VertexProperty<Integer, Integer>>> promise = analyst.diameterAsync(
graph, scalar, prop);
promise.thenCompose(diameter -> {
diameter.getFirst().get();
graph.queryPgqlAsync(
"SELECT x, x." + diameter.getSecond().getName() + " MATCH (x) ORDER BY x." + diameter.getSecond().getName() +
" DESC"))
.thenAccept(PgqlResultSet::print);
});
public <ID> VertexProperty<ID,java.lang.Double> eigenvectorCentrality(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
VertexProperty<Integer, Double> eigenvector = analyst.eigenvectorCentrality(graph);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + eigenvector.getName() + " MATCH (x) ORDER BY x." + eigenvector.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> eigenvectorCentrality(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - max - maxDiff - useL2Norm - useInEdge -
PgxGraph graph = ...;
VertexProperty<Integer, Double> eigenvector = analyst.eigenvectorCentrality(graph, 100, 0.001, false, false);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + eigenvector.getName() + " MATCH (x) ORDER BY x." + eigenvector.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> eigenvectorCentrality(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge, VertexProperty<ID,java.lang.Double> ec) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - max - maxDiff - useL2Norm - useInEdge - ec - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> ec = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> eigenvector = analyst.eigenvectorCentrality(graph, 100, 0.001, false, false, ec);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + eigenvector.getName() + " MATCH (x) ORDER BY x." + eigenvector.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> eigenvectorCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Double> ec) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - ec - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> ec = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> eigenvector = analyst.eigenvectorCentrality(graph, ec);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + eigenvector.getName() + " MATCH (x) ORDER BY x." + eigenvector.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> eigenvectorCentralityAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.eigenvectorCentralityAsync(graph);
promise.thenCompose(eigenvector -> graph.queryPgqlAsync(
"SELECT x, x." + eigenvector.getName() + " MATCH (x) ORDER BY x." + eigenvector.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> eigenvectorCentralityAsync(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge)
graph - max - maxDiff - useL2Norm - useInEdge -
PgxGraph graph = ...;
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.eigenvectorCentralityAsync(
graph, 100, 0.001, false, false);
promise.thenCompose(eigenvector -> graph.queryPgqlAsync(
"SELECT x, x." + eigenvector.getName() + " MATCH (x) ORDER BY x." + eigenvector.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> eigenvectorCentralityAsync(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge, VertexProperty<ID,java.lang.Double> ec)
graph - max - maxDiff - useL2Norm - useInEdge - ec - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> ec = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.eigenvectorCentralityAsync(
graph, 100, 0.001, false, false, ec);
promise.thenCompose(eigenvector -> graph.queryPgqlAsync(
"SELECT x, x." + eigenvector.getName() + " MATCH (x) ORDER BY x." + eigenvector.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> eigenvectorCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> ec)
graph - ec - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> ec = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.eigenvectorCentralityAsync(graph, ec);
promise.thenCompose(eigenvector -> graph.queryPgqlAsync(
"SELECT x, x." + eigenvector.getName() + " MATCH (x) ORDER BY x." + eigenvector.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> AllPaths<ID> fattestPath(PgxGraph graph, ID rootId, EdgeProperty<java.lang.Double> capacity) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
fattestPath(PgxGraph, PgxVertex, EdgeProperty) taking a vertex ID instead of a
PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> AllPaths<ID> 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) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
fattestPath(PgxGraph, PgxVertex, EdgeProperty, VertexProperty,
VertexProperty, VertexProperty) taking a vertex ID instead of a
PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> AllPaths<ID> fattestPath(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - root - capacity -
PgxGraph graph = ...;
PgxVertex<Integer> root = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
AllPaths<Integer> fattestPath = analyst.fattestPath(graph, root, cost);
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> AllPaths<ID> 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) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - root - capacity - distance - (out argument) parent - (out argument) parentEdge - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> root = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> distance = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
VertexProperty<Integer, PgxEdge> parentEdge = graph.createVertexProperty(PropertyType.EDGE);
AllPaths<Integer> fattestPath = analyst.fattestPath(graph, root, cost, distance, parent, parentEdge);
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<AllPaths<ID>> fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity)
graph - root - capacity -
PgxGraph graph = ...;
PgxVertex<Integer> root = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<AllPaths<Integer>> promise = analyst.fattestPathAsync(graph, root, cost);
promise.thenAccept(paths -> {
...;
});
public <ID> PgxFuture<AllPaths<ID>> 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)
graph - root - capacity - distance - (out argument) parent - (out argument) parentEdge - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> root = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> distance = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
VertexProperty<Integer, PgxEdge> parentEdge = graph.createVertexProperty(PropertyType.EDGE);
PgxFuture<AllPaths<Integer>> promise = analyst.fattestPathAsync(graph, root, cost, distance, parent, parentEdge);
promise.thenAccept(paths -> {
...;
});
public <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredBfs(PgxGraph graph, ID root) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
filteredBfs(PgxGraph, PgxVertex)
taking a vertex ID instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredBfs(PgxGraph graph, ID root, int maxDepth) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
filteredBfs(PgxGraph, PgxVertex, int)
taking a vertex ID instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredBfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter)
taking a vertex ID instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredBfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, boolean initWithInf) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean)
taking a vertex ID instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredBfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, int maxDepth) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, int)
taking a vertex ID instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredBfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, int maxDepth, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, int, VertexProperty,
VertexProperty)
taking a vertex ID instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredBfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, VertexProperty,
VertexProperty)
taking a vertex ID instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredBfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, int maxDepth) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, int)
taking a vertex ID instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredBfs(PgxGraph graph, PgxVertex<ID> root) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - root -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>> bfs =
analyst.filteredBfs(graph, vertex);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + bfs.getFirst().getName() + ", x." + bfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
bfs.getFirst().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredBfs(PgxGraph graph, PgxVertex<ID> root, int maxDepth) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - root - maxDepth -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>> bfs =
analyst.filteredBfs(graph, vertex, 2);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + bfs.getFirst().getName() + ", x." + bfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
bfs.getFirst().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - root - filter - navigator -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>> bfs =
analyst.filteredBfs(graph, vertex, filter, navigator);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + bfs.getFirst().getName() + ", x." + bfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
bfs.getFirst().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - root - filter - navigator - initWithInf -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>> bfs =
analyst.filteredBfs(graph, vertex, filter, navigator, true);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + bfs.getFirst().getName() + ", x." + bfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
bfs.getFirst().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, int maxDepth) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - root - filter - navigator - initWithInf - maxDepth -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>> bfs =
analyst.filteredBfs(graph, vertex, filter, navigator, true, 2);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + bfs.getFirst().getName() + ", x." + bfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
bfs.getFirst().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, int maxDepth, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - root - filter - navigator - initWithInf - maxDepth - distance - (out argument) parent - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
VertexProperty<Integer, Integer> distance = graph.createVertexProperty(PropertyType.INTEGER);
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>> bfs =
analyst.filteredBfs(graph, vertex, filter, navigator, true, distance, parent);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + bfs.getFirst().getName() + ", x." + bfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
bfs.getFirst().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - root - filter - navigator - initWithInf - distance - (out argument) parent - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
VertexProperty<Integer, Integer> distance = graph.createVertexProperty(PropertyType.INTEGER);
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>> bfs =
analyst.filteredBfs(graph, vertex, filter, navigator, true, distance, parent);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + bfs.getFirst().getName() + ", x." + bfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
bfs.getFirst().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, int maxDepth) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - root - filter - navigator - maxDepth -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>> bfs =
analyst.filteredBfs(graph, vertex, filter, navigator, 2);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + bfs.getFirst().getName() + ", x." + bfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
bfs.getFirst().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root)
graph - root -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
PgxFuture<Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>>> promise =
analyst.filteredBfsAsync(graph, vertex);
promise.thenCompose(bfs -> graph.queryPgqlAsync(
"SELECT x, x." + bfs.getFirst().getName() + ", x." + bfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
bfs.getFirst().getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, int maxDepth)
graph - root - maxDepth -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
PgxFuture<Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>>> promise =
analyst.filteredBfsAsync(graph, vertex, 2);
promise.thenCompose(bfs -> graph.queryPgqlAsync(
"SELECT x, x." + bfs.getFirst().getName() + ", x." + bfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
bfs.getFirst().getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator)
graph - root - filter - navigator -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
PgxFuture<Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>>> promise =
analyst.filteredBfsAsync(graph, vertex, filter, navigator);
promise.thenCompose(bfs -> graph.queryPgqlAsync(
"SELECT x, x." + bfs.getFirst().getName() + ", x." + bfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
bfs.getFirst().getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf)
graph - root - filter - navigator - initWithInf -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
PgxFuture<Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>>> promise =
analyst.filteredBfsAsync(graph, vertex, filter, navigator, true);
promise.thenCompose(bfs -> graph.queryPgqlAsync(
"SELECT x, x." + bfs.getFirst().getName() + ", x." + bfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
bfs.getFirst().getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, int maxDepth)
graph - root - filter - navigator - initWithInf - maxDepth -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
PgxFuture<Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>>> promise =
analyst.filteredBfsAsync(graph, vertex, filter, navigator, true, 2);
promise.thenCompose(bfs -> graph.queryPgqlAsync(
"SELECT x, x." + bfs.getFirst().getName() + ", x." + bfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
bfs.getFirst().getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, int maxDepth, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
graph - root - filter - navigator - initWithInf - maxDepth - distance - (out argument) parent - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
VertexProperty<Integer, Integer> distance = graph.createVertexProperty(PropertyType.INTEGER);
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
PgxFuture<Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>>> promise =
analyst.filteredBfsAsync(graph, vertex, filter, navigator, true, 2, distance, parent);
promise.thenCompose(bfs -> graph.queryPgqlAsync(
"SELECT x, x." + bfs.getFirst().getName() + ", x." + bfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
bfs.getFirst().getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
graph - root - filter - navigator - initWithInf - distance - (out argument) parent - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
VertexProperty<Integer, Integer> distance = graph.createVertexProperty(PropertyType.INTEGER);
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
PgxFuture<Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>>> promise =
analyst.filteredBfsAsync(graph, vertex, filter, navigator, true, distance, parent);
promise.thenCompose(bfs -> graph.queryPgqlAsync(
"SELECT x, x." + bfs.getFirst().getName() + ", x." + bfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
bfs.getFirst().getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, int maxDepth)
graph - root - filter - navigator - maxDepth -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
PgxFuture<Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>>> promise =
analyst.filteredBfsAsync(graph, vertex, filter, navigator, 2);
promise.thenCompose(bfs -> graph.queryPgqlAsync(
"SELECT x, x." + bfs.getFirst().getName() + ", x." + bfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
bfs.getFirst().getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredDfs(PgxGraph graph, ID root) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
filteredDfs(PgxGraph, PgxVertex)
taking a vertex ID instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredDfs(PgxGraph graph, ID root, int maxDepth) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
filteredDfs(PgxGraph, PgxVertex, int)
taking a vertex ID instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredDfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
filteredDfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter)
taking a vertex ID instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredDfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, boolean initWithInf) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
filteredDfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean)
taking a vertex ID instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredDfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, int maxDepth) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
filteredDfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, int)
taking a vertex ID instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredDfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, int maxDepth, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
filteredDfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, int, VertexProperty,
VertexProperty)
taking a vertex ID instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredDfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
filteredDfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, VertexProperty,
VertexProperty)
taking a vertex ID instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredDfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, int maxDepth) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
filteredDfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, int)
taking a vertex ID instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredDfs(PgxGraph graph, PgxVertex<ID> root) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - root -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>> dfs =
analyst.filteredDfs(graph, vertex);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + dfs.getFirst().getName() + ", x." + dfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
dfs.getFirst().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredDfs(PgxGraph graph, PgxVertex<ID> root, int maxDepth) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - root - maxDepth -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>> dfs =
analyst.filteredDfs(graph, vertex, 2);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + dfs.getFirst().getName() + ", x." + dfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
dfs.getFirst().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredDfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - root - filter - navigator -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>> dfs =
analyst.filteredDfs(graph, vertex, filter, navigator);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + dfs.getFirst().getName() + ", x." + dfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
dfs.getFirst().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredDfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - root - filter - navigator - initWithInf -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>> dfs =
analyst.filteredDfs(graph, vertex, filter, navigator, true);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + dfs.getFirst().getName() + ", x." + dfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
dfs.getFirst().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredDfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, int maxDepth) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - root - filter - navigator - initWithInf - maxDepth -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>> dfs =
analyst.filteredDfs(graph, vertex, filter, navigator, true, 2);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + dfs.getFirst().getName() + ", x." + dfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
dfs.getFirst().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredDfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, int maxDepth, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - root - filter - navigator - initWithInf - maxDepth - distance - (out argument) parent - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
VertexProperty<Integer, Integer> distance = graph.createVertexProperty(PropertyType.INTEGER);
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>> dfs =
analyst.filteredDfs(graph, vertex, filter, navigator, true, distance, parent);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + dfs.getFirst().getName() + ", x." + dfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
dfs.getFirst().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredDfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - root - filter - navigator - initWithInf - distance - (out argument) parent - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
VertexProperty<Integer, Integer> distance = graph.createVertexProperty(PropertyType.INTEGER);
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>> dfs =
analyst.filteredDfs(graph, vertex, filter, navigator, true, distance, parent);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + dfs.getFirst().getName() + ", x." + dfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
dfs.getFirst().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> filteredDfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, int maxDepth) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - root - filter - navigator - maxDepth -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>> dfs =
analyst.filteredDfs(graph, vertex, filter, navigator, 2);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + dfs.getFirst().getName() + ", x." + dfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
dfs.getFirst().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root)
graph - root -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
PgxFuture<Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>>> promise =
analyst.filteredDfsAsync(graph, vertex);
promise.thenCompose(dfs -> graph.queryPgqlAsync(
"SELECT x, x." + dfs.getFirst().getName() + ", x." + dfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
dfs.getFirst().getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root, int maxDepth)
graph - root - maxDepth -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
PgxFuture<Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>>> promise =
analyst.filteredDfsAsync(graph, vertex, 2);
promise.thenCompose(dfs -> graph.queryPgqlAsync(
"SELECT x, x." + dfs.getFirst().getName() + ", x." + dfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
dfs.getFirst().getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator)
graph - root - filter - navigator -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
PgxFuture<Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>>> promise =
analyst.filteredDfsAsync(graph, vertex, filter, navigator);
promise.thenCompose(dfs -> graph.queryPgqlAsync(
"SELECT x, x." + dfs.getFirst().getName() + ", x." + dfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
dfs.getFirst().getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf)
graph - root - filter - navigator - initWithInf -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
PgxFuture<Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>>> promise =
analyst.filteredDfsAsync(graph, vertex, filter, navigator, true);
promise.thenCompose(dfs -> graph.queryPgqlAsync(
"SELECT x, x." + dfs.getFirst().getName() + ", x." + dfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
dfs.getFirst().getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, int maxDepth)
graph - root - filter - navigator - initWithInf - maxDepth -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
PgxFuture<Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>>> promise =
analyst.filteredDfsAsync(graph, vertex, filter, navigator, true, 2);
promise.thenCompose(dfs -> graph.queryPgqlAsync(
"SELECT x, x." + dfs.getFirst().getName() + ", x." + dfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
dfs.getFirst().getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, int maxDepth, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
graph - root - filter - navigator - initWithInf - maxDepth - distance - (out argument) parent - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
VertexProperty<Integer, Integer> distance = graph.createVertexProperty(PropertyType.INTEGER);
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
PgxFuture<Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>>> promise =
analyst.filteredDfsAsync(graph, vertex, filter, navigator, true, 2, distance, parent);
promise.thenCompose(dfs -> graph.queryPgqlAsync(
"SELECT x, x." + dfs.getFirst().getName() + ", x." + dfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
dfs.getFirst().getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
graph - root - filter - navigator - initWithInf - distance - (out argument) parent - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
VertexProperty<Integer, Integer> distance = graph.createVertexProperty(PropertyType.INTEGER);
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
PgxFuture<Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>>> promise =
analyst.filteredDfsAsync(graph, vertex, filter, navigator, true, distance, parent);
promise.thenCompose(dfs -> graph.queryPgqlAsync(
"SELECT x, x." + dfs.getFirst().getName() + ", x." + dfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
dfs.getFirst().getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, int maxDepth)
graph - root - filter - navigator - maxDepth -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexFilter filter = new VertexFilter("true");
VertexFilter navigator = new VertexFilter("true");
PgxFuture<Pair<VertexProperty<Integer, Integer>, VertexProperty<Integer, PgxVertex<Integer>>>> promise =
analyst.filteredDfsAsync(graph, vertex, filter, navigator, 2);
promise.thenCompose(dfs -> graph.queryPgqlAsync(
"SELECT x, x." + dfs.getFirst().getName() + ", x." + dfs.getSecond().getName() + " MATCH (x) ORDER BY x." +
dfs.getFirst().getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxPath<ID> findCycle(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
PgxPath<Integer> cycle = analyst.findCycle(graph);
cycle.getPathLengthWithCost();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxPath<ID> findCycle(PgxGraph graph, PgxVertex<ID> src) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - src -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
PgxPath<Integer> cycle = analyst.findCycle(graph, vertex);
cycle.getPathLengthWithCost();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxPath<ID> findCycle(PgxGraph graph, PgxVertex<ID> src, VertexSequence<ID> nodeSeq, EdgeSequence edgeSeq) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - src - nodeSeq - (out argument)
edgeSeq - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexSequence<Integer> nodeSeq = graph.createVertexSequence();
EdgeSequence edgeSeq = graph.createEdgeSequence();
PgxPath<Integer> cycle = analyst.findCycle(graph, vertex, nodeSeq, edgeSeq);
cycle.getPathLengthWithCost();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxPath<ID> findCycle(PgxGraph graph, VertexSequence<ID> nodeSeq, EdgeSequence edgeSeq) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - nodeSeq - (out argument) edgeSeq - (out argument)
PgxGraph graph = ...;
VertexSequence<Integer> nodeSeq = graph.createVertexSequence();
EdgeSequence edgeSeq = graph.createEdgeSequence();
PgxPath<Integer> cycle = analyst.findCycle(graph, nodeSeq, edgeSeq);
cycle.getPathLengthWithCost();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<PgxPath<ID>> findCycleAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<PgxPath<Integer>> promise = analyst.findCycleAsync(graph);
promise.thenAccept(path -> {
path.getPathLengthWithCost();
});
public <ID> PgxFuture<PgxPath<ID>> findCycleAsync(PgxGraph graph, PgxVertex<ID> src)
graph - src -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
PgxFuture<PgxPath<Integer>> promise = analyst.findCycleAsync(graph, vertex);
promise.thenAccept(path -> {
path.getPathLengthWithCost();
});
public <ID> PgxFuture<PgxPath<ID>> findCycleAsync(PgxGraph graph, PgxVertex<ID> src, VertexSequence<ID> nodeSeq, EdgeSequence edgeSeq)
graph - src - nodeSeq - (out argument)
edgeSeq - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexSequence<Integer> nodeSeq = graph.createVertexSequence();
EdgeSequence edgeSeq = graph.createEdgeSequence();
PgxFuture<PgxPath<Integer>> promise = analyst.findCycleAsync(graph, vertex, nodeSeq, edgeSeq);
promise.thenAccept(path -> {
path.getPathLengthWithCost();
});
public <ID> PgxFuture<PgxPath<ID>> findCycleAsync(PgxGraph graph, VertexSequence<ID> nodeSeq, EdgeSequence edgeSeq)
graph - nodeSeq - (out argument) edgeSeq - (out argument)
PgxGraph graph = ...;
VertexSequence<Integer> nodeSeq = graph.createVertexSequence();
EdgeSequence edgeSeq = graph.createEdgeSequence();
PgxFuture<PgxPath<Integer>> promise = analyst.findCycleAsync(graph, nodeSeq, edgeSeq);
promise.thenAccept(path -> {
path.getPathLengthWithCost();
});
public PgxSession getSession()
public <ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> hits(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
Pair<VertexProperty<Integer, Double>, VertexProperty<Integer, Double>> hits = analyst.hits(graph);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + hits.getFirst().getName() + ", x." + hits.getSecond().getName() + " MATCH (x) ORDER BY x." +
hits.getFirst().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> hits(PgxGraph graph, int max) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - max -
PgxGraph graph = ...;
Pair<VertexProperty<Integer, Double>, VertexProperty<Integer, Double>> hits = analyst.hits(graph, 100);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + hits.getFirst().getName() + ", x." + hits.getSecond().getName() + " MATCH (x) ORDER BY x." +
hits.getFirst().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> hits(PgxGraph graph, int max, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - max - auth - (out argument) hubs - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> auth = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> hubs = graph.createVertexProperty(PropertyType.DOUBLE);
Pair<VertexProperty<Integer, Double>, VertexProperty<Integer, Double>> hits = analyst.hits(graph, 100, auth, hubs);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + hits.getFirst().getName() + ", x." + hits.getSecond().getName() + " MATCH (x) ORDER BY x." +
hits.getFirst().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> hits(PgxGraph graph, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - auth - (out argument) hubs - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> auth = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> hubs = graph.createVertexProperty(PropertyType.DOUBLE);
Pair<VertexProperty<Integer, Double>, VertexProperty<Integer, Double>> hits = analyst.hits(graph, auth, hubs);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + hits.getFirst().getName() + ", x." + hits.getSecond().getName() + " MATCH (x) ORDER BY x." +
hits.getFirst().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> hitsAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<Pair<VertexProperty<Integer, Double>, VertexProperty<Integer, Double>>> promise = analyst.hitsAsync(
graph);
promise.thenCompose(hits -> graph.queryPgqlAsync(
"SELECT x, x." + hits.getFirst().getName() + " x." + hits.getSecond().getName() + " MATCH (x) ORDER BY x." +
hits.getFirst().getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> hitsAsync(PgxGraph graph, int max)
graph - max -
PgxGraph graph = ...;
PgxFuture<Pair<VertexProperty<Integer, Double>, VertexProperty<Integer, Double>>> promise = analyst.hitsAsync(
graph, 100);
promise.thenCompose(hits -> graph.queryPgqlAsync(
"SELECT x, x." + hits.getFirst().getName() + " x." + hits.getSecond().getName() + " MATCH (x) ORDER BY x." +
hits.getFirst().getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> hitsAsync(PgxGraph graph, int max, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)
graph - max - auth - (out argument) hubs - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> auth = graph.CreateVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> hubs = graph.CreateVertexProperty(PropertyType.DOUBLE);
PgxFuture<Pair<VertexProperty<Integer, Double>, VertexProperty<Integer, Double>>> promise = analyst.hitsAsync(
graph, 100, auth, hubs);
promise.thenCompose(hits -> graph.queryPgqlAsync(
"SELECT x, x." + hits.getFirst().getName() + " x." + hits.getSecond().getName() + " MATCH (x) ORDER BY x." +
hits.getFirst().getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> hitsAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)
graph - auth - (out argument) hubs - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> auth = graph.CreateVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> hubs = graph.CreateVertexProperty(PropertyType.DOUBLE);
PgxFuture<Pair<VertexProperty<Integer, Double>, VertexProperty<Integer, Double>>> promise = analyst.hitsAsync(
graph, auth, hubs);
promise.thenCompose(hits -> graph.queryPgqlAsync(
"SELECT x, x." + hits.getFirst().getName() + " x." + hits.getSecond().getName() + " MATCH (x) ORDER BY x." +
hits.getFirst().getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> VertexProperty<ID,java.lang.Integer> inDegreeCentrality(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
VertexProperty<Integer, Integer> degree = analyst.inDegreeCentrality(graph);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + degree.getName() + " MATCH (x) ORDER BY x." + degree.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Integer> inDegreeCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - dc - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Integer> dc = graph.createVertexProperty(PropertyType.INTEGER);
VertexProperty<Integer, Integer> degree = analyst.inDegreeCentrality(graph, dc);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + degree.getName() + " MATCH (x) ORDER BY x." + degree.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> inDegreeCentralityAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<VertexProperty<Integer, Integer>> promise = analyst.inDegreeCentralityAsync(graph);
promise.thenCompose(degree -> graph.queryPgqlAsync(
"SELECT x, x." + degree.getName() + " MATCH (x) ORDER BY x." + degree.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> inDegreeCentralityAsync(PgxGraph graph, java.lang.String propertyName)
public <ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> inDegreeCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
graph - dc - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Integer> dc = graph.createVertexProperty(PropertyType.INTEGER);
PgxFuture<VertexProperty<Integer, Integer>> promise = analyst.inDegreeCentralityAsync(graph, dc);
promise.thenCompose(degree -> graph.queryPgqlAsync(
"SELECT x, x." + degree.getName() + " MATCH (x) ORDER BY x." + degree.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public PgxMap<java.lang.Integer,java.lang.Long> inDegreeDistribution(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
PgxMap<Integer, Long> degree = analyst.inDegreeDistribution(graph);
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic PgxMap<java.lang.Integer,java.lang.Long> inDegreeDistribution(PgxGraph graph, PgxMap<java.lang.Integer,java.lang.Long> distribution) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - distribution - (out argument)
PgxGraph graph = ...;
PgxMap<Integer, Long> distribution = graph.createMap(PropertyType.INTEGER, PropertyType.LONG);
PgxMap<Integer, Long> degree = analyst.inDegreeDistribution(graph, distribution);
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> inDegreeDistributionAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<PgxMap<Integer, Long>> promise = analyst.inDegreeDistributionAsync(graph);
promise.thenAccept(map -> {
...;
});
public PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> inDegreeDistributionAsync(PgxGraph graph, PgxMap<java.lang.Integer,java.lang.Long> distribution)
graph - distribution - (out argument)
PgxGraph graph = ...;
PgxMap<Integer, Long> distribution = graph.createMap(PropertyType.INTEGER, PropertyType.LONG);
PgxFuture<PgxMap<Integer, Long>> promise = analyst.inDegreeDistributionAsync(graph, distribution);
promise.thenAccept(map -> {
...;
});
public <ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> kcore(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
Pair<Scalar<Long>, VertexProperty<Integer, Long>> kcore = analyst.kcore(graph);
kcore.getFirst().get();
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + kcore.getSecond().getName() + " MATCH (x) ORDER BY x." + kcore.getSecond().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> kcore(PgxGraph graph, int minCore, int maxCore) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - minCore - maxCore -
PgxGraph graph = ...;
Pair<Scalar<Long>, VertexProperty<Integer, Long>> kcore = analyst.kcore(graph, 0, 2147483647);
kcore.getFirst().get();
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + kcore.getSecond().getName() + " MATCH (x) ORDER BY x." + kcore.getSecond().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> kcore(PgxGraph graph, int minCore, int maxCore, Scalar<java.lang.Long> maxKCore, VertexProperty<ID,java.lang.Long> kcore) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - minCore - maxCore - maxKCore - Scalar (long) for holding the value of the maximum k-core found by the algorithm.kcore - (out argument)
PgxGraph graph = ...;
Scalar<Long> scalar = graph.createScalar(PropertyType.LONG);
VertexProperty<Integer, Long> prop = graph.CreateVertexProperty(PropertyType.LONG);
Pair<Scalar<Long>, VertexProperty<Integer, Long>> kcore = analyst.kcore(graph, 0, 2147483647, scalar, prop);
kcore.getFirst().get();
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + kcore.getSecond().getName() + " MATCH (x) ORDER BY x." + kcore.getSecond().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> kcore(PgxGraph graph, Scalar<java.lang.Long> maxKCore, VertexProperty<ID,java.lang.Long> kcore) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - maxKCore - Scalar (long) for holding the value of the maximum k-core found by the algorithm.kcore - (out argument)
PgxGraph graph = ...;
Scalar<Long> scalar = graph.createScalar(PropertyType.LONG);
VertexProperty<Integer, Long> prop = graph.CreateVertexProperty(PropertyType.LONG);
Pair<Scalar<Long>, VertexProperty<Integer, Long>> kcore = analyst.kcore(graph, scalar, prop);
kcore.getFirst().get();
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + kcore.getSecond().getName() + " MATCH (x) ORDER BY x." + kcore.getSecond().getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> kcoreAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<Pair<Scalar<Long>, VertexProperty<Integer, Long>>> promise = analyst.kcoreAsync(graph);
promise.thenCompose(kcore -> {
kcore.getFirst().get();
graph.queryPgqlAsync(
"SELECT x, x." + kcore.getSecond().getName() + " MATCH (x) ORDER BY x." + kcore.getSecond().getName() +
" DESC"))
.thenAccept(PgqlResultSet::print);
});
public <ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> kcoreAsync(PgxGraph graph, int minCore, int maxCore)
graph - minCore - maxCore -
PgxGraph graph = ...;
PgxFuture<Pair<Scalar<Long>, VertexProperty<Integer, Long>>> promise = analyst.kcoreAsync(graph, 0, 2147483647);
promise.thenCompose(kcore -> {
kcore.getFirst().get();
graph.queryPgqlAsync(
"SELECT x, x." + kcore.getSecond().getName() + " MATCH (x) ORDER BY x." + kcore.getSecond().getName() +
" DESC"))
.thenAccept(PgqlResultSet::print);
});
public <ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> kcoreAsync(PgxGraph graph, int minCore, int maxCore, Scalar<java.lang.Long> maxKCore, VertexProperty<ID,java.lang.Long> kcore)
graph - minCore - maxCore - maxKCore - Scalar (long) for holding the value of the maximum k-core found by the algorithm.kcore - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Long> prop = graph.createVertexProperty(PropertyType.LONG);
PgxFuture<Pair<Scalar<Long>, VertexProperty<Integer, Long>>> promise = analyst.kcoreAsync(
graph, 0, 2147483647, prop);
promise.thenCompose(kcore -> {
kcore.getFirst().get();
graph.queryPgqlAsync(
"SELECT x, x." + kcore.getSecond().getName() + " MATCH (x) ORDER BY x." + kcore.getSecond().getName() +
" DESC"))
.thenAccept(PgqlResultSet::print);
});
public <ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> kcoreAsync(PgxGraph graph, Scalar<java.lang.Long> maxKCore, VertexProperty<ID,java.lang.Long> kcore)
graph - maxKCore - Scalar (long) for holding the value of the maximum k-core found by the algorithm.kcore - (out argument)
PgxGraph graph = ...;
Scalar<Long> scalar = graph.createScalar(PropertyType.LONG);
VertexProperty<Integer, Long> prop = graph.createVertexProperty(PropertyType.LONG);
PgxFuture<Pair<Scalar<Long>, VertexProperty<Integer, Long>>> promise = analyst.kcoreAsync(
graph, 0, 2147483647, prop);
promise.thenCompose(kcore -> {
kcore.getFirst().get();
graph.queryPgqlAsync(
"SELECT x, x." + kcore.getSecond().getName() + " MATCH (x) ORDER BY x." + kcore.getSecond().getName() +
" DESC"))
.thenAccept(PgqlResultSet::print);
});
public <ID> VertexProperty<ID,java.lang.Double> localClusteringCoefficient(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
VertexProperty<Integer, Double> lcc = analyst.localClusteringCoefficient(graph);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + lcc.getName() + " MATCH (x) ORDER BY x." + lcc.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> localClusteringCoefficient(PgxGraph graph, VertexProperty<ID,java.lang.Double> lcc) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - lcc - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> prop = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> lcc = analyst.localClusteringCoefficient(graph, prop);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + lcc.getName() + " MATCH (x) ORDER BY x." + lcc.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> localClusteringCoefficientAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.localClusteringCoefficientAsync(graph);
promise.thenCompose(lcc -> graph.queryPgqlAsync(
"SELECT x, x." + lcc.getName() + " MATCH (x) ORDER BY x." + lcc.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> localClusteringCoefficientAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> lcc)
graph - lcc - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> lcc = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.localClusteringCoefficientAsync(graph, lcc);
promise.thenCompose(lcc -> graph.queryPgqlAsync(
"SELECT x, x." + lcc.getName() + " MATCH (x) ORDER BY x." + lcc.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> MatrixFactorizationModel<ID> matrixFactorizationGradientDescent(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight) throws java.lang.InterruptedException, java.util.concurrent.ExecutionException
graph - Bipartite graph.weight -
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
MatrixFactorizationModel<Integer> matrix = analyst.matrixFactorizationGradientDescent(graph, cost);
matrix.getRootMeanSquareError();
java.lang.InterruptedExceptionjava.util.concurrent.ExecutionExceptionpublic <ID> MatrixFactorizationModel<ID> matrixFactorizationGradientDescent(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength) throws java.lang.InterruptedException, java.util.concurrent.ExecutionException
graph - Bipartite graph.weight - learningRate - changePerStep - lambda - maxStep - vectorLength -
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
MatrixFactorizationModel<Integer> matrix = analyst.matrixFactorizationGradientDescent(
graph, cost, 0.1, 0.9, 0.1, 100, 20);
matrix.getRootMeanSquareError();
java.lang.InterruptedExceptionjava.util.concurrent.ExecutionExceptionpublic <ID> MatrixFactorizationModel<ID> matrixFactorizationGradientDescent(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength, VertexProperty<ID,PgxVect<java.lang.Double>> features) throws java.lang.InterruptedException, java.util.concurrent.ExecutionException
graph - Bipartite graph.weight - learningRate - changePerStep - lambda - maxStep - vectorLength - features - (out argument)
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, PgxVect<Double>> features = graph.createVertexVectorProperty(PropertyType.DOUBLE, 20);
MatrixFactorizationModel<Integer> matrix = analyst.matrixFactorizationGradientDescent(
graph, cost, 0.1, 0.9, 0.1, 100, 20, features);
matrix.getRootMeanSquareError();
java.lang.InterruptedExceptionjava.util.concurrent.ExecutionExceptionpublic <ID> MatrixFactorizationModel<ID> matrixFactorizationGradientDescent(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,PgxVect<java.lang.Double>> features) throws java.lang.InterruptedException, java.util.concurrent.ExecutionException
graph - Bipartite graph.weight - features - (out argument)
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, PgxVect<Double>> features = graph.createVertexVectorProperty(PropertyType.DOUBLE, 20);
MatrixFactorizationModel<Integer> matrix = analyst.matrixFactorizationGradientDescent(graph, cost, features);
matrix.getRootMeanSquareError();
java.lang.InterruptedExceptionjava.util.concurrent.ExecutionExceptionpublic <ID> PgxFuture<MatrixFactorizationModel<ID>> matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight)
graph - Bipartite graph.weight -
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<MatrixFactorizationModel<Integer>> promise = analyst.matrixFactorizationGradientDescentAsync(
graph, cost);
promise.thenAccept(matrix -> {
matrix.getRootMeanSquareError();
});
public <ID> PgxFuture<MatrixFactorizationModel<ID>> matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength)
graph - Bipartite graph.weight - learningRate - changePerStep - lambda - maxStep - vectorLength -
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<MatrixFactorizationModel<Integer>> promise = analyst.matrixFactorizationGradientDescentAsync(
graph, cost, 0.1, 0.9, 0.1, 100, 20);
promise.thenAccept(matrix -> {
matrix.getRootMeanSquareError();
});
public <ID> PgxFuture<MatrixFactorizationModel<ID>> matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength, VertexProperty<ID,PgxVect<java.lang.Double>> features)
graph - Bipartite graph.weight - learningRate - changePerStep - lambda - maxStep - vectorLength - features - (out argument)
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, PgxVect<Double>> features = graph.createVertexVectorProperty(PropertyType.DOUBLE, 20);
PgxFuture<MatrixFactorizationModel<Integer>> promise = analyst.matrixFactorizationGradientDescentAsync(
graph, cost, 0.1, 0.9, 0.1, 100, 20, features);
promise.thenAccept(matrix -> {
matrix.getRootMeanSquareError();
});
public <ID> PgxFuture<MatrixFactorizationModel<ID>> matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,PgxVect<java.lang.Double>> features)
graph - Bipartite graph.weight - features - (out argument)
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, PgxVect<Double>> features = graph.createVertexVectorProperty(PropertyType.DOUBLE, 20);
PgxFuture<MatrixFactorizationModel<Integer>> promise = analyst.matrixFactorizationGradientDescentAsync(
graph, cost, features);
promise.thenAccept(matrix -> {
matrix.getRootMeanSquareError();
});
public <ID> VertexProperty<ID,java.lang.Integer> outDegreeCentrality(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
VertexProperty<Integer, Integer> degree = analyst.outDegreeCentrality(graph);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + degree.getName() + " MATCH (x) ORDER BY x." + degree.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Integer> outDegreeCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - dc - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Integer> dc = graph.createVertexProperty(PropertyType.INTEGER);
VertexProperty<Integer, Integer> degree = analyst.outDegreeCentrality(graph, dc);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + degree.getName() + " MATCH (x) ORDER BY x." + degree.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> outDegreeCentralityAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<VertexProperty<Integer, Integer>> promise = analyst.outDegreeCentralityAsync(graph);
promise.thenCompose(degree -> graph.queryPgqlAsync(
"SELECT x, x." + degree.getName() + " MATCH (x) ORDER BY x." + degree.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> outDegreeCentralityAsync(PgxGraph graph, java.lang.String propertyName)
public <ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> outDegreeCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
graph - dc - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Integer> dc = graph.createVertexProperty(PropertyType.INTEGER);
PgxFuture<VertexProperty<Integer, Integer>> promise = analyst.outDegreeCentralityAsync(graph, dc);
promise.thenCompose(degree -> graph.queryPgqlAsync(
"SELECT x, x." + degree.getName() + " MATCH (x) ORDER BY x." + degree.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public PgxMap<java.lang.Integer,java.lang.Long> outDegreeDistribution(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
PgxMap<Integer, Long> degree = analyst.outDegreeDistribution(graph);
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic PgxMap<java.lang.Integer,java.lang.Long> outDegreeDistribution(PgxGraph graph, PgxMap<java.lang.Integer,java.lang.Long> distribution) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - distribution - (out argument)
PgxGraph graph = ...;
PgxMap<Integer, Long> distribution = graph.createMap(PropertyType.INTEGER, PropertyType.LONG);
PgxMap<Integer, Long> degree = analyst.outDegreeDistribution(graph, distribution);
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> outDegreeDistributionAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<PgxMap<Integer, Long>> promise = analyst.outDegreeDistributionAsync(graph);
promise.thenAccept(map -> {
...;
});
public PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> outDegreeDistributionAsync(PgxGraph graph, PgxMap<java.lang.Integer,java.lang.Long> distribution)
graph - distribution - (out argument)
PgxGraph graph = ...;
PgxMap<Integer, Long> distribution = graph.createMap(PropertyType.INTEGER, PropertyType.LONG);
PgxFuture<PgxMap<Integer, Long>> promise = analyst.outDegreeDistributionAsync(graph, distribution);
promise.thenAccept(map -> {
...;
});
public <ID> VertexProperty<ID,java.lang.Double> pagerank(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
VertexProperty<Integer, Double> pagerank = analyst.pagerank(graph);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> pagerank(PgxGraph graph, boolean norm) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - norm -
PgxGraph graph = ...;
VertexProperty<Integer, Double> pagerank = analyst.pagerank(graph, false);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> pagerank(PgxGraph graph, boolean norm, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - norm - rank - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank = analyst.pagerank(graph, false, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> pagerank(PgxGraph graph, double e, double d, int max) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - e - d - max -
PgxGraph graph = ...;
VertexProperty<Integer, Double> pagerank = analyst.pagerank(graph, 0.001, 0.85, 100);
PgqlResultSet rs = graph.queryPgql("SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." +
pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> pagerank(PgxGraph graph, double e, double d, int max, boolean norm) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - e - d - max - norm -
PgxGraph graph = ...;
VertexProperty<Integer, Double> pagerank = analyst.pagerank(graph, 0.001, 0.85, 100, false);
PgqlResultSet rs = graph.queryPgql("SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." +
pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> pagerank(PgxGraph graph, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - e - d - max - norm - rank - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank = analyst.pagerank(graph, 0.001, 0.85, 100, false, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> pagerank(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - e - d - max - rank - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank = analyst.pagerank(graph, 0.001, 0.85, 100, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> pagerank(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - rank - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank = analyst.pagerank(graph, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> pagerankApproximate(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
VertexProperty<Integer, Double> pagerank = analyst.pagerankApproximate(graph);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> pagerankApproximate(PgxGraph graph, double e, double d, int max) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - e - d - max -
PgxGraph graph = ...;
VertexProperty<Integer, Double> pagerank = analyst.pagerankApproximate(graph, 0.001, 0.85, 100);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> pagerankApproximate(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - e - d - max - rank - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank = analyst.pagerankApproximate(graph, 0.001, 0.85, 100, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> pagerankApproximate(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - rank - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank = analyst.pagerankApproximate(graph, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> pagerankApproximateAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.pagerankApproximateAsync(graph);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> pagerankApproximateAsync(PgxGraph graph, double e, double d, int max)
graph - e - d - max -
PgxGraph graph = ...;
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.pagerankApproximateAsync(graph, 0.001, 0.85, 100);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> pagerankApproximateAsync(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
graph - e - d - max - rank - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.pagerankApproximateAsync(
graph, 0.001, 0.85, 100, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> pagerankApproximateAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank)
graph - rank - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.pagerankApproximateAsync(graph, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> pagerankAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.pagerankAsync(graph);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> pagerankAsync(PgxGraph graph, boolean norm)
graph - norm -
PgxGraph graph = ...;
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.pagerankAsync(graph, false);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> pagerankAsync(PgxGraph graph, boolean norm, VertexProperty<ID,java.lang.Double> rank)
graph - norm - rank - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.pagerankAsync(graph, false, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> pagerankAsync(PgxGraph graph, double e, double d, int max)
graph - e - d - max -
PgxGraph graph = ...;
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.pagerankAsync(graph, 0.001, 0.85, 100);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> pagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm)
graph - e - d - max - norm -
PgxGraph graph = ...;
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.pagerankAsync(graph, 0.001, 0.85, 100, false);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> pagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
graph - e - d - max - norm - rank - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.pagerankAsync(graph, 0.001, 0.85, 100, false, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> pagerankAsync(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
graph - e - d - max - rank - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.pagerankAsync(graph, 0.001, 0.85, 100, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> pagerankAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank)
graph - rank - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.pagerankAsync(graph, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>> partitionConductance(PgxGraph graph, Partition<ID> partition) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - partition - Partition of the graph with the corresponding node collections.
PgxGraph graph = ...;
Partition<Integer> partition = analyst.communitiesConductanceMinimization(graph);
Pair<Scalar<Double>, Scalar<Double>> conductance = analyst.partitionConductance(graph, partition);
conductance.getFirst().get();
conductance.getSecond().get();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>> partitionConductance(PgxGraph graph, Partition<ID> partition, Scalar<java.lang.Double> avgConductance, Scalar<java.lang.Double> minConductance) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - partition - Partition of the graph with the corresponding node collections.avgConductance - Scalar that will get updated with the computed average conductance value.minConductance - Scalar that will get updated with the computed minimum conductance value.
PgxGraph graph = ...;
Partition<Integer> partition = analyst.communitiesConductanceMinimization(graph);
Scalar<Double> avgConductance = graph.createScalar(PropertyType.DOUBLE);
Scalar<Double> minConductance = graph.createScalar(PropertyType.DOUBLE);
Pair<Scalar<Double>, Scalar<Double>> conductance =
analyst.partitionConductance(graph, partition, avgConductance, minConductance);
conductance.getFirst().get();
conductance.getSecond().get();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>>> partitionConductanceAsync(PgxGraph graph, Partition<ID> partition)
graph - partition - Partition of the graph with the corresponding node collections.
PgxGraph graph = ...;
Partition<Integer> partition = analyst.communitiesConductanceMinimization(graph);
PgxFuture<Pair<Scalar<Double>, Scalar<Double>>> promise = analyst.partitionConductanceAsync(graph, partition);
promise.thenAccept(coductance -> {
coductance.getFirst().get();
coductance.getSecond().get();
});
public <ID> PgxFuture<Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>>> partitionConductanceAsync(PgxGraph graph, Partition<ID> partition, Scalar<java.lang.Double> avgConductance, Scalar<java.lang.Double> minConductance)
graph - partition - Partition of the graph with the corresponding node collections.avgConductance - Scalar that will get updated with the computed average conductance value.minConductance - Scalar that will get updated with the computed minimum conductance value.
PgxGraph graph = ...;
Partition<Integer> partition = analyst.communitiesConductanceMinimization(graph);
Scalar<Double> avgConductance = graph.createScalar(PropertyType.DOUBLE);
Scalar<Double> minConductance = graph.createScalar(PropertyType.DOUBLE);
PgxFuture<Pair<Scalar<Double>, Scalar<Double>>> promise = analyst.partitionConductanceAsync(
graph, partition, avgConductance, minConductance);
promise.thenAccept(coductance -> {
coductance.getFirst().get();
coductance.getSecond().get();
});
public <ID> Scalar<java.lang.Double> partitionModularity(PgxGraph graph, Partition<ID> partition) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - partition - Partition of the graph with the corresponding node collections.
PgxGraph graph = ...;
Partition<Integer> partition = analyst.communitiesConductanceMinimization(graph);
Scalar<Double> modularity = analyst.partitionModularity(graph, partition);
modularity.get();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Scalar<java.lang.Double> partitionModularity(PgxGraph graph, Partition<ID> partition, Scalar<java.lang.Double> modularity) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - partition - Partition of the graph with the corresponding node collections.modularity - Scalar (double) to store the modularity value.
PgxGraph graph = ...;
Partition<Integer> partition = analyst.communitiesConductanceMinimization(graph);
Scalar<Double> scalar = graph.createScalar(PropertyType.DOUBLE);
Scalar<Double> modularity = analyst.partitionModularity(graph, partition, scalar);
modularity.get();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<Scalar<java.lang.Double>> partitionModularityAsync(PgxGraph graph, Partition<ID> partition)
graph - partition - Partition of the graph with the corresponding node collections.
PgxGraph graph = ...;
Partition<Integer> partition = analyst.communitiesConductanceMinimization(graph);
PgxFuture<Scalar<Double>> promise = analyst.partitionModularityAsync(graph, partition);
promise.thenAccept(modularity -> {
modularity.get();
});
public <ID> PgxFuture<Scalar<java.lang.Double>> partitionModularityAsync(PgxGraph graph, Partition<ID> partition, Scalar<java.lang.Double> modularity)
graph - partition - Partition of the graph with the corresponding node collections.modularity - Scalar (double) to store the modularity value.
PgxGraph graph = ...;
Partition<Integer> partition = analyst.communitiesConductanceMinimization(graph);
Scalar<Double> scalar = graph.createScalar(PropertyType.DOUBLE);
PgxFuture<Scalar<Double>> promise = analyst.partitionModularityAsync(graph, partition, scalar);
promise.thenAccept(modularity -> {
modularity.get();
});
public <ID> PgxFuture<Scalar<java.lang.Double>> partitionModularityAsync(PgxGraph graph, Partition<ID> partition, java.lang.String modularityName)
public <ID> VertexSet<ID> periphery(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
VertexSet<Integer> periphery = analyst.periphery(graph);
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexSet<ID> periphery(PgxGraph graph, VertexSet<ID> periphery) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - periphery - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.createVertexSet();
VertexSet<Integer> periphery = analyst.periphery(graph, vertices);
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<VertexSet<ID>> peripheryAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<VertexSet<Integer>> promise = analyst.peripheryAsync(graph);
promise.thenAccept(periphery -> {
...
});
public <ID> PgxFuture<VertexSet<ID>> peripheryAsync(PgxGraph graph, VertexSet<ID> periphery)
graph - periphery - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.createVertexSet();
PgxFuture<VertexSet<Integer>> promise = analyst.peripheryAsync(graph, vertices);
promise.thenAccept(periphery -> {
...;
});
public <ID> VertexProperty<ID,java.lang.Double> personalizedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int,)
taking a vertex ID instead of a PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, boolean norm) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int,
boolean) taking a vertex ID instead of a PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
#personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, boolean,
VertexProperty) taking a vertex ID instead of a PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
#personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int,
VertexProperty) taking a vertex ID instead of a PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedPagerank(PgxGraph graph, PgxVertex<ID> v) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - v -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexProperty<Integer, Double> pagerank = analyst.personalizedPagerank(graph, vertex);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, boolean norm) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - norm -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexProperty<Integer, Double> pagerank = analyst.personalizedPagerank(graph, vertex, false);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, boolean norm, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - v - norm - rank - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank = analyst.personalizedPagerank(graph, vertex, false, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - v - e - d - max -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexProperty<Integer, Double> pagerank = analyst.personalizedPagerank(graph, vertex, 0.001, 0.85, 100);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - v - e - d - max - norm -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexProperty<Integer, Double> pagerank = analyst.personalizedPagerank(graph, vertex, 0.001, 0.85, 100, false);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - v - e - d - max - norm - rank - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank =
analyst.personalizedPagerank(graph, vertex, 0.001, 0.85, 100, false, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - v - e - d - max - rank - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank = analyst.personalizedPagerank(graph, vertex, 0.001, 0.85, 100, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - v - rank - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank = analyst.personalizedPagerank(graph, vertex, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertices -
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
VertexProperty<Integer, Double> pagerank = analyst.personalizedPagerank(graph, vertices);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertices - norm -
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
VertexProperty<Integer, Double> pagerank = analyst.personalizedPagerank(graph, vertices, false);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertices - norm - rank - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank = analyst.personalizedPagerank(graph, vertices, false, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertices - e - d - max -
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
VertexProperty<Integer, Double> pagerank = analyst.personalizedPagerank(graph, vertices, 0.001, 0.85, 100);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertices - e - d - max - norm -
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
VertexProperty<Integer, Double> pagerank = analyst.personalizedPagerank(graph, vertices, 0.001, 0.85, 100, false);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertices - e - d - max - norm - rank - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank =
analyst.personalizedPagerank(graph, vertices, 0.001, 0.85, 100, false, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertices - e - d - max - rank - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank = analyst.personalizedPagerank(graph, vertices, 0.001, 0.85, 100, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertices - rank - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank = analyst.personalizedPagerank(graph, vertices, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v)
graph - v -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedPagerankAsync(graph, vertex);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm)
graph - v - norm -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedPagerankAsync(graph, vertex, false);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, VertexProperty<ID,java.lang.Double> rank)
graph - v - norm - rank - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedPagerankAsync(graph, vertex, false, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max)
graph - v - e - d - max -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedPagerankAsync(
graph, vertex, 0.001, 0.85, 100);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm)
graph - v - e - d - max - norm -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedPagerankAsync(
graph, vertex, 0.001, 0.85, 100, false);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
graph - v - e - d - max - norm - rank - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedPagerankAsync(
graph, vertex, 0.001, 0.85, 100, false, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
graph - v - e - d - max - rank - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedPagerankAsync(
graph, vertex, 0.001, 0.85, 100, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> rank)
graph - v - rank - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedPagerankAsync(graph, vertex, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices)
graph - vertices -
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedPagerankAsync(graph, vertices);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm)
graph - vertices - norm -
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedPagerankAsync(graph, vertices, false);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, VertexProperty<ID,java.lang.Double> rank)
graph - vertices - norm - rank - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedPagerankAsync(
graph, vertices, false, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max)
graph - vertices - e - d - max -
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedPagerankAsync(
graph, vertices, 0.001, 0.85, 100);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm)
graph - vertices - e - d - max - norm -
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedPagerankAsync(
graph, vertices, 0.001, 0.85, 100, false);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
graph - vertices - e - d - max - norm - rank - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedPagerankAsync(
graph, vertices, 0.001, 0.85, 100, false, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
graph - vertices - e - d - max - rank - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedPagerankAsync(
graph, vertices, 0.001, 0.85, 100, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> rank)
graph - vertices - rank - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedPagerankAsync(graph, vertices, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> VertexProperty<ID,java.lang.Double> personalizedSalsa(BipartiteGraph graph, ID v, java.math.BigDecimal d, int maxIterations, java.math.BigDecimal maxDiff) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
personalizedSalsa(BipartiteGraph, PgxVertex, BigDecimal, int, BigDecimal)
taking a vertex ID instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedSalsa(BipartiteGraph graph, ID v, java.math.BigDecimal d, int maxIterations, java.math.BigDecimal maxDiff, VertexProperty<ID,java.lang.Double> salsaRank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
#personalizedSalsa(BipartiteGraph, PgxVertex, BigDecimal, int, BigDecimal, VertexProperty)
taking a vertex ID instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedSalsa(BipartiteGraph graph, PgxVertex<ID> v) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - Bipartite graph.v -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexProperty<Integer, Double> salsa = analyst.personalizedSalsa(graph, vertex);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedSalsa(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIter, double maxDiff) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - Bipartite graph.v - d - maxIter - maxDiff -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexProperty<Integer, Double> salsa = analyst.personalizedSalsa(graph, vertex, 0.85, 100, 0.001);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedSalsa(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIter, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - Bipartite graph.v - d - maxIter - maxDiff - salsaRank - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> salsa = analyst.personalizedSalsa(graph, vertex, 0.85, 100, 0.001, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedSalsa(BipartiteGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> salsaRank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - Bipartite graph.v - salsaRank - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> salsa = analyst.personalizedSalsa(graph, vertex, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - Bipartite graph.vertices -
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
VertexProperty<Integer, Double> salsa = analyst.personalizedSalsa(graph, vertices);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIter, double maxDiff) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - Bipartite graph.vertices - d - maxIter - maxDiff -
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
VertexProperty<Integer, Double> salsa = analyst.personalizedSalsa(graph, vertices, 0.85, 100, 0.001);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIter, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - Bipartite graph.vertices - d - maxIter - maxDiff - salsaRank - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> salsa = analyst.personalizedSalsa(graph, vertices, 0.85, 100, 0.001, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> salsaRank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - Bipartite graph.vertices - salsaRank - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> salsa = analyst.personalizedSalsa(graph, vertices, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v)
graph - Bipartite graph.v -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedSalsaAsync(graph, vertex);
promise.thenCompose(salsa -> graph.queryPgqlAsync(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIter, double maxDiff)
graph - Bipartite graph.v - d - maxIter - maxDiff -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedSalsaAsync(
graph, vertex, 0.85, 100, 0.001);
promise.thenCompose(salsa -> graph.queryPgqlAsync(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIter, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank)
graph - Bipartite graph.v - d - maxIter - maxDiff - salsaRank - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedSalsaAsync(
graph, vertex, 0.85, 100, 0.001, rank);
promise.thenCompose(salsa -> graph.queryPgqlAsync(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> salsaRank)
graph - Bipartite graph.v - salsaRank - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedSalsaAsync(graph, vertex, rank);
promise.thenCompose(salsa -> graph.queryPgqlAsync(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices)
graph - Bipartite graph.vertices -
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedSalsaAsync(graph, vertices);
promise.thenCompose(salsa -> graph.queryPgqlAsync(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIter, double maxDiff)
graph - Bipartite graph.vertices - d - maxIter - maxDiff -
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedSalsaAsync(
graph, vertices, 0.85, 100, 0.001);
promise.thenCompose(salsa -> graph.queryPgqlAsync(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIter, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank)
graph - Bipartite graph.vertices - d - maxIter - maxDiff - salsaRank - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedSalsaAsync(
graph, vertices, 0.85, 100, 0.001, rank);
promise.thenCompose(salsa -> graph.queryPgqlAsync(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> salsaRank)
graph - Bipartite graph.vertices - salsaRank - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedSalsaAsync(graph, vertices, rank);
promise.thenCompose(salsa -> graph.queryPgqlAsync(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> VertexProperty<ID,java.lang.Double> personalizedWeightedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, boolean norm, EdgeProperty<java.lang.Double> weight) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int,
boolean, EdgeProperty) taking a vertex ID instead of a PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> 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) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
#personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, boolean, EdgeProperty,
VertexProperty) taking a vertex ID instead of a PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedWeightedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, EdgeProperty<java.lang.Double> weight) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int,
EdgeProperty) taking a vertex ID instead of a PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> 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) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
#personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, EdgeProperty,
VertexProperty) taking a vertex ID instead of a PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - v - norm - weight -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> pagerank = analyst.personalizedWeightedPagerank(graph, vertex, false, cost);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - v - norm - weight - rank - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank = analyst.personalizedWeightedPagerank(graph, vertex, false, cost, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - v - e - d - max - norm - weight -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> pagerank =
analyst.personalizedWeightedPagerank(graph, vertex, 0.001, 0.85, 100, false, cost);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> 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) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - v - e - d - max - norm - weight - rank - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank =
analyst.personalizedWeightedPagerank(graph, vertex, 0.001, 0.85, 100, false, cost, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - v - e - d - max - weight -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> pagerank =
analyst.personalizedWeightedPagerank(graph, vertex, 0.001, 0.85, 100, cost);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - v - e - d - max - weight - rank - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank =
analyst.personalizedWeightedPagerank(graph, vertex, 0.001, 0.85, 100, cost, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - v - weight -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> pagerank = analyst.personalizedWeightedPagerank(graph, vertex, cost);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - v - weight - rank - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank = analyst.personalizedWeightedPagerank(graph, vertex, cost, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertices - norm - weight -
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> pagerank = analyst.personalizedWeightedPagerank(graph, vertices, false, cost);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertices - norm - weight - rank - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank =
analyst.personalizedWeightedPagerank(graph, vertices, false, cost, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertices - e - d - max - norm - weight -
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> pagerank =
analyst.personalizedWeightedPagerank(graph, vertices, 0.001, 0.85, 100, false, cost);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> 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) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertices - e - d - max - norm - weight - rank - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank =
analyst.personalizedWeightedPagerank(graph, vertices, 0.001, 0.85, 100, false, cost, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertices - e - d - max - weight -
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> pagerank =
analyst.personalizedWeightedPagerank(graph, vertices, 0.001, 0.85, 100, cost);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertices - e - d - max - weight - rank - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank =
analyst.personalizedWeightedPagerank(graph, vertices, 0.001, 0.85, 100, cost, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertices - weight -
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> pagerank = analyst.personalizedWeightedPagerank(graph, vertices, cost);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertices - weight - rank - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank = analyst.personalizedWeightedPagerank(graph, vertices, cost, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight)
graph - v - norm - weight -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedWeightedPagerankAsync(
graph, vertex, false, cost);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
graph - v - norm - weight - rank - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedWeightedPagerankAsync(
graph, vertex, false, cost, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight)
graph - v - e - d - max - norm - weight -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedWeightedPagerankAsync(
graph, vertex, 0.001, 0.85, 100, false, cost);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> 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)
graph - v - e - d - max - norm - weight - rank - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedWeightedPagerankAsync(
graph, vertex, 0.001, 0.85, 100, false, cost, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight)
graph - v - e - d - max - weight -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedWeightedPagerankAsync(
graph, vertex, 0.001, 0.85, 100, cost);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
graph - v - e - d - max - weight - rank - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedWeightedPagerankAsync(
graph, vertex, 0.001, 0.85, 100, cost, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight)
graph - v - weight -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedWeightedPagerankAsync(
graph, vertex, cost);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
graph - v - weight - rank - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedWeightedPagerankAsync(
graph, vertex, cost, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight)
graph - vertices - norm - weight -
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedWeightedPagerankAsync(
graph, vertices, false, cost);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
graph - vertices - norm - weight - rank - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedWeightedPagerankAsync(
graph, vertices, false, cost, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight)
graph - vertices - e - d - max - norm - weight -
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedWeightedPagerankAsync(
graph, vertices, 0.001, 0.85, 100, false, cost);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> 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)
graph - vertices - e - d - max - norm - weight - rank - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedWeightedPagerankAsync(
graph, vertices, 0.001, 0.85, 100, false, cost, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight)
graph - vertices - e - d - max - weight -
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedWeightedPagerankAsync(
graph, vertices, 0.001, 0.85, 100, cost);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
graph - vertices - e - d - max - weight - rank - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedWeightedPagerankAsync(
graph, vertices, 0.001, 0.85, 100, cost, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight)
graph - vertices - weight -
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedWeightedPagerankAsync(
graph, vertices, cost);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
graph - vertices - weight - rank - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> vertices = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.personalizedWeightedPagerankAsync(
graph, vertices, cost, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public EdgeProperty<java.lang.Boolean> prim(PgxGraph graph, EdgeProperty<java.lang.Double> weight) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - weight -
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
EdgeProperty<Boolean> prim = analyst.prim(graph, cost);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + prim.getName() + " MATCH (x) ORDER BY x." + prim.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic EdgeProperty<java.lang.Boolean> prim(PgxGraph graph, EdgeProperty<java.lang.Double> weight, EdgeProperty<java.lang.Boolean> mst) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - weight - mst - (out argument)
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
EdgeProperty<Boolean> mst = graph.createEdgeProperty(PropertyType.BOOLEAN);
EdgeProperty<Boolean> prim = analyst.prim(graph, cost, mst);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + prim.getName() + " MATCH (x) ORDER BY x." + prim.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic EdgeProperty<java.lang.Boolean> prim(PgxGraph graph, EdgeProperty<java.lang.Double> weight, java.lang.String mstName) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
prim(PgxGraph, EdgeProperty, String)java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic PgxFuture<EdgeProperty<java.lang.Boolean>> primAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight)
graph - weight -
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<EdgeProperty<Boolean>> promise = analyst.primAsync(graph, cost);
promise.thenCompose(prim -> graph.queryPgqlAsync(
"SELECT x, x." + prim.getName() + " MATCH (x) ORDER BY x." + prim.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public PgxFuture<EdgeProperty<java.lang.Boolean>> primAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight, EdgeProperty<java.lang.Boolean> mst)
graph - weight - mst - (out argument)
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
EdgeProperty<Boolean> mst = graph.createEdgeProperty(PropertyType.BOOLEAN);
PgxFuture<EdgeProperty<Boolean>> promise = analyst.primAsync(graph, cost, mst);
promise.thenCompose(prim -> graph.queryPgqlAsync(
"SELECT x, x." + prim.getName() + " MATCH (x) ORDER BY x." + prim.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> radius(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
Pair<Scalar<Integer>, VertexProperty<Integer, Integer>> diameter = analyst.radius(graph);
radius.getFirst().get();
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + radius.getSecond().getName() + " MATCH (x) ORDER BY x." + radius.getSecond().getName() +
" DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> radius(PgxGraph graph, Scalar<java.lang.Integer> radius, VertexProperty<ID,java.lang.Integer> eccentricity) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - radius - Scalar (integer) for holding the value of the radius of the graph.eccentricity - (out argument)
PgxGraph graph = ...;
Scalar<Integer> scalar = graph.createScalar(PropertyType.INTEGER);
VertexProperty<Integer, Integer> prop = graph.CreateVertexProperty(PropertyType.INTEGER);
Pair<Scalar<Integer>, VertexProperty<Integer, Integer>> diameter = analyst.radius(graph, scalar, prop);
radius.getFirst().get();
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + radius.getSecond().getName() + " MATCH (x) ORDER BY x." + radius.getSecond().getName() +
" DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> radiusAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<Pair<Scalar<Integer>, VertexProperty<Integer, Integer>>> promise = analyst.radiusAsync(graph);
promise.thenCompose(radius -> {
radius.getFirst().get();
graph.queryPgqlAsync(
"SELECT x, x." + radius.getSecond().getName() + " MATCH (x) ORDER BY x." + radius.getSecond().getName() +
" DESC"))
.thenAccept(PgqlResultSet::print);
});
public <ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> radiusAsync(PgxGraph graph, Scalar<java.lang.Integer> radius, VertexProperty<ID,java.lang.Integer> eccentricity)
graph - radius - Scalar (integer) for holding the value of the radius of the graph.eccentricity - (out argument)
PgxGraph graph = ...;
Scalar<Integer> scalar = graph.createScalar(PropertyType.INTEGER);
VertexProperty<Integer, Integer> prop = graph.createVertexProperty(PropertyType.INTEGER);
PgxFuture<Pair<Scalar<Integer>, VertexProperty<Integer, Integer>>> promise = analyst.radiusAsync(
graph, scalar, prop);
promise.thenCompose(radius -> {
radius.getFirst().get();
graph.queryPgqlAsync(
"SELECT x, x." + radius.getSecond().getName() + " MATCH (x) ORDER BY x." + radius.getSecond().getName() +
" DESC"))
.thenAccept(PgqlResultSet::print);
});
public <ID> java.lang.Integer reachability(PgxGraph graph, PgxVertex<ID> source, PgxVertex<ID> dest, int maxHops, boolean ignoreEdgeDirection) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - source - dest - maxHops - ignoreEdgeDirection - boolean flag for ignoring the direction of the edges during the search.
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
PgxVertex<Integer> dst = graph.getVertex(333);
integer result = analyst.reachability(graph, src, dst, 2, false);
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<java.lang.Integer> reachabilityAsync(PgxGraph graph, PgxVertex<ID> source, PgxVertex<ID> dest, int maxHops, boolean ignoreEdgeDirection)
graph - source - dest - maxHops - ignoreEdgeDirection - boolean flag for ignoring the direction of the edges during the search.
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
PgxVertex<Integer> dst = graph.getVertex(333);
PgxFuture<Integer> promise = analyst.reachabilityAsync(graph, src, dst, 2, false);
promise.thenAccept(result -> {
...;
});
public <ID> VertexProperty<ID,java.lang.Double> salsa(BipartiteGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - Bipartite graph.
PgxGraph graph = ...;
VertexProperty<Integer, Double> salsa = analyst.salsa(graph);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> salsa(BipartiteGraph graph, double maxDiff, int maxIter) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - Bipartite graph.maxDiff - maxIter -
PgxGraph graph = ...;
VertexProperty<Integer, Double> salsa = analyst.salsa(graph, 0.001, 100);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> salsa(BipartiteGraph graph, double maxDiff, int maxIter, VertexProperty<ID,java.lang.Double> salsaRank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - Bipartite graph.maxDiff - maxIter - salsaRank - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> salsa = analyst.salsa(graph, 0.001, 100, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> salsa(BipartiteGraph graph, VertexProperty<ID,java.lang.Double> salsaRank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - Bipartite graph.salsaRank - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> salsa = analyst.salsa(graph, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> salsaAsync(BipartiteGraph graph)
graph - Bipartite graph.
PgxGraph graph = ...;
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.salsaAsync(graph);
promise.thenCompose(salsa -> graph.queryPgqlAsync(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> salsaAsync(BipartiteGraph graph, double maxDiff, int maxIter)
graph - Bipartite graph.maxDiff - maxIter -
PgxGraph graph = ...;
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.salsaAsync(graph, 0.001, 100);
promise.thenCompose(salsa -> graph.queryPgqlAsync(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> salsaAsync(BipartiteGraph graph, double maxDiff, int maxIter, VertexProperty<ID,java.lang.Double> salsaRank)
graph - Bipartite graph.maxDiff - maxIter - salsaRank - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> rank = graph.createVertexProperty(Property.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.salsaAsync(graph, 0.001, 100, rank);
promise.thenCompose(salsa -> graph.queryPgqlAsync(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> salsaAsync(BipartiteGraph graph, VertexProperty<ID,java.lang.Double> salsaRank)
graph - Bipartite graph.salsaRank - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> rank = graph.createVertexProperty(Property.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.salsaAsync(graph, rank);
promise.thenCompose(salsa -> graph.queryPgqlAsync(
"SELECT x, x." + salsa.getName() + " MATCH (x) ORDER BY x." + salsa.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> Partition<ID> sccKosaraju(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
Partition<Integer> scc = analyst.sccKosaraju(graph);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + scc.getPropertyName() + " MATCH (x) ORDER BY x." + scc.getPropertyName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Partition<ID> sccKosaraju(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - partitionDistribution -
PgxGraph graph = ...;
VertexProperty<Integer, Long> pd = graph.createVertexProperty(PropertyType.LONG);
Partition<Integer> scc = analyst.sccKosaraju(graph, pd);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + scc.getPropertyName() + " MATCH (x) ORDER BY x." + scc.getPropertyName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<Partition<ID>> sccKosarajuAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<Partition<Integer>> promise = analyst.sccKosarajuAsync(graph);
promise.thenCompose(scc -> graph.queryPgqlAsync(
"SELECT x, x." + scc.getPropertyName() + " MATCH (x) ORDER BY x." + scc.getPropertyName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Partition<ID>> sccKosarajuAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution)
graph - partitionDistribution -
PgxGraph graph = ...;
VertexProperty<Integer, Long> pd = graph.createVertexProperty(PropertyType.LONG);
PgxFuture<Partition<Integer>> promise = analyst.sccKosarajuAsync(graph, pd);
promise.thenCompose(scc -> graph.queryPgqlAsync(
"SELECT x, x." + scc.getPropertyName() + " MATCH (x) ORDER BY x." + scc.getPropertyName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> Partition<ID> sccTarjan(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
Partition<Integer> scc = analyst.sccTarjan(graph);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + scc.getPropertyName() + " MATCH (x) ORDER BY x." + scc.getPropertyName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Partition<ID> sccTarjan(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - partitionDistribution -
PgxGraph graph = ...;
VertexProperty<Integer, Long> pd = graph.createVertexProperty(PropertyType.LONG);
Partition<Integer> scc = analyst.sccTarjan(graph, pd);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + scc.getPropertyName() + " MATCH (x) ORDER BY x." + scc.getPropertyName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<Partition<ID>> sccTarjanAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<Partition<Integer>> promise = analyst.sccTarjanAsync(graph);
promise.thenCompose(scc -> graph.queryPgqlAsync(
"SELECT x, x." + scc.getPropertyName() + " MATCH (x) ORDER BY x." + scc.getPropertyName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Partition<ID>> sccTarjanAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution)
graph - partitionDistribution -
PgxGraph graph = ...;
VertexProperty<Integer, Long> pd = graph.createVertexProperty(PropertyType.LONG);
PgxFuture<Partition<Integer>> promise = analyst.sccTarjanAsync(graph, pd);
promise.thenCompose(scc -> graph.queryPgqlAsync(
"SELECT x, x." + scc.getPropertyName() + " MATCH (x) ORDER BY x." + scc.getPropertyName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> AllPaths<ID> shortestPathBellmanFord(PgxGraph graph, ID srcId, EdgeProperty<java.lang.Double> cost) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
shortestPathBellmanFord(PgxGraph, PgxVertex, EdgeProperty) taking a vertex ID
instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> AllPaths<ID> 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) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
shortestPathBellmanFord(PgxGraph, PgxVertex, EdgeProperty, VertexProperty,
VertexProperty, VertexProperty) taking a vertex ID
instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> AllPaths<ID> shortestPathBellmanFord(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - src - cost -
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
AllPaths<Integer> paths = analyst.shortestPathBellmanFord(graph, src, cost);
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> AllPaths<ID> 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) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - src - cost - distance - (out argument)
parent - (out argument)
parentEdge - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> distance = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
VertexProperty<Integer, PgxEdge> parentEdge = graph.createVertexProperty(PropertyType.EDGE);
AllPaths<Integer> paths = analyst.shortestPathBellmanFord(graph, src, cost, distance, parent, parentEdge);
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<AllPaths<ID>> shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost)
graph - src - cost -
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<AllPaths<Integer>> promise = analyst.shortestPathBellmanFordAsync(graph, src, cost);
promise.thenAccept(paths -> {
...;
});
public <ID> PgxFuture<AllPaths<ID>> 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)
graph - src - cost - distance - (out argument)
parent - (out argument)
parentEdge - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> distance = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
VertexProperty<Integer, PgxEdge> parentEdge = graph.createVertexProperty(PropertyType.EDGE);
PgxFuture<AllPaths<Integer>> promise = analyst.shortestPathBellmanFordAsync(
graph, src, cost, distance, parent, parentEdge);
promise.thenAccept(paths -> {
...;
});
public <ID> AllPaths<ID> shortestPathBellmanFordReverse(PgxGraph graph, ID srcId, EdgeProperty<java.lang.Double> cost) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
shortestPathBellmanFordReverse(PgxGraph, PgxVertex, EdgeProperty) taking a
vertex ID instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> AllPaths<ID> 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) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
shortestPathBellmanFordReverse(PgxGraph, PgxVertex, EdgeProperty,
VertexProperty, VertexProperty, VertexProperty) taking a
vertex ID instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> AllPaths<ID> shortestPathBellmanFordReverse(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - src - cost -
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
AllPaths<Integer> paths = analyst.shortestPathBellmanFordReverse(graph, src, cost);
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> AllPaths<ID> 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) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - src - cost - distance - (out argument) parent - (out argument) parentEdge - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> distance = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
VertexProperty<Integer, PgxEdge> parentEdge = graph.createVertexProperty(PropertyType.EDGE);
AllPaths<Integer> paths = analyst.shortestPathBellmanFordReverse(graph, src, cost, distance, parent, parentEdge);
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<AllPaths<ID>> shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost)
graph - src - cost -
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<AllPaths<Integer>> promise = analyst.shortestPathBellmanFordReverseAsync(graph, src, cost);
promise.thenAccept(paths -> {
...;
});
public <ID> PgxFuture<AllPaths<ID>> 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)
graph - src - cost - distance - (out argument) parent - (out argument) parentEdge - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> distance = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
VertexProperty<Integer, PgxEdge> parentEdge = graph.createVertexProperty(PropertyType.EDGE);
PgxFuture<AllPaths<Integer>> promise = analyst.shortestPathBellmanFordReverseAsync(
graph, src, cost, distance, parent, parentEdge);
promise.thenAccept(paths -> {
...;
});
public <ID> PgxPath<ID> shortestPathDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
shortestPathDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty) taking
vertex IDs instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxPath<ID> shortestPathDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
shortestPathDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty) taking
vertex IDs instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxPath<ID> shortestPathDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - src - dst - cost -
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
PgxVertex<Integer> dst = graph.getVertex(333);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxPath<Integer> path = analyst.shortestPathDijkstra(graph, src, dst, cost);
path.getPathLengthWithCost();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxPath<ID> shortestPathDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - src - dst - cost - parent - (out argument)
parentEdge - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
PgxVertex<Integer> dst = graph.getVertex(333);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
VertexProperty<Integer, PgxEdge> parentEdge = graph.createVertexProperty(PropertyType.EDGE);
PgxPath<Integer> path = analyst.shortestPathDijkstra(graph, src, dst, cost, parent, parentEdge);
path.getPathLengthWithCost();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<PgxPath<ID>> shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost)
graph - src - dst - cost -
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
PgxVertex<Integer> dst = graph.getVertex(333);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<PgxPath<Integer>> promise = analyst.shortestPathDijkstraAsync(graph, src, dst, cost);
promise.thenAccept(path -> {
path.getPathLengthWithCost();
});
public <ID> PgxFuture<PgxPath<ID>> shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
graph - src - dst - cost - parent - (out argument)
parentEdge - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
PgxVertex<Integer> dst = graph.getVertex(333);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
VertexProperty<Integer, PgxEdge> parentEdge = graph.createVertexProperty(PropertyType.EDGE);
PgxFuture<PgxPath<Integer>> promise = analyst.shortestPathDijkstraAsync(graph, src, dst, cost, parent, parentEdge);
promise.thenAccept(path -> {
path.getPathLengthWithCost();
});
public <ID> PgxPath<ID> shortestPathDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
shortestPathDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty)
taking vertex IDs instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxPath<ID> shortestPathDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
shortestPathDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty)
taking vertex IDs instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxPath<ID> shortestPathDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - src - dst - cost -
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
PgxVertex<Integer> dst = graph.getVertex(333);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxPath<Integer> path = analyst.shortestPathDijkstraBidirectional(graph, src, dst, cost);
path.getPathLengthWithCost();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxPath<ID> shortestPathDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - src - dst - cost - parent - (out argument) parentEdge - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
PgxVertex<Integer> dst = graph.getVertex(333);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
VertexProperty<Integer, PgxEdge> parentEdge = graph.createVertexProperty(PropertyType.EDGE);
PgxPath<Integer> path = analyst.shortestPathDijkstraBidirectional(graph, src, dst, cost, parent, parentEdge);
path.getPathLengthWithCost();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<PgxPath<ID>> shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost)
graph - src - dst - cost -
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
PgxVertex<Integer> dst = graph.getVertex(333);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<PgxPath<Integer>> promise = analyst.shortestPathDijkstraBidirectionalAsync(graph, src, dst, cost);
promise.thenAccept(path -> {
path.getPathLengthWithCost();
});
public <ID> PgxFuture<PgxPath<ID>> shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, java.lang.String parentName, java.lang.String parentEdgeName)
public <ID> PgxFuture<PgxPath<ID>> shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
graph - src - dst - cost - parent - (out argument) parentEdge - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
PgxVertex<Integer> dst = graph.getVertex(333);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
VertexProperty<Integer, PgxEdge> parentEdge = graph.createVertexProperty(PropertyType.EDGE);
PgxFuture<PgxPath<Integer>> promise = analyst.shortestPathDijkstraBidirectionalAsync(
graph, src, dst, cost, parent, parentEdge);
promise.thenAccept(path -> {
path.getPathLengthWithCost();
});
public <ID> PgxPath<ID> shortestPathFilteredDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
shortestPathFilteredDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter) taking vertex IDs
instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxPath<ID> shortestPathFilteredDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
shortestPathFilteredDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter) taking vertex IDs
instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxPath<ID> shortestPathFilteredDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - src - dst - cost - filterExpr -
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
PgxVertex<Integer> dst = graph.getVertex(333);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
EdgeFilter filter = new EdgeFilter("edge.cost > 5");
PgxPath<Integer> path = analyst.shortestPathFilteredDijkstra(graph, src, dst, cost, filter);
path.getPathLengthWithCost();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxPath<ID> 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) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - src - dst - cost - filterExpr - parent - (out argument) parentEdge - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
PgxVertex<Integer> dst = graph.getVertex(333);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
EdgeFilter filter = new EdgeFilter("edge.cost > 5");
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
VertexProperty<Integer, PgxEdge> parentEdge = graph.createVertexProperty(PropertyType.EDGE);
PgxPath<Integer> path = analyst.shortestPathFilteredDijkstra(graph, src, dst, cost, filter, parent, parentEdge);
path.getPathLengthWithCost();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<PgxPath<ID>> shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr)
graph - src - dst - cost - filterExpr -
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
PgxVertex<Integer> dst = graph.getVertex(333);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
EdgeFilter filter = new EdgeFilter("edge.cost > 5");
PgxFuture<PgxPath<Integer>> promise = analyst.shortestPathFilteredDijkstraAsync(graph, src, dst, cost, filter);
promise.thenAccept(path -> {
path.getPathLengthWithCost();
});
public <ID> PgxFuture<PgxPath<ID>> 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)
graph - src - dst - cost - filterExpr - parent - (out argument) parentEdge - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
PgxVertex<Integer> dst = graph.getVertex(333);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
EdgeFilter filter = new EdgeFilter("edge.cost > 5");
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
VertexProperty<Integer, PgxEdge> parentEdge = graph.createVertexProperty(PropertyType.EDGE);
PgxFuture<PgxPath<Integer>> promise = analyst.shortestPathFilteredDijkstraAsync(
graph, src, dst, cost, filter, parent, parentEdge);
promise.thenAccept(path -> {
path.getPathLengthWithCost();
});
public <ID> PgxPath<ID> shortestPathFilteredDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
shortestPathFilteredDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter)
taking vertex IDs instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxPath<ID> shortestPathFilteredDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
shortestPathFilteredDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter)
taking vertex IDs instead of PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxPath<ID> shortestPathFilteredDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - src - dst - cost - filterExpr -
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
PgxVertex<Integer> dst = graph.getVertex(333);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
EdgeFilter filter = new EdgeFilter("edge.cost > 5");
PgxPath<Integer> path = analyst.shortestPathFilteredDijkstraBidirectional(graph, src, dst, cost, filter);
path.getPathLengthWithCost();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxPath<ID> 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) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - src - dst - cost - filterExpr - parent - (out argument)
parentEdge - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
PgxVertex<Integer> dst = graph.getVertex(333);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
EdgeFilter filter = new EdgeFilter("edge.cost > 5");
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
VertexProperty<Integer, PgxEdge> parentEdge = graph.createVertexProperty(PropertyType.EDGE);
PgxPath<Integer> path = analyst.shortestPathFilteredDijkstraBidirectional(
graph, src, dst, cost, filter, parent, parentEdge);
path.getPathLengthWithCost();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<PgxPath<ID>> shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr)
graph - src - dst - cost - filterExpr -
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
PgxVertex<Integer> dst = graph.getVertex(333);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
EdgeFilter filter = new EdgeFilter("edge.cost > 5");
PgxFuture<PgxPath<Integer>> promise = analyst.shortestPathFilteredDijkstraBidirectionalAsync(
graph, src, dst, cost, filter);
promise.thenAccept(path -> {
path.getPathLengthWithCost();
});
public <ID> PgxFuture<PgxPath<ID>> shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, java.lang.String parentName, java.lang.String parentEdgeName)
public <ID> PgxFuture<PgxPath<ID>> 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)
graph - src - dst - cost - filterExpr - parent - (out argument)
parentEdge - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
PgxVertex<Integer> dst = graph.getVertex(333);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
EdgeFilter filter = new EdgeFilter("edge.cost > 5");
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
VertexProperty<Integer, PgxEdge> parentEdge = graph.createVertexProperty(PropertyType.EDGE);
PgxFuture<PgxPath<Integer>> promise = analyst.shortestPathFilteredDijkstraBidirectionalAsync(
graph, src, dst, cost, filter, parent, parentEdge);
promise.thenAccept(path -> {
path.getPathLengthWithCost();
});
public <ID> AllPaths<ID> shortestPathHopDist(PgxGraph graph, ID srcId) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
shortestPathHopDist(PgxGraph, PgxVertex) taking a vertex ID instead of
PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> AllPaths<ID> shortestPathHopDist(PgxGraph graph, ID srcId, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
shortestPathHopDist(PgxGraph, PgxVertex, VertexProperty, VertexProperty,
VertexProperty) taking a vertex ID instead of
PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> AllPaths<ID> shortestPathHopDist(PgxGraph graph, PgxVertex<ID> src) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - src -
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
AllPaths<Integer> paths = analyst.shortestPathHopDist(graph, src);
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> AllPaths<ID> shortestPathHopDist(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - src - distance - (out argument) parent - (out argument) parentEdge - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
VertexProperty<Integer, Double> distance = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
VertexProperty<Integer, PgxEdge> parentEdge = graph.createVertexProperty(PropertyType.EDGE);
AllPaths<Integer> paths = analyst.shortestPathHopDist(graph, src, distance, parent, parentEdge);
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<AllPaths<ID>> shortestPathHopDistAsync(PgxGraph graph, PgxVertex<ID> src)
graph - src -
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
PgxFuture<AllPaths<Integer>> promise = analyst.shortestPathHopDistAsync(graph, src);
promise.thenAccept(paths -> {
...;
});
public <ID> PgxFuture<AllPaths<ID>> shortestPathHopDistAsync(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
graph - src - distance - (out argument) parent - (out argument) parentEdge - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
VertexProperty<Integer, Double> distance = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
VertexProperty<Integer, PgxEdge> parentEdge = graph.createVertexProperty(PropertyType.EDGE);
PgxFuture<AllPaths<Integer>> promise = analyst.shortestPathHopDistAsync(graph, src, distance, parent, parentEdge);
promise.thenAccept(paths -> {
...;
});
public <ID> AllPaths<ID> shortestPathHopDistReverse(PgxGraph graph, ID srcId) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
shortestPathHopDistReverse(PgxGraph, PgxVertex) taking a vertex ID instead of
PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> AllPaths<ID> shortestPathHopDistReverse(PgxGraph graph, ID srcId, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
shortestPathHopDistReverse(PgxGraph, PgxVertex, VertexProperty, VertexProperty,
VertexProperty) taking a vertex ID instead of
PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> AllPaths<ID> shortestPathHopDistReverse(PgxGraph graph, PgxVertex<ID> src) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - src -
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
AllPaths<Integer> paths = analyst.shortestPathHopDistReverse(graph, src);
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> AllPaths<ID> shortestPathHopDistReverse(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - src - distance - (out argument) parent - (out argument) parentEdge - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
VertexProperty<Integer, Double> distance = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
VertexProperty<Integer, PgxEdge> parentEdge = graph.createVertexProperty(PropertyType.EDGE);
AllPaths<Integer> paths = analyst.shortestPathHopDistReverse(graph, src, distance, parent, parentEdge);
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<AllPaths<ID>> shortestPathHopDistReverseAsync(PgxGraph graph, PgxVertex<ID> src)
graph - src -
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
PgxFuture<AllPaths<Integer>> promise = analyst.shortestPathHopDistReverseAsync(graph, src);
promise.thenAccept(paths -> {
...;
});
public <ID> PgxFuture<AllPaths<ID>> shortestPathHopDistReverseAsync(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
graph - src - distance - (out argument) parent - (out argument) parentEdge - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> src = graph.getVertex(128);
VertexProperty<Integer, Double> distance = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, PgxVertex<Integer>> parent = graph.createVertexProperty(PropertyType.VERTEX);
VertexProperty<Integer, PgxEdge> parentEdge = graph.createVertexProperty(PropertyType.EDGE);
PgxFuture<AllPaths<Integer>> promise = analyst.shortestPathHopDistReverseAsync(
graph, src, distance, parent, parentEdge);
promise.thenAccept(paths -> {
...;
});
public <ID> VertexProperty<ID,java.lang.Integer> topologicalSchedule(PgxGraph graph, VertexSet<ID> source) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - source -
PgxGraph graph = ...;
VertexProperty<Integer, Integer> topoSched = analyst.topologicalSchedule(graph, source);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + topoSched.getName() + " WHERE (x) ORDER BY x." + topoSched.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Integer> topologicalSchedule(PgxGraph graph, VertexSet<ID> source, VertexProperty<ID,java.lang.Integer> topoSched) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - source - topoSched - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Integer> prop = graph.createVertexProperty(PropertyType.INTEGER);
VertexProperty<Integer, Integer> topoSched = analyst.topologicalSchedule(graph, source, prop);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + topoSched.getName() + " WHERE (x) ORDER BY x." + topoSched.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> topologicalScheduleAsync(PgxGraph graph, VertexSet<ID> source)
graph - source -
PgxGraph graph = ...;
VertexSet<Integer> source = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
PgxFuture<VertexProperty<Integer, Integer>> promise = analyst.topologicalScheduleAsync(graph, source);
promise.thenCompose(topoSched -> graph.queryPgqlAsync(
"SELECT x, x." + topoSched.getName() + " WHERE (x) ORDER BY x." + topoSched.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> topologicalScheduleAsync(PgxGraph graph, VertexSet<ID> source, VertexProperty<ID,java.lang.Integer> topoSched)
graph - source - topoSched - (out argument)
PgxGraph graph = ...;
VertexSet<Integer> source = graph.getVertices(new VertexFilter("vertex.prop1 < 10"));
VertexProperty<Integer, Integer> topoSched = graph.createVertexProperty(PropertyType.INTEGER);
PgxFuture<VertexProperty<Integer, Integer>> promise = analyst.topologicalScheduleAsync(graph, source, topoSched);
promise.thenCompose(topoSched -> graph.queryPgqlAsync(
"SELECT x, x." + topoSched.getName() + " WHERE (x) ORDER BY x." + topoSched.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> VertexProperty<ID,java.lang.Integer> topologicalSort(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
VertexProperty<Integer, Integer> topoSort = analyst.topologicalSort(graph);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + topoSort.getName() + " WHERE (x) ORDER BY x." + topoSort.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Integer> topologicalSort(PgxGraph graph, VertexProperty<ID,java.lang.Integer> topoSort) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - topoSort - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Integer> prop = graph.createVertexProperty(PropertyType.INTEGER);
VertexProperty<Integer, Integer> topoSort = analyst.topologicalSort(graph, prop);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + topoSort.getName() + " WHERE (x) ORDER BY x." + topoSort.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> topologicalSortAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<VertexProperty<Integer, Integer>> promise = analyst.topologicalSortAsync(graph);
promise.thenCompose(topoSort -> graph.queryPgqlAsync(
"SELECT x, x." + topoSort.getName() + " WHERE (x) ORDER BY x." + topoSort.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> topologicalSortAsync(PgxGraph graph, VertexProperty<ID,java.lang.Integer> topoSort)
graph - topoSort - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Integer> topoSort = graph.createVertexProperty(PropertyType.INTEGER);
PgxFuture<VertexProperty<Integer, Integer>> promise = analyst.topologicalSortAsync(graph, topoSort);
promise.thenCompose(topoSort -> graph.queryPgqlAsync(
"SELECT x, x." + topoSort.getName() + " WHERE (x) ORDER BY x." + topoSort.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public java.lang.String toString()
toString in class java.lang.Objectpublic <ID> VertexProperty<ID,java.lang.Double> vertexBetweennessCentrality(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
VertexProperty<Integer, Double> betweenness = analyst.vertexBetweennessCentrality(graph);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + betweenness.getName() + " MATCH (x) ORDER BY x." + betweenness.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> vertexBetweennessCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - bc - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> bc = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> betweenness = analyst.vertexBetweennessCentrality(graph, bc);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + betweenness.getName() + " MATCH (x) ORDER BY x." + betweenness.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> vertexBetweennessCentralityAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.vertexBetweennessCentralityAsync(graph);
promise.thenCompose(betweenness -> graph.queryPgqlAsync(
"SELECT x, x." + betweenness.getName() + " MATCH (x) ORDER BY x." + betweenness.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> vertexBetweennessCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc)
graph - bc - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> bc = graph.createVertexProperty(PropertyType.DOUBLE);
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.vertexBetweennessCentralityAsync(graph, bc);
promise.thenCompose(betweenness -> graph.queryPgqlAsync(
"SELECT x, x." + betweenness.getName() + " MATCH (x) ORDER BY x." + betweenness.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> Partition<ID> wcc(PgxGraph graph) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph -
PgxGraph graph = ...;
Partition<Integer> wcc = analyst.wcc(graph);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + wcc.getPropertyName() + " MATCH (x) ORDER BY x." + wcc.getPropertyName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Partition<ID> wcc(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - partitionDistribution -
PgxGraph graph = ...;
VertexProperty<Integer, Long> pd = graph.createVertexProperty(PropertyType.LONG);
Partition<Integer> wcc = analyst.wcc(graph, pd);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + wcc.getPropertyName() + " MATCH (x) ORDER BY x." + wcc.getPropertyName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<Partition<ID>> wccAsync(PgxGraph graph)
graph -
PgxGraph graph = ...;
PgxFuture<Partition<Integer>> promise = analyst.wccAsync(graph);
promise.thenCompose(wcc -> graph.queryPgqlAsync(
"SELECT x, x." + wcc.getPropertyName() + " MATCH (x) ORDER BY x." + wcc.getPropertyName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<Partition<ID>> wccAsync(PgxGraph graph, java.lang.String partitonDistributionName)
public <ID> PgxFuture<Partition<ID>> wccAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution)
graph - partitionDistribution -
PgxGraph graph = ...;
VertexProperty<Integer, Long> pd = graph.createVertexProperty(PropertyType.LONG);
PgxFuture<Partition<Integer>> promise = analyst.wccAsync(graph, pd);
promise.thenCompose(wcc -> graph.queryPgqlAsync(
"SELECT x, x." + wcc.getPropertyName() + " MATCH (x) ORDER BY x." + wcc.getPropertyName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> VertexProperty<ID,java.lang.Double> weightedPagerank(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - norm - weight -
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> pagerank = analyst.weightedPagerank(graph, false, cost);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> weightedPagerank(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - norm - weight - rank - (out argument)
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank = analyst.weightedPagerank(graph, false, cost, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> weightedPagerank(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - e - d - max - norm - weight -
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> pagerank = analyst.weightedPagerank(graph, 0.001, 0.85, 100, false, cost);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> weightedPagerank(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - e - d - max - norm - weight - rank - (out argument)
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank = analyst.weightedPagerank(graph, 0.001, 0.85, 100, false, cost, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> weightedPagerank(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - e - d - max - weight -
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> pagerank = analyst.weightedPagerank(graph, 0.001, 0.85, 100, cost);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> weightedPagerank(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - e - d - max - weight - rank - (out argument)
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank = analyst.weightedPagerank(graph, 0.001, 0.85, 100, cost, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> weightedPagerank(PgxGraph graph, EdgeProperty<java.lang.Double> weight) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - weight -
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> pagerank = analyst.weightedPagerank(graph, cost);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> VertexProperty<ID,java.lang.Double> weightedPagerank(PgxGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - weight - rank - (out argument)
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
VertexProperty<Integer, Double> pagerank = analyst.weightedPagerank(graph, cost, rank);
PgqlResultSet rs = graph.queryPgql(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC");
rs.print();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> weightedPagerankAsync(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight)
graph - norm - weight -
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.weightedPagerankAsync(graph, false, cost);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> weightedPagerankAsync(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
graph - norm - weight - rank - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.weightedPagerankAsync(graph, false, cost, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> weightedPagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight)
graph - e - d - max - norm - weight -
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.weightedPagerankAsync(
graph, 0.001, 0.85, 100, false, cost);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> weightedPagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
graph - e - d - max - norm - weight - rank - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.weightedPagerankAsync(
graph, 0.001, 0.85, 100, false, cost, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> weightedPagerankAsync(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight)
graph - e - d - max - weight -
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.weightedPagerankAsync(graph, 0.001, 0.85, 100, cost);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> weightedPagerankAsync(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
graph - e - d - max - weight - rank - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.weightedPagerankAsync(
graph, 0.001, 0.85, 100, cost, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> weightedPagerankAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight)
graph - weight -
PgxGraph graph = ...;
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.weightedPagerankAsync(graph, cost);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> PgxFuture<VertexProperty<ID,java.lang.Double>> weightedPagerankAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
graph - weight - rank - (out argument)
PgxGraph graph = ...;
VertexProperty<Integer, Double> rank = graph.createVertexProperty(PropertyType.DOUBLE);
EdgeProperty<Double> cost = graph.getEdgeProperty("cost");
PgxFuture<VertexProperty<Integer, Double>> promise = analyst.weightedPagerankAsync(graph, cost, rank);
promise.thenCompose(pagerank -> graph.queryPgqlAsync(
"SELECT x, x." + pagerank.getName() + " MATCH (x) ORDER BY x." + pagerank.getName() + " DESC"))
.thenAccept(PgqlResultSet::print);
public <ID> Pair<VertexSequence<ID>,VertexSequence<ID>> whomToFollow(PgxGraph graph, ID vertexId, int topK) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
whomToFollow(PgxGraph, PgxVertex, int) taking a vertex ID instead of a
PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexSequence<ID>,VertexSequence<ID>> whomToFollow(PgxGraph graph, ID vertexId, int topK, int sizeCircleOfTrust) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
whomToFollow(PgxGraph, PgxVertex, int, int) taking a vertex ID instead of a
PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexSequence<ID>,VertexSequence<ID>> 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) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
whomToFollow(PgxGraph, PgxVertex, int, int, int, BigDecimal, BigDecimal, int, BigDecimal)
taking a vertex ID instead of a PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexSequence<ID>,VertexSequence<ID>> 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) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
whomToFollow(PgxGraph, PgxVertex, int, int, int, BigDecimal, BigDecimal, int, BigDecimal, VertexSequence,
VertexSequence)
taking a vertex ID instead of a PgxVertex.java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexSequence<ID>,VertexSequence<ID>> whomToFollow(PgxGraph graph, PgxVertex<ID> vertex) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertex -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
Pair<VertexSequence<Integer>, VertexSequence<Integer>> wtf = analyst.whomToFollow(graph, vertex);
wtf.getFirst();
wtf.getSecond();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexSequence<ID>,VertexSequence<ID>> whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int topK) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertex - topK -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
Pair<VertexSequence<Integer>, VertexSequence<Integer>> wtf = analyst.whomToFollow(graph, vertex, 100);
wtf.getFirst();
wtf.getSecond();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexSequence<ID>,VertexSequence<ID>> whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int topK, int sizeCircleOfTrust) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertex - topK - sizeCircleOfTrust -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
Pair<VertexSequence<Integer>, VertexSequence<Integer>> wtf = analyst.whomToFollow(graph, vertex, 100, 500);
wtf.getFirst();
wtf.getSecond();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexSequence<ID>,VertexSequence<ID>> whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int topK, int sizeCircleOfTrust, int maxIter, double tol, double dampingFactor, int salsaMaxIter, double salsaTol) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertex - topK - sizeCircleOfTrust - maxIter - tol - dampingFactor - salsaMaxIter - salsaTol - hubs - (out argument) authorities - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
Pair<VertexSequence<Integer>, VertexSequence<Integer>> wtf =
analyst.whomToFollow(graph, vertex, 100, 500, 100, 0.001, 0.85, 100, 0.001);
wtf.getFirst();
wtf.getSecond();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexSequence<ID>,VertexSequence<ID>> 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) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertex - topK - sizeCircleOfTrust - maxIter - tol - dampingFactor - salsaMaxIter - salsaTol - hubs - (out argument) authorities - (out argument)
PgxGraph graph = ...;
VertexSequence<Integer> hubs = graph.createVertexSequence();
VertexSequence<Integer> auth = graph.createVertexSequence();
PgxVertex<Integer> vertex = graph.getVertex(128);
Pair<VertexSequence<Integer>, VertexSequence<Integer>> wtf =
analyst.whomToFollow(graph, vertex, 100, 500, 100, 0.001, 0.85, 100, 0.001, hubs, auth);
wtf.getFirst();
wtf.getSecond();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexSequence<ID>,VertexSequence<ID>> whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int topK, int sizeCircleOfTrust, VertexSequence<ID> hubs, VertexSequence<ID> authorities) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertex - topK - sizeCircleOfTrust - hubs - (out argument) authorities - (out argument)
PgxGraph graph = ...;
VertexSequence<Integer> hubs = graph.createVertexSequence();
VertexSequence<Integer> auth = graph.createVertexSequence();
PgxVertex<Integer> vertex = graph.getVertex(128);
Pair<VertexSequence<Integer>, VertexSequence<Integer>> wtf =
analyst.whomToFollow(graph, vertex, 100, 500, hubs, auth);
wtf.getFirst();
wtf.getSecond();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexSequence<ID>,VertexSequence<ID>> whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int topK, VertexSequence<ID> hubs, VertexSequence<ID> authorities) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertex - topK - hubs - (out argument) authorities - (out argument)
PgxGraph graph = ...;
VertexSequence<Integer> hubs = graph.createVertexSequence();
VertexSequence<Integer> auth = graph.createVertexSequence();
PgxVertex<Integer> vertex = graph.getVertex(128);
Pair<VertexSequence<Integer>, VertexSequence<Integer>> wtf = analyst.whomToFollow(graph, vertex, 100, hubs, auth);
wtf.getFirst();
wtf.getSecond();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> Pair<VertexSequence<ID>,VertexSequence<ID>> whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, VertexSequence<ID> hubs, VertexSequence<ID> authorities) throws java.util.concurrent.ExecutionException, java.lang.InterruptedException
graph - vertex - hubs - (out argument) authorities - (out argument)
PgxGraph graph = ...;
VertexSequence<Integer> hubs = graph.createVertexSequence();
VertexSequence<Integer> auth = graph.createVertexSequence();
PgxVertex<Integer> vertex = graph.getVertex(128);
Pair<VertexSequence<Integer>, VertexSequence<Integer>> wtf = analyst.whomToFollow(graph, vertex, hubs, auth);
wtf.getFirst();
wtf.getSecond();
java.util.concurrent.ExecutionExceptionjava.lang.InterruptedExceptionpublic <ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex)
graph - vertex -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
PgxFuture<Pair<VertexSequence<Integer>, VertexSequence<Integer>>> promise = analyst.whomToFollowAsync(
graph, vertex);
promise.thenAccept(wtf -> {
wtf.getFirst();
wtf.getSecond();
});
public <ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int topK)
graph - vertex - topK -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
PgxFuture<Pair<VertexSequence<Integer>, VertexSequence<Integer>>> promise = analyst.whomToFollowAsync(
graph, vertex, 100);
promise.thenAccept(wtf -> {
wtf.getFirst();
wtf.getSecond();
});
public <ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int topK, int sizeCircleOfTrust)
graph - vertex - topK - sizeCircleOfTrust -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
PgxFuture<Pair<VertexSequence<Integer>, VertexSequence<Integer>>> promise = analyst.whomToFollowAsync(
graph, vertex, 100, 500);
promise.thenAccept(wtf -> {
wtf.getFirst();
wtf.getSecond();
});
public <ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int topK, int sizeCircleOfTrust, int maxIter, double tol, double dampingFactor, int salsaMaxIter, double salsaTol)
graph - vertex - topK - sizeCircleOfTrust - maxIter - tol - dampingFactor - salsaMaxIter - salsaTol -
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
PgxFuture<Pair<VertexSequence<Integer>, VertexSequence<Integer>>> promise = analyst.whomToFollowAsync(
graph, vertex, 100, 500, 100, 0.001, 0.85, 100, 0.001);
promise.thenAccept(wtf -> {
wtf.getFirst();
wtf.getSecond();
});
public <ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> 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)
graph - vertex - topK - sizeCircleOfTrust - maxIter - tol - dampingFactor - salsaMaxIter - salsaTol - hubs - (out argument) authorities - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexSequence<Integer> hubs = graph.createVertexSequence();
VertexSequence<Integer> authorities = graph.createVertexSequence();
PgxFuture<Pair<VertexSequence<Integer>, VertexSequence<Integer>>> promise = analyst.whomToFollowAsync(
graph, vertex, 100, 500, 100, 0.001, 0.85, 100, 0.001, hubs, authorities);
promise.thenAccept(wtf -> {
wtf.getFirst();
wtf.getSecond();
});
public <ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int topK, int sizeCircleOfTrust, VertexSequence<ID> hubs, VertexSequence<ID> authorities)
graph - vertex - topK - sizeCircleOfTrust - hubs - (out argument) authorities - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexSequence<Integer> hubs = graph.createVertexSequence();
VertexSequence<Integer> authorities = graph.createVertexSequence();
PgxFuture<Pair<VertexSequence<Integer>, VertexSequence<Integer>>> promise = analyst.whomToFollowAsync(
graph, vertex, 100, 500, hubs, authorities);
promise.thenAccept(wtf -> {
wtf.getFirst();
wtf.getSecond();
});
public <ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int topK, VertexSequence<ID> hubs, VertexSequence<ID> authorities)
graph - vertex - topK - hubs - (out argument) authorities - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexSequence<Integer> hubs = graph.createVertexSequence();
VertexSequence<Integer> authorities = graph.createVertexSequence();
PgxFuture<Pair<VertexSequence<Integer>, VertexSequence<Integer>>> promise = analyst.whomToFollowAsync(
graph, vertex, 100, hubs, authorities);
promise.thenAccept(wtf -> {
wtf.getFirst();
wtf.getSecond();
});
public <ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, VertexSequence<ID> hubs, VertexSequence<ID> authorities)
graph - vertex - hubs - (out argument) authorities - (out argument)
PgxGraph graph = ...;
PgxVertex<Integer> vertex = graph.getVertex(128);
VertexSequence<Integer> hubs = graph.createVertexSequence();
VertexSequence<Integer> authorities = graph.createVertexSequence();
PgxFuture<Pair<VertexSequence<Integer>, VertexSequence<Integer>>> promise = analyst.whomToFollowAsync(
graph, vertex, hubs, authorities);
promise.thenAccept(wtf -> {
wtf.getFirst();
wtf.getSecond();
});
Copyright © 2016, 2019, Oracle and/or its affiliates. All Rights Reserved.