| Package | Description |
|---|---|
| oracle.pgx.api |
This package contains the main Java APIs.
|
| Modifier and Type | Class and Description |
|---|---|
class |
VertexLabels<ID> |
| Modifier and Type | Field and Description |
|---|---|
static java.util.Set<VertexProperty<?,?>> |
VertexProperty.ALL |
static java.util.Set<VertexProperty<?,?>> |
VertexProperty.NONE |
| Modifier and Type | Method and Description |
|---|---|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.approximateVertexBetweennessCentrality(PgxGraph graph, int k)
Blocking version of
Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph, int). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.approximateVertexBetweennessCentrality(PgxGraph graph, int k, VertexProperty<ID,java.lang.Double> bc)
Blocking version of
Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph, int). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.approximateVertexBetweennessCentralityFromSeeds(PgxGraph graph, PgxVertex<ID>... seeds)
Blocking version of
Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph, PgxVertex[]). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.approximateVertexBetweennessCentralityFromSeeds(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc, PgxVertex<ID>... seeds)
Blocking version of
Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph, PgxVertex[]). |
VertexProperty<ID,V> |
VertexProperty.clone()
Blocking version of
cloneAsync(). |
VertexProperty<ID,V> |
VertexProperty.clone(java.lang.String newPropertyName)
Blocking version of
cloneAsync(String). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.closenessCentralityDoubleLength(PgxGraph graph, EdgeProperty<java.lang.Double> cost)
Blocking version of
Analyst.closenessCentralityDoubleLengthAsync(PgxGraph, EdgeProperty). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.closenessCentralityDoubleLength(PgxGraph graph, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> cc)
Blocking version of
#closenessCentralityDoubleLengthAsync(PgxGraph, EdgeProperty, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.closenessCentralityUnitLength(PgxGraph graph)
Blocking version of
Analyst.closenessCentralityUnitLengthAsync(PgxGraph). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.closenessCentralityUnitLength(PgxGraph graph, VertexProperty<ID,java.lang.Double> cc)
Blocking version of
#closenessCentralityUnitLengthAsync(PgxGraph, VertexProperty<ID, Double>). |
<ID,V> VertexProperty<ID,PgxVect<V>> |
PgxGraph.combineVertexPropertiesIntoVectorProperty(java.util.List<VertexProperty<ID,V>> vertexPropertyList)
Blocking version of
PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List) Calls PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List) and waits for the returned PgxFuture to complete. |
<ID,V> VertexProperty<ID,PgxVect<V>> |
PgxGraph.combineVertexPropertiesIntoVectorProperty(java.util.List<VertexProperty<ID,V>> vertexPropertyList, java.lang.String name)
Blocking version of
PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List, String) Calls PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List, String) and waits for the returned PgxFuture to complete. |
<ID,V> VertexProperty<ID,V> |
PgxGraph.createVertexProperty(PropertyType type)
Blocking version of
PgxGraph.createVertexPropertyAsync(PropertyType). |
<ID,V> VertexProperty<ID,V> |
PgxGraph.createVertexProperty(PropertyType type, int dimension, java.lang.String name, boolean hardName)
Blocking version of
PgxGraph.createVertexPropertyAsync(PropertyType, int, String, boolean). |
<ID,V> VertexProperty<ID,V> |
PgxGraph.createVertexProperty(PropertyType type, java.lang.String name)
Blocking version of
PgxGraph.createVertexPropertyAsync(PropertyType, String). |
<ID,V> VertexProperty<ID,PgxVect<V>> |
PgxGraph.createVertexVectorProperty(PropertyType type, int dimension)
Blocking version of
PgxGraph.createVertexVectorPropertyAsync(PropertyType, int). |
<ID,V> VertexProperty<ID,PgxVect<V>> |
PgxGraph.createVertexVectorProperty(PropertyType type, int dimension, java.lang.String name)
Blocking version of
PgxGraph.createVertexVectorPropertyAsync(PropertyType, int, String). |
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.degreeCentrality(PgxGraph graph)
Blocking version of
Analyst.degreeCentralityAsync(PgxGraph). |
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.degreeCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
Blocking version of
Analyst.degreeCentralityAsync(PgxGraph). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.eigenvectorCentrality(PgxGraph graph)
Blocking version of
Analyst.eigenvectorCentralityAsync(PgxGraph). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.eigenvectorCentrality(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge)
Blocking version of
Analyst.eigenvectorCentralityAsync(PgxGraph, int, double, boolean, boolean). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.eigenvectorCentrality(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge, VertexProperty<ID,java.lang.Double> ec)
Blocking version of
#eigenvectorCentralityAsync(PgxGraph, int, double, boolean, boolean, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.eigenvectorCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Double> ec)
Blocking version of
#eigenvectorCentralityAsync(PgxGraph, VertexProperty<ID, Double>). |
VertexProperty<ID,java.lang.Double> |
MatrixFactorizationModel.getEstimatedRatings(PgxVertex<ID> estimateRatingsFor)
Blocking version of
MatrixFactorizationModel.getEstimatedRatingsAsync(PgxVertex) |
VertexProperty<ID,PgxVect<java.lang.Double>> |
MatrixFactorizationModel.getFeatures()
Gets the features of this model.
|
<ID> VertexProperty<ID,java.lang.Boolean> |
BipartiteGraph.getIsLeftProperty()
Blocking version of
BipartiteGraph.getIsLeftPropertyAsync(). |
<ID,V> VertexProperty<ID,V> |
PgxGraph.getVertexProperty(java.lang.String name)
Blocking version of
PgxGraph.getVertexPropertyAsync(String). |
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.inDegreeCentrality(PgxGraph graph)
Blocking version of
Analyst.inDegreeCentralityAsync(PgxGraph). |
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.inDegreeCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
Blocking version of
Analyst.inDegreeCentralityAsync(PgxGraph). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.localClusteringCoefficient(PgxGraph graph)
Blocking version of
Analyst.localClusteringCoefficientAsync(PgxGraph). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.localClusteringCoefficient(PgxGraph graph, VertexProperty<ID,java.lang.Double> lcc)
Blocking version of
Analyst.localClusteringCoefficientAsync(PgxGraph, VertexProperty). |
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.outDegreeCentrality(PgxGraph graph)
Blocking version of
Analyst.outDegreeCentralityAsync(PgxGraph). |
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.outDegreeCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
Blocking version of
Analyst.outDegreeCentralityAsync(PgxGraph). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph)
Blocking version of
Analyst.pagerankAsync(PgxGraph). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph, boolean norm)
Blocking version of
Analyst.pagerankAsync(PgxGraph, boolean). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#pagerankAsync(PgxGraph, boolean, VertexProperty<ID, Double>) Calls #pagerankAsync(PgxGraph, boolean, VertexProperty<ID, Double>) and waits for the returned PgxFuture to complete. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph, double e, double d, int max)
Blocking version of
Analyst.pagerankAsync(PgxGraph, double, double, int). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph, double e, double d, int max, boolean norm)
Blocking version of
Analyst.pagerankAsync(PgxGraph, double, double, int, boolean). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#pagerankAsync(PgxGraph, double, double, int, boolean, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#pagerankAsync(PgxGraph, double, double, int, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#pagerankAsync(PgxGraph, VertexProperty<ID, Double>) Calls #pagerankAsync(PgxGraph, VertexProperty<ID, Double>) and waits for the returned PgxFuture to complete. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerankApproximate(PgxGraph graph)
Blocking version of
Analyst.pagerankApproximateAsync(PgxGraph). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerankApproximate(PgxGraph graph, double e, double d, int max)
Blocking version of
Analyst.pagerankApproximateAsync(PgxGraph, double, double, int). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerankApproximate(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#pagerankApproximateAsync(PgxGraph, double, double, int, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerankApproximate(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#pagerankApproximateAsync(PgxGraph, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max)
Convenience wrapper around
Analyst.personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int,) taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, boolean norm)
Convenience wrapper around
Analyst.personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, boolean) taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Convenience wrapper around
#personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, boolean, VertexProperty<ID, Double>) taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, VertexProperty<ID,java.lang.Double> rank)
Convenience wrapper around
#personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, VertexProperty<ID, Double>) taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v)
Blocking version of
Analyst.personalizedPagerankAsync(PgxGraph, PgxVertex). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, boolean norm)
Blocking version of
Analyst.personalizedPagerankAsync(PgxGraph, PgxVertex, boolean). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedPagerankAsync(PgxGraph, PgxVertex, boolean, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max)
Blocking version of
Analyst.personalizedPagerankAsync(PgxGraph, PgxVertex, double, double, int). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm)
Blocking version of
Analyst.personalizedPagerankAsync(PgxGraph, PgxVertex, double, double, int, boolean). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedPagerankAsync(PgxGraph, PgxVertex, double, double, int, boolean, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedPagerankAsync(PgxGraph, PgxVertex, double, double, int, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedPagerankAsync(PgxGraph, PgxVertex, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices)
Blocking version of
Analyst.personalizedPagerankAsync(PgxGraph, VertexSet). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm)
Blocking version of
Analyst.personalizedPagerankAsync(PgxGraph, VertexSet, boolean). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedPagerankAsync(PgxGraph, VertexSet, boolean, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max)
Blocking version of
Analyst.personalizedPagerankAsync(PgxGraph, VertexSet, double, double, int). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm)
Blocking version of
Analyst.personalizedPagerankAsync(PgxGraph, VertexSet, double, double, int, boolean). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedPagerankAsync(PgxGraph, VertexSet, double, double, int, boolean, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedPagerankAsync(PgxGraph, VertexSet, double, double, int, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedPagerankAsync(PgxGraph, VertexSet, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedSalsa(BipartiteGraph graph, ID v, java.math.BigDecimal d, int maxIterations, java.math.BigDecimal maxDiff)
Convenience wrapper around
Analyst.personalizedSalsa(BipartiteGraph, PgxVertex, BigDecimal, int, BigDecimal) taking a vertex ID instead of PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedSalsa(BipartiteGraph graph, ID v, java.math.BigDecimal d, int maxIterations, java.math.BigDecimal maxDiff, VertexProperty<ID,java.lang.Double> salsaRank)
Convenience wrapper around
#personalizedSalsa(BipartiteGraph, PgxVertex, BigDecimal, int, BigDecimal, VertexProperty<ID, Double>) taking a vertex ID instead of PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedSalsa(BipartiteGraph graph, PgxVertex<ID> v)
Blocking version of
Analyst.personalizedSalsaAsync(BipartiteGraph, PgxVertex). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedSalsa(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIterations, double maxDiff)
Blocking version of
Analyst.personalizedSalsaAsync(BipartiteGraph, PgxVertex, double, int, double). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedSalsa(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIterations, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank)
Blocking version of
#personalizedSalsaAsync(BipartiteGraph, PgxVertex, double, int, double, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedSalsa(BipartiteGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> salsaRank)
Blocking version of
#personalizedSalsaAsync(BipartiteGraph, PgxVertex, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices)
Blocking version of
Analyst.personalizedSalsaAsync(BipartiteGraph, VertexSet). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIterations, double maxDiff)
Blocking version of
Analyst.personalizedSalsaAsync(BipartiteGraph, VertexSet, double, int, double). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIterations, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank)
Blocking version of
#personalizedSalsaAsync(BipartiteGraph, VertexSet, double, int, double, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> salsaRank)
Blocking version of
#personalizedSalsaAsync(BipartiteGraph, VertexSet, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, boolean norm, EdgeProperty<java.lang.Double> weight)
Convenience wrapper around
Analyst.personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, boolean, EdgeProperty) taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Convenience wrapper around
#personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, boolean, EdgeProperty, VertexProperty<ID, Double>) taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, EdgeProperty<java.lang.Double> weight)
Convenience wrapper around
Analyst.personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, EdgeProperty) taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Convenience wrapper around
#personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, EdgeProperty, VertexProperty<ID, Double>) taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight)
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, boolean, EdgeProperty,VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight)
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, double, double, int, boolean, EdgeProperty, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight)
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, double, double, int, EdgeProperty, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight)
Blocking version of
Analyst.personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, EdgeProperty) }. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, EdgeProperty, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight)
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedWeightedPagerankAsync(PgxGraph, VertexSet, boolean, EdgeProperty,VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight)
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedWeightedPagerankAsync(PgxGraph, VertexSet, double, double, int, boolean, EdgeProperty, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight)
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedWeightedPagerankAsync(PgxGraph, VertexSet, double, double, int, EdgeProperty, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight)
Blocking version of
Analyst.personalizedWeightedPagerankAsync(PgxGraph, VertexSet, EdgeProperty). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedWeightedPagerankAsync(PgxGraph, VertexSet, EdgeProperty,VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.salsa(BipartiteGraph graph)
Blocking version of
Analyst.salsaAsync(BipartiteGraph). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.salsa(BipartiteGraph graph, double maxDiff, int maxIter)
Blocking version of
Analyst.salsaAsync(BipartiteGraph, double, int). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.salsa(BipartiteGraph graph, double maxDiff, int maxIter, VertexProperty<ID,java.lang.Double> salsaRank)
Blocking version of
#salsaAsync(BipartiteGraph, double, int, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.salsa(BipartiteGraph graph, VertexProperty<ID,java.lang.Double> salsaRank)
Blocking version of
#salsaAsync(BipartiteGraph, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.vertexBetweennessCentrality(PgxGraph graph)
Blocking version of
Analyst.vertexBetweennessCentralityAsync(PgxGraph). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.vertexBetweennessCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc)
Blocking version of
#vertexBetweennessCentralityAsync(PgxGraph, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight)
Blocking version of
Analyst.weightedPagerankAsync(PgxGraph, boolean, EdgeProperty). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#weightedPagerankAsync(PgxGraph, boolean, EdgeProperty, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight)
Blocking version of
Analyst.weightedPagerankAsync(PgxGraph, double, double, int, boolean, EdgeProperty). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#weightedPagerankAsync(PgxGraph, double, double, int, boolean, EdgeProperty, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight)
Blocking version of
Analyst.weightedPagerankAsync(PgxGraph, double, double, int, EdgeProperty). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#weightedPagerankAsync(PgxGraph, double, double, int, EdgeProperty, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph, EdgeProperty<java.lang.Double> weight)
Blocking version of
Analyst.weightedPagerankAsync(PgxGraph, EdgeProperty). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#weightedPagerankAsync(PgxGraph, EdgeProperty, VertexProperty<ID, Double>). |
| Modifier and Type | Method and Description |
|---|---|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph graph, int k)
Approximate vertex betweenness centrality (without considering edge length).
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph graph, int k, VertexProperty<ID,java.lang.Double> bc)
Approximate vertex betweenness centrality (without considering edge length).
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph, PgxVertex<ID>... seeds)
Approximate vertex betweenness centrality (without considering edge length).
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc, PgxVertex<ID>... seeds)
Approximate vertex betweenness centrality (without considering edge length).
|
PgxFuture<VertexProperty<ID,V>> |
VertexProperty.cloneAsync()
Create a copy of this property.
Convenience method for cloneAsync(String) passing newPropertyName as null |
PgxFuture<VertexProperty<ID,V>> |
VertexProperty.cloneAsync(java.lang.String newPropertyName)
Creates a copy of this property.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<java.lang.Double> cost)
Compute closeness centrality.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> cc)
Compute closeness centrality.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityUnitLengthAsync(PgxGraph graph)
Compute closeness centrality.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityUnitLengthAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> cc)
Compute closeness centrality.
|
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>> |
PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(java.util.List<VertexProperty<ID,V>> vertexPropertyList)
Takes a list of scalar vertex properties of same type and creates a new vertex vector property by combining them.
|
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>> |
PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(java.util.List<VertexProperty<ID,V>> vertexPropertyList, java.lang.String name)
Takes a list of scalar vertex properties of same type and creates a new vertex vector property by combining them.
|
<ID,V> PgxFuture<VertexProperty<ID,V>> |
PgxGraph.createVertexPropertyAsync(PropertyType type)
Creates a session-bound vertex property
|
<ID,V> PgxFuture<VertexProperty<ID,V>> |
PgxGraph.createVertexPropertyAsync(PropertyType type, java.lang.String name)
Creates a session-bound vertex property
|
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>> |
PgxGraph.createVertexVectorPropertyAsync(PropertyType type, int dimension)
Creates a session-bound vertex vector property
|
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>> |
PgxGraph.createVertexVectorPropertyAsync(PropertyType type, int dimension, java.lang.String name)
Creates a session-bound vertex vector property
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.degreeCentralityAsync(PgxGraph graph)
Compute vertex centrality based on the sum of in- and out-degree.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.degreeCentralityAsync(PgxGraph graph, java.lang.String propertyName) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.degreeCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
Compute vertex centrality based on the sum of in- and out-degree.
|
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> |
Analyst.diameter(PgxGraph graph)
Blocking version of
Analyst.diameterAsync(PgxGraph). |
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> |
Analyst.diameter(PgxGraph graph, Scalar<java.lang.Integer> diameter, VertexProperty<ID,java.lang.Integer> eccentricity)
Blocking version of
Analyst.diameterAsync(PgxGraph, Scalar, VertexProperty). |
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
Analyst.diameterAsync(PgxGraph graph)
Computes the diameter of the (undirected) graph.
|
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
Analyst.diameterAsync(PgxGraph graph, Scalar<java.lang.Integer> diameter, VertexProperty<ID,java.lang.Integer> eccentricity)
Computes the diameter of the (undirected) graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.eigenvectorCentralityAsync(PgxGraph graph)
Compute eigenvector centrality using power iteration (with L1 norm).
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.eigenvectorCentralityAsync(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge)
Compute eigenvector centrality using power iteration (with L1 norm).
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.eigenvectorCentralityAsync(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge, VertexProperty<ID,java.lang.Double> ec)
Compute eigenvector centrality using power iteration (with L1 norm).
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.eigenvectorCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> ec)
Compute eigenvector centrality using power iteration (with L1 norm).
|
<S> java.util.List<VertexProperty<ID,S>> |
VertexProperty.expand()
Blocking version of
expandAsync(). |
<S> java.util.List<VertexProperty<ID,S>> |
VertexProperty.expand(java.lang.String namePrefix)
Blocking version of
expandAsync(String). |
<S> PgxFuture<java.util.List<VertexProperty<ID,S>>> |
VertexProperty.expandAsync()
If this is a vector property, expands this property into a list of scalar properties of same type.
|
<S> PgxFuture<java.util.List<VertexProperty<ID,S>>> |
VertexProperty.expandAsync(java.lang.String namePrefix)
If this is a vector property, expands this property into a list of scalar properties of same type.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph, ID root)
Convenience wrapper around
Analyst.filteredBfs(PgxGraph, PgxVertex) taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph, ID root)
Convenience wrapper around
Analyst.filteredBfs(PgxGraph, PgxVertex) taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator)
Convenience wrapper around
Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter) taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator)
Convenience wrapper around
Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter) taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, boolean initWithInf)
Convenience wrapper around
Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean) taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, boolean initWithInf)
Convenience wrapper around
Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean) taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
Convenience wrapper around
Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
Convenience wrapper around
Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root)
Blocking version of
Analyst.filteredBfsAsync(PgxGraph, PgxVertex). |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root)
Blocking version of
Analyst.filteredBfsAsync(PgxGraph, PgxVertex). |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator)
Blocking version of
Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter, VertexFilter). |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator)
Blocking version of
Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter, VertexFilter). |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf)
Blocking version of
Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean). |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf)
Blocking version of
Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean). |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root)
An algorithm to traverse a graph, breadth-first.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root)
An algorithm to traverse a graph, breadth-first.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator)
An algorithm to traverse a graph, breadth-first.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator)
An algorithm to traverse a graph, breadth-first.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf)
An algorithm to traverse a graph, breadth-first.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf)
An algorithm to traverse a graph, breadth-first.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
An algorithm to traverse a graph, breadth-first.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
An algorithm to traverse a graph, breadth-first.
|
PgxFuture<VertexProperty<ID,java.lang.Double>> |
MatrixFactorizationModel.getEstimatedRatingsAsync(PgxVertex<ID> estimateRatingsFor)
Computes estimated ratings for a specific vertex.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Boolean>> |
BipartiteGraph.getIsLeftPropertyAsync()
Gets the 'is Left' vertex property of the graph.
|
java.util.Set<VertexProperty<?,?>> |
PgxGraph.getVertexProperties()
Blocking version of
PgxGraph.getVertexPropertiesAsync(). |
PgxFuture<java.util.Set<VertexProperty<?,?>>> |
PgxGraph.getVertexPropertiesAsync()
Get the set of vertex properties belonging to this graph.
|
<ID,V> PgxFuture<VertexProperty<ID,V>> |
PgxGraph.getVertexPropertyAsync(java.lang.String name)
Gets a vertex property of this graph
|
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
Analyst.hits(PgxGraph graph)
Blocking version of
Analyst.hitsAsync(PgxGraph). |
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
Analyst.hits(PgxGraph graph)
Blocking version of
Analyst.hitsAsync(PgxGraph). |
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
Analyst.hits(PgxGraph graph, int max)
Blocking version of
Analyst.hitsAsync(PgxGraph, int). |
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
Analyst.hits(PgxGraph graph, int max)
Blocking version of
Analyst.hitsAsync(PgxGraph, int). |
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
Analyst.hits(PgxGraph graph, int max, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)
Blocking version of
Analyst.hitsAsync(PgxGraph, int, VertexProperty, VertexProperty) } Calls Analyst.hitsAsync(PgxGraph, int, VertexProperty, VertexProperty) and waits for the returned PgxFuture to complete. |
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
Analyst.hits(PgxGraph graph, int max, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)
Blocking version of
Analyst.hitsAsync(PgxGraph, int, VertexProperty, VertexProperty) } Calls Analyst.hitsAsync(PgxGraph, int, VertexProperty, VertexProperty) and waits for the returned PgxFuture to complete. |
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
Analyst.hits(PgxGraph graph, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)
Blocking version of
Analyst.hitsAsync(PgxGraph, VertexProperty, VertexProperty). |
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
Analyst.hits(PgxGraph graph, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)
Blocking version of
Analyst.hitsAsync(PgxGraph, VertexProperty, VertexProperty). |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph)
This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph)
This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph, int max)
This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph, int max)
This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph, int max, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)
This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph, int max, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)
This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)
This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)
This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.inDegreeCentralityAsync(PgxGraph graph)
Compute vertex centrality based on the in-degree.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.inDegreeCentralityAsync(PgxGraph graph, java.lang.String propertyName) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.inDegreeCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
Compute vertex centrality based on the in-degree.
|
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> |
Analyst.kcore(PgxGraph graph)
Blocking version of
Analyst.kcoreAsync(PgxGraph). |
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> |
Analyst.kcore(PgxGraph graph, int minCore, int maxCore)
Blocking version of
Analyst.kcoreAsync(PgxGraph, int, int). |
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> |
Analyst.kcore(PgxGraph graph, int minCore, int maxCore, Scalar<java.lang.Long> maxKCore, VertexProperty<ID,java.lang.Long> kcore)
Blocking version of
Analyst.kcoreAsync(PgxGraph, int, int, Scalar, VertexProperty). |
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> |
Analyst.kcore(PgxGraph graph, Scalar<java.lang.Long> maxKCore, VertexProperty<ID,java.lang.Long> kcore)
Blocking version of
Analyst.kcoreAsync(PgxGraph, Scalar, VertexProperty). |
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
Analyst.kcoreAsync(PgxGraph graph)
Computes the k-core decomposition of the graph.
|
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
Analyst.kcoreAsync(PgxGraph graph, int minCore, int maxCore)
Computes the k-core decomposition of the graph.
|
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
Analyst.kcoreAsync(PgxGraph graph, int minCore, int maxCore, Scalar<java.lang.Long> maxKCore, VertexProperty<ID,java.lang.Long> kcore)
Computes the k-core decomposition of the graph.
|
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
Analyst.kcoreAsync(PgxGraph graph, Scalar<java.lang.Long> maxKCore, VertexProperty<ID,java.lang.Long> kcore)
Computes the k-core decomposition of the graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.localClusteringCoefficientAsync(PgxGraph graph)
Computes the local clustering coefficient for each node in an undirected graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.localClusteringCoefficientAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> lcc) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.outDegreeCentralityAsync(PgxGraph graph)
Compute vertex centrality based on the out-degree.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.outDegreeCentralityAsync(PgxGraph graph, java.lang.String propertyName) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.outDegreeCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
Compute vertex centrality based on the out-degree.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph)
Computes an approximate pagerank.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph, double e, double d, int max)
Computes an approximate pagerank.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
Computes an approximate pagerank.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank)
Computes an approximate pagerank.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph)
Classic pagerank algorithm.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph, boolean norm)
Classic pagerank algorithm.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Classic pagerank algorithm.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max)
Classic pagerank algorithm.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm)
Classic pagerank algorithm.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Classic pagerank algorithm.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
Classic pagerank algorithm.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank)
Classic pagerank algorithm.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v)
Personalized SALSA computes recommendations ith respect to a given vertex v.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIterations, double maxDiff)
Personalized SALSA computes recommendations ith respect to a given vertex v.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIterations, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank)
Personalized SALSA computes recommendations ith respect to a given vertex v.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> salsaRank)
Personalized SALSA computes recommendations ith respect to a given vertex v.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices)
Personalized SALSA computes recommendations ith respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIterations, double maxDiff)
Personalized SALSA computes recommendations ith respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIterations, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank)
Personalized SALSA computes recommendations ith respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> salsaRank)
Personalized SALSA computes recommendations ith respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> |
Analyst.radius(PgxGraph graph)
Blocking version of
Analyst.radiusAsync(PgxGraph). |
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> |
Analyst.radius(PgxGraph graph, Scalar<java.lang.Integer> radius, VertexProperty<ID,java.lang.Integer> eccentricity)
Blocking version of
Analyst.radiusAsync(PgxGraph, Scalar, VertexProperty). |
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
Analyst.radiusAsync(PgxGraph graph)
Computes the radius of the (undirected) graph.
|
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
Analyst.radiusAsync(PgxGraph graph, Scalar<java.lang.Integer> radius, VertexProperty<ID,java.lang.Integer> eccentricity)
Computes the radius of the (undirected) graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.salsaAsync(BipartiteGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.salsaAsync(BipartiteGraph graph, double maxDiff, int maxIter) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.salsaAsync(BipartiteGraph graph, double maxDiff, int maxIter, VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.salsaAsync(BipartiteGraph graph, VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.vertexBetweennessCentralityAsync(PgxGraph graph)
Compute vertex betweenness centrality (without considering edge length).
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.vertexBetweennessCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc)
Compute vertex betweenness centrality (without considering edge length).
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight)
Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight)
Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight)
Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight)
Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
|
| Modifier and Type | Method and Description |
|---|---|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.approximateVertexBetweennessCentrality(PgxGraph graph, int k, VertexProperty<ID,java.lang.Double> bc)
Blocking version of
Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph, int). |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph graph, int k, VertexProperty<ID,java.lang.Double> bc)
Approximate vertex betweenness centrality (without considering edge length).
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.approximateVertexBetweennessCentralityFromSeeds(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc, PgxVertex<ID>... seeds)
Blocking version of
Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph, PgxVertex[]). |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc, PgxVertex<ID>... seeds)
Approximate vertex betweenness centrality (without considering edge length).
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.closenessCentralityDoubleLength(PgxGraph graph, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> cc)
Blocking version of
#closenessCentralityDoubleLengthAsync(PgxGraph, EdgeProperty, VertexProperty<ID, Double>). |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> cc)
Compute closeness centrality.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.closenessCentralityUnitLength(PgxGraph graph, VertexProperty<ID,java.lang.Double> cc)
Blocking version of
#closenessCentralityUnitLengthAsync(PgxGraph, VertexProperty<ID, Double>). |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityUnitLengthAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> cc)
Compute closeness centrality.
|
<ID> Partition<ID> |
Analyst.communitiesConductanceMinimization(PgxGraph graph, int max, VertexProperty<ID,java.lang.Long> partitonDistribution)
Blocking version of
#communitiesConductanceMinimizationAsync(PgxGraph, int, VertexProperty<ID, Long>). |
<ID> Partition<ID> |
Analyst.communitiesConductanceMinimization(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution)
Blocking version of
#communitiesConductanceMinimizationAsync(PgxGraph, VertexProperty<ID, Long>). |
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph, int max, VertexProperty<ID,java.lang.Long> partitionDistribution)
Detect communities using greedy conductance minimization.
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution)
Detect communities using greedy conductance minimization.
|
<ID> Partition<ID> |
Analyst.communitiesLabelPropagation(PgxGraph graph, int maxIterations, VertexProperty<ID,java.lang.Long> partitonDistribution)
Blocking version of
#communitiesLabelPropagationAsync(PgxGraph, int, VertexProperty<ID, Long>). |
<ID> Partition<ID> |
Analyst.communitiesLabelPropagation(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution)
Blocking version of
#communitiesLabelPropagationAsync(PgxGraph, VertexProperty<ID, Long>). |
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesLabelPropagationAsync(PgxGraph graph, int maxIteration, VertexProperty<ID,java.lang.Long> partitionDistribution)
Detect communities using parallel label propagation with the possibility to limit the number of iterations.
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesLabelPropagationAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution)
Detect communities using parallel label propagation with the possibility to limit the number of iterations.
|
<ID extends java.lang.Comparable<ID>> |
PgxGraph.createAllPaths(PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> dist, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID extends java.lang.Comparable<ID>> |
PgxGraph.createAllPaths(PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> dist, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID extends java.lang.Comparable<ID>> |
PgxGraph.createAllPaths(PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> dist, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> PgxFuture<AllPaths<ID>> |
PgxGraph.createAllPathsAsync(PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> dist, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Creates a
AllPaths object representing all the shortest paths from a single source to all the possible destinations (shortest regarding the given edge costs). |
<ID> PgxFuture<AllPaths<ID>> |
PgxGraph.createAllPathsAsync(PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> dist, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Creates a
AllPaths object representing all the shortest paths from a single source to all the possible destinations (shortest regarding the given edge costs). |
<ID> PgxFuture<AllPaths<ID>> |
PgxGraph.createAllPathsAsync(PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> dist, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Creates a
AllPaths object representing all the shortest paths from a single source to all the possible destinations (shortest regarding the given edge costs). |
<ID> Partition<ID> |
PgxGraph.createComponents(VertexProperty<ID,java.lang.Long> components, long numComponents)
Blocking version of
PgxGraph.createComponentsAsync(VertexProperty, long). |
<ID> PgxFuture<Partition<ID>> |
PgxGraph.createComponentsAsync(VertexProperty<ID,java.lang.Long> components, long numComponents)
Creates a
Partition object holding a collection of vertex sets, each representing a component. |
<ID> PgxPath<ID> |
PgxGraph.createPath(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> PgxPath<ID> |
PgxGraph.createPath(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> PgxFuture<PgxPath<ID>> |
PgxGraph.createPathAsync(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Creates a
PgxPath object representing the shortest path from one source to one destination (shortest regarding the given edge costs). |
<ID> PgxFuture<PgxPath<ID>> |
PgxGraph.createPathAsync(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Creates a
PgxPath object representing the shortest path from one source to one destination (shortest regarding the given edge costs). |
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.degreeCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
Blocking version of
Analyst.degreeCentralityAsync(PgxGraph). |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.degreeCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
Compute vertex centrality based on the sum of in- and out-degree.
|
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> |
Analyst.diameter(PgxGraph graph, Scalar<java.lang.Integer> diameter, VertexProperty<ID,java.lang.Integer> eccentricity)
Blocking version of
Analyst.diameterAsync(PgxGraph, Scalar, VertexProperty). |
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
Analyst.diameterAsync(PgxGraph graph, Scalar<java.lang.Integer> diameter, VertexProperty<ID,java.lang.Integer> eccentricity)
Computes the diameter of the (undirected) graph.
|
B |
MutationStrategyBuilder.dropVertexProperty(VertexProperty<?,?> vertexProperty)
Set vertex property that will be dropped after the mutation.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.eigenvectorCentrality(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge, VertexProperty<ID,java.lang.Double> ec)
Blocking version of
#eigenvectorCentralityAsync(PgxGraph, int, double, boolean, boolean, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.eigenvectorCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Double> ec)
Blocking version of
#eigenvectorCentralityAsync(PgxGraph, VertexProperty<ID, Double>). |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.eigenvectorCentralityAsync(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge, VertexProperty<ID,java.lang.Double> ec)
Compute eigenvector centrality using power iteration (with L1 norm).
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.eigenvectorCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> ec)
Compute eigenvector centrality using power iteration (with L1 norm).
|
<ID> AllPaths<ID> |
Analyst.fattestPath(PgxGraph graph, ID rootId, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.fattestPath(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of a PgxVertex. |
<ID> AllPaths<ID> |
Analyst.fattestPath(PgxGraph graph, ID rootId, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.fattestPath(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of a PgxVertex. |
<ID> AllPaths<ID> |
Analyst.fattestPath(PgxGraph graph, ID rootId, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.fattestPath(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of a PgxVertex. |
<ID> AllPaths<ID> |
Analyst.fattestPath(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> AllPaths<ID> |
Analyst.fattestPath(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> AllPaths<ID> |
Analyst.fattestPath(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Fattest Tree Algorithm - Computes the fattest path from a source vertex to all vertices in the graph.
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Fattest Tree Algorithm - Computes the fattest path from a source vertex to all vertices in the graph.
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Fattest Tree Algorithm - Computes the fattest path from a source vertex to all vertices in the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
Convenience wrapper around
Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph, ID root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
Convenience wrapper around
Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
An algorithm to traverse a graph, breadth-first.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)
An algorithm to traverse a graph, breadth-first.
|
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
Analyst.hits(PgxGraph graph, int max, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)
Blocking version of
Analyst.hitsAsync(PgxGraph, int, VertexProperty, VertexProperty) } Calls Analyst.hitsAsync(PgxGraph, int, VertexProperty, VertexProperty) and waits for the returned PgxFuture to complete. |
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
Analyst.hits(PgxGraph graph, int max, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)
Blocking version of
Analyst.hitsAsync(PgxGraph, int, VertexProperty, VertexProperty) } Calls Analyst.hitsAsync(PgxGraph, int, VertexProperty, VertexProperty) and waits for the returned PgxFuture to complete. |
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
Analyst.hits(PgxGraph graph, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)
Blocking version of
Analyst.hitsAsync(PgxGraph, VertexProperty, VertexProperty). |
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
Analyst.hits(PgxGraph graph, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)
Blocking version of
Analyst.hitsAsync(PgxGraph, VertexProperty, VertexProperty). |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph, int max, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)
This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph, int max, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)
This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)
This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs)
This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.inDegreeCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
Blocking version of
Analyst.inDegreeCentralityAsync(PgxGraph). |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.inDegreeCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
Compute vertex centrality based on the in-degree.
|
java.lang.Boolean |
PgxGraph.isBipartiteGraph(VertexProperty<?,java.lang.Boolean> isLeft)
Blocking version of
PgxGraph.isBipartiteGraphAsync(VertexProperty). |
<ID> PgxFuture<java.lang.Boolean> |
PgxGraph.isBipartiteGraphAsync(VertexProperty<ID,java.lang.Boolean> isLeft)
Checks whether a given graph is a bipartite graph.
|
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> |
Analyst.kcore(PgxGraph graph, int minCore, int maxCore, Scalar<java.lang.Long> maxKCore, VertexProperty<ID,java.lang.Long> kcore)
Blocking version of
Analyst.kcoreAsync(PgxGraph, int, int, Scalar, VertexProperty). |
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> |
Analyst.kcore(PgxGraph graph, Scalar<java.lang.Long> maxKCore, VertexProperty<ID,java.lang.Long> kcore)
Blocking version of
Analyst.kcoreAsync(PgxGraph, Scalar, VertexProperty). |
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
Analyst.kcoreAsync(PgxGraph graph, int minCore, int maxCore, Scalar<java.lang.Long> maxKCore, VertexProperty<ID,java.lang.Long> kcore)
Computes the k-core decomposition of the graph.
|
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
Analyst.kcoreAsync(PgxGraph graph, Scalar<java.lang.Long> maxKCore, VertexProperty<ID,java.lang.Long> kcore)
Computes the k-core decomposition of the graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.localClusteringCoefficient(PgxGraph graph, VertexProperty<ID,java.lang.Double> lcc)
Blocking version of
Analyst.localClusteringCoefficientAsync(PgxGraph, VertexProperty). |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.localClusteringCoefficientAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> lcc) |
<ID> MatrixFactorizationModel<ID> |
Analyst.matrixFactorizationGradientDescent(BipartiteGraph graph, EdgeProperty<java.lang.Double> weightProperty, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength, VertexProperty<ID,PgxVect<java.lang.Double>> features)
Blocking version of
#matrixFactorizationGradientDescentAsync(BipartiteGraph, EdgeProperty, double, double, double, int, int, VertexProperty<ID, PgxVect<Double>>). |
<ID> MatrixFactorizationModel<ID> |
Analyst.matrixFactorizationGradientDescent(BipartiteGraph graph, EdgeProperty<java.lang.Double> weightProperty, VertexProperty<ID,PgxVect<java.lang.Double>> features)
Blocking version of
#matrixFactorizationGradientDescentAsync(BipartiteGraph, EdgeProperty, VertexProperty<ID, PgxVect<Double>>). |
<ID> PgxFuture<MatrixFactorizationModel<ID>> |
Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weightProperty, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength, VertexProperty<ID,PgxVect<java.lang.Double>> features)
Performs the training step of generating recommendations using matrix factorization.
|
<ID> PgxFuture<MatrixFactorizationModel<ID>> |
Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weightProperty, VertexProperty<ID,PgxVect<java.lang.Double>> features)
Performs the training step of generating recommendations using matrix factorization.
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.outDegreeCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
Blocking version of
Analyst.outDegreeCentralityAsync(PgxGraph). |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.outDegreeCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc)
Compute vertex centrality based on the out-degree.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#pagerankAsync(PgxGraph, boolean, VertexProperty<ID, Double>) Calls #pagerankAsync(PgxGraph, boolean, VertexProperty<ID, Double>) and waits for the returned PgxFuture to complete. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#pagerankAsync(PgxGraph, double, double, int, boolean, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#pagerankAsync(PgxGraph, double, double, int, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#pagerankAsync(PgxGraph, VertexProperty<ID, Double>) Calls #pagerankAsync(PgxGraph, VertexProperty<ID, Double>) and waits for the returned PgxFuture to complete. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerankApproximate(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#pagerankApproximateAsync(PgxGraph, double, double, int, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerankApproximate(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#pagerankApproximateAsync(PgxGraph, VertexProperty<ID, Double>). |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
Computes an approximate pagerank.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank)
Computes an approximate pagerank.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Classic pagerank algorithm.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Classic pagerank algorithm.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
Classic pagerank algorithm.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank)
Classic pagerank algorithm.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Convenience wrapper around
#personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, boolean, VertexProperty<ID, Double>) taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, VertexProperty<ID,java.lang.Double> rank)
Convenience wrapper around
#personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, VertexProperty<ID, Double>) taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedPagerankAsync(PgxGraph, PgxVertex, boolean, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedPagerankAsync(PgxGraph, PgxVertex, double, double, int, boolean, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedPagerankAsync(PgxGraph, PgxVertex, double, double, int, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedPagerankAsync(PgxGraph, PgxVertex, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedPagerankAsync(PgxGraph, VertexSet, boolean, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedPagerankAsync(PgxGraph, VertexSet, double, double, int, boolean, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedPagerankAsync(PgxGraph, VertexSet, double, double, int, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedPagerankAsync(PgxGraph, VertexSet, VertexProperty<ID, Double>). |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedSalsa(BipartiteGraph graph, ID v, java.math.BigDecimal d, int maxIterations, java.math.BigDecimal maxDiff, VertexProperty<ID,java.lang.Double> salsaRank)
Convenience wrapper around
#personalizedSalsa(BipartiteGraph, PgxVertex, BigDecimal, int, BigDecimal, VertexProperty<ID, Double>) taking a vertex ID instead of PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedSalsa(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIterations, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank)
Blocking version of
#personalizedSalsaAsync(BipartiteGraph, PgxVertex, double, int, double, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedSalsa(BipartiteGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> salsaRank)
Blocking version of
#personalizedSalsaAsync(BipartiteGraph, PgxVertex, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIterations, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank)
Blocking version of
#personalizedSalsaAsync(BipartiteGraph, VertexSet, double, int, double, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> salsaRank)
Blocking version of
#personalizedSalsaAsync(BipartiteGraph, VertexSet, VertexProperty<ID, Double>). |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIterations, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank)
Personalized SALSA computes recommendations ith respect to a given vertex v.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> salsaRank)
Personalized SALSA computes recommendations ith respect to a given vertex v.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIterations, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank)
Personalized SALSA computes recommendations ith respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> salsaRank)
Personalized SALSA computes recommendations ith respect to a given set of vertices.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Convenience wrapper around
#personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, boolean, EdgeProperty, VertexProperty<ID, Double>) taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Convenience wrapper around
#personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, EdgeProperty, VertexProperty<ID, Double>) taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, boolean, EdgeProperty,VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, double, double, int, boolean, EdgeProperty, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, double, double, int, EdgeProperty, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, EdgeProperty, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedWeightedPagerankAsync(PgxGraph, VertexSet, boolean, EdgeProperty,VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedWeightedPagerankAsync(PgxGraph, VertexSet, double, double, int, boolean, EdgeProperty, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedWeightedPagerankAsync(PgxGraph, VertexSet, double, double, int, EdgeProperty, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedWeightedPagerankAsync(PgxGraph, VertexSet, EdgeProperty,VertexProperty<ID, Double>). |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> |
Analyst.radius(PgxGraph graph, Scalar<java.lang.Integer> radius, VertexProperty<ID,java.lang.Integer> eccentricity)
Blocking version of
Analyst.radiusAsync(PgxGraph, Scalar, VertexProperty). |
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
Analyst.radiusAsync(PgxGraph graph, Scalar<java.lang.Integer> radius, VertexProperty<ID,java.lang.Integer> eccentricity)
Computes the radius of the (undirected) graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.salsa(BipartiteGraph graph, double maxDiff, int maxIter, VertexProperty<ID,java.lang.Double> salsaRank)
Blocking version of
#salsaAsync(BipartiteGraph, double, int, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.salsa(BipartiteGraph graph, VertexProperty<ID,java.lang.Double> salsaRank)
Blocking version of
#salsaAsync(BipartiteGraph, VertexProperty<ID, Double>). |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.salsaAsync(BipartiteGraph graph, double maxDiff, int maxIter, VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.salsaAsync(BipartiteGraph graph, VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> Partition<ID> |
Analyst.sccKosaraju(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution)
Blocking version of
#sccKosarajuAsync(PgxGraph, VertexProperty<ID, Long>). |
<ID> PgxFuture<Partition<ID>> |
Analyst.sccKosarajuAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution)
Find strongly connected components using Kosaraju's algorithm.
|
<ID> Partition<ID> |
Analyst.sccTarjan(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution)
Blocking version of
#sccTarjanAsync(PgxGraph, VertexProperty<ID, Long>). |
<ID> PgxFuture<Partition<ID>> |
Analyst.sccTarjanAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution)
Find strongly connected components using Tarjan's algorithm.
|
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFord(PgxGraph graph, ID srcId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathBellmanFord(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex. |
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFord(PgxGraph graph, ID srcId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathBellmanFord(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex. |
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFord(PgxGraph graph, ID srcId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathBellmanFord(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex. |
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFord(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFord(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFord(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Compute single source shortest paths using Bellman & Ford algorithm
Time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length |
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Compute single source shortest paths using Bellman & Ford algorithm
Time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length |
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Compute single source shortest paths using Bellman & Ford algorithm
Time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length |
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFordReverse(PgxGraph graph, ID srcId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathBellmanFordReverse(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex. |
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFordReverse(PgxGraph graph, ID srcId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathBellmanFordReverse(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex. |
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFordReverse(PgxGraph graph, ID srcId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathBellmanFordReverse(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex. |
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFordReverse(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFordReverse(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFordReverse(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Compute reverse single source shortest paths using Bellman & Ford algorithm
Time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length |
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Compute reverse single source shortest paths using Bellman & Ford algorithm
Time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length |
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Compute reverse single source shortest paths using Bellman & Ford algorithm
Time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length |
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty) taking vertex IDs instead of PgxVertex. |
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty) taking vertex IDs instead of PgxVertex. |
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Compute shortest path using Dijkstra's algorithm.
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Compute shortest path using Dijkstra's algorithm.
|
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty) taking vertex IDs instead of PgxVertex. |
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty) taking vertex IDs instead of PgxVertex. |
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Compute shortest path using a bi-directional Dijkstra variant.
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Compute shortest path using a bi-directional Dijkstra variant.
|
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathFilteredDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter) taking vertex IDs instead of PgxVertex. |
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathFilteredDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter) taking vertex IDs instead of PgxVertex. |
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Compute shortest path using Dijkstra's algorithm on a filtered graph
The filter specified by the given filter expression is applied on each edge during traversal of the graph. |
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Compute shortest path using Dijkstra's algorithm on a filtered graph
The filter specified by the given filter expression is applied on each edge during traversal of the graph. |
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter) taking vertex IDs instead of PgxVertex. |
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter) taking vertex IDs instead of PgxVertex. |
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Compute shortest path using a bi-directional Dijkstra variant on a filtered graph.
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Compute shortest path using a bi-directional Dijkstra variant on a filtered graph.
|
<ID> AllPaths<ID> |
Analyst.shortestPathHopDist(PgxGraph graph, ID srcId, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathHopDist(PgxGraph, PgxVertex, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex. |
<ID> AllPaths<ID> |
Analyst.shortestPathHopDist(PgxGraph graph, ID srcId, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathHopDist(PgxGraph, PgxVertex, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex. |
<ID> AllPaths<ID> |
Analyst.shortestPathHopDist(PgxGraph graph, ID srcId, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathHopDist(PgxGraph, PgxVertex, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex. |
<ID> AllPaths<ID> |
Analyst.shortestPathHopDist(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> AllPaths<ID> |
Analyst.shortestPathHopDist(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> AllPaths<ID> |
Analyst.shortestPathHopDist(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathHopDistAsync(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Compute hop-distance from given vertex to every other vertex
Time complexity: O(E * d) with E = number of edges, d = diameter of graph |
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathHopDistAsync(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Compute hop-distance from given vertex to every other vertex
Time complexity: O(E * d) with E = number of edges, d = diameter of graph |
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathHopDistAsync(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Compute hop-distance from given vertex to every other vertex
Time complexity: O(E * d) with E = number of edges, d = diameter of graph |
<ID> AllPaths<ID> |
Analyst.shortestPathHopDistReverse(PgxGraph graph, ID srcId, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathHopDistReverse(PgxGraph, PgxVertex, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex. |
<ID> AllPaths<ID> |
Analyst.shortestPathHopDistReverse(PgxGraph graph, ID srcId, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathHopDistReverse(PgxGraph, PgxVertex, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex. |
<ID> AllPaths<ID> |
Analyst.shortestPathHopDistReverse(PgxGraph graph, ID srcId, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathHopDistReverse(PgxGraph, PgxVertex, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex. |
<ID> AllPaths<ID> |
Analyst.shortestPathHopDistReverse(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> AllPaths<ID> |
Analyst.shortestPathHopDistReverse(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> AllPaths<ID> |
Analyst.shortestPathHopDistReverse(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathHopDistReverseAsync(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Compute reverse hop-distance from given vertex to every other vertex
Time complexity: O(E * d) with E = number of edges, d = diameter of graph |
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathHopDistReverseAsync(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Compute reverse hop-distance from given vertex to every other vertex
Time complexity: O(E * d) with E = number of edges, d = diameter of graph |
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathHopDistReverseAsync(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Compute reverse hop-distance from given vertex to every other vertex
Time complexity: O(E * d) with E = number of edges, d = diameter of graph |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.vertexBetweennessCentrality(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc)
Blocking version of
#vertexBetweennessCentralityAsync(PgxGraph, VertexProperty<ID, Double>). |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.vertexBetweennessCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc)
Compute vertex betweenness centrality (without considering edge length).
|
<ID> Partition<ID> |
Analyst.wcc(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution)
Blocking version of
#wccAsync(PgxGraph, VertexProperty<ID, Long>). |
<ID> PgxFuture<Partition<ID>> |
Analyst.wccAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution)
Find weakly connected components through label propagation
Time complexity: O(E * D) with E = number of edges, D = diameter of the graph |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#weightedPagerankAsync(PgxGraph, boolean, EdgeProperty, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#weightedPagerankAsync(PgxGraph, double, double, int, boolean, EdgeProperty, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#weightedPagerankAsync(PgxGraph, double, double, int, EdgeProperty, VertexProperty<ID, Double>). |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#weightedPagerankAsync(PgxGraph, EdgeProperty, VertexProperty<ID, Double>). |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
|
| Modifier and Type | Method and Description |
|---|---|
BipartiteGraph |
PgxGraph.bipartiteSubGraphFromInDegree(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName)
Blocking version of
PgxGraph.bipartiteSubGraphFromInDegreeAsync(Collection, Collection, String). |
BipartiteGraph |
PgxGraph.bipartiteSubGraphFromInDegree(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName, java.lang.String isLeftPropName, boolean inPlace)
|
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromInDegreeAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName)
Create a bipartite version of this graph with all vertices of in-degree = 0 being the left set.
|
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromInDegreeAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName, java.lang.String isLeftPropName, boolean inPlace)
Create a bipartite version of this graph with all vertices of in-degree = 0 being the left set.
|
BipartiteGraph |
PgxGraph.bipartiteSubGraphFromLeftSet(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName)
|
BipartiteGraph |
PgxGraph.bipartiteSubGraphFromLeftSet(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName, java.lang.String isLeftPropName)
|
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromLeftSetAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName)
Create a bipartite version of this graph with the given vertex set being the left set.
|
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromLeftSetAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName, java.lang.String isLeftPropName)
Create a bipartite version of this graph with the given vertex set being the left set.
|
PgxGraph |
PgxGraph.clone(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName)
Blocking version of
PgxGraph.cloneAsync(). |
PgxFuture<PgxGraph> |
PgxGraph.cloneAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName)
Creates a copy of this graph.
|
<ID,V> VertexProperty<ID,PgxVect<V>> |
PgxGraph.combineVertexPropertiesIntoVectorProperty(java.util.List<VertexProperty<ID,V>> vertexPropertyList)
Blocking version of
PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List) Calls PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List) and waits for the returned PgxFuture to complete. |
<ID,V> VertexProperty<ID,PgxVect<V>> |
PgxGraph.combineVertexPropertiesIntoVectorProperty(java.util.List<VertexProperty<ID,V>> vertexPropertyList, java.lang.String name)
Blocking version of
PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List, String) Calls PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List, String) and waits for the returned PgxFuture to complete. |
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>> |
PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(java.util.List<VertexProperty<ID,V>> vertexPropertyList)
Takes a list of scalar vertex properties of same type and creates a new vertex vector property by combining them.
|
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>> |
PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(java.util.List<VertexProperty<ID,V>> vertexPropertyList, java.lang.String name)
Takes a list of scalar vertex properties of same type and creates a new vertex vector property by combining them.
|
B |
MutationStrategyBuilder.dropVertexProperties(java.util.Collection<VertexProperty<?,?>> vertexProperties)
Set vertex properties that will be dropped after the mutation.
|
PgxGraph |
PgxGraph.filter(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, GraphFilter graphFilter, java.lang.String newGraphName)
Blocking version of
PgxGraph.filterAsync(Collection, Collection, GraphFilter, String). |
PgxFuture<PgxGraph> |
PgxGraph.filterAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, GraphFilter graphFilter, java.lang.String newGraphName)
Create a subgraph of this graph.
|
PgxGraph |
PgxGraph.simplify(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, java.lang.String newGraphName)
|
PgxFuture<PgxGraph> |
PgxGraph.simplifyAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, java.lang.String newGraphName)
Create a simplified version of a graph.
|
PgxGraph |
PgxGraph.sortByDegree(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, PgxGraph.SortOrder sortOrder, PgxGraph.Degree degree, PgxGraph.Mode mode, java.lang.String newGraphName)
Blocking version of
PgxGraph.sortByDegreeAsync(Collection, Collection, SortOrder, Degree, Mode, String). |
PgxFuture<PgxGraph> |
PgxGraph.sortByDegreeAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, PgxGraph.SortOrder sortOrder, PgxGraph.Degree degree, PgxGraph.Mode mode, java.lang.String newGraphName)
Create a sorted version of a graph and all its properties.
|
PgxGraph |
PgxGraph.sparsify(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, double e, java.lang.String newGraphName)
Blocking version of
PgxGraph.sparsifyAsync(Collection, Collection, double, String). |
PgxFuture<PgxGraph> |
PgxGraph.sparsifyAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, double e, java.lang.String newGraphName)
Sparsifies the given graph and returns a new graph with less edges.
|
FileGraphConfig |
PgxGraph.store(Format targetFormat, java.lang.String targetPath, java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, boolean overwrite)
Blocking version of
PgxGraph.storeAsync(Format, String, Collection, Collection, boolean). |
PgxFuture<FileGraphConfig> |
PgxGraph.storeAsync(Format targetFormat, java.lang.String targetPath, java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, boolean overwrite)
Stores this graph in a given file format on a file system.
|
PgxGraph |
PgxGraph.transpose(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.util.Map<java.lang.String,java.lang.String> edgeLabelMapping, PgxGraph.Mode mode, java.lang.String newGraphName)
Blocking version of
PgxGraph.transposeAsync(Collection, Collection, Map, Mode, String) |
PgxFuture<PgxGraph> |
PgxGraph.transposeAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.util.Map<java.lang.String,java.lang.String> edgeLabelMapping, PgxGraph.Mode mode, java.lang.String newGraphName)
Creates a transpose of this graph.
|
PgxGraph |
PgxGraph.undirect(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, java.lang.String newGraphName)
Blocking version of
PgxGraph.undirectAsync(Collection, Collection, MultiEdges, SelfEdges, Mode, String). |
PgxFuture<PgxGraph> |
PgxGraph.undirectAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.Mode mode, java.lang.String newGraphName)
Convenience method to create for
PgxGraph.undirectAsync(MutationStrategy). |
Copyright © 2017 Oracle Corp. All Rights Reserved.