Uses of Class
oracle.pgx.api.EdgeProperty

Packages that use EdgeProperty

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

Uses of EdgeProperty in oracle.pgx.api

Subclasses of EdgeProperty in oracle.pgx.api

Modifier and Type	Class and Description
class	EdgeLabel

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

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

Methods in oracle.pgx.api that return EdgeProperty

Modifier and Type	Method and Description
<V> EdgeProperty<java.lang.Double>	Analyst.adamicAdarCounting(PgxGraph graph) Blocking version of Analyst.adamicAdarCountingAsync(PgxGraph).
<V> EdgeProperty<java.lang.Double>	Analyst.adamicAdarCounting(PgxGraph graph, EdgeProperty<java.lang.Double> aa) Blocking version of #adamicAdarCountingAsync(PgxGraph, EdgeProperty<Double>).
EdgeProperty<V>	EdgeProperty.clone() Blocking version of cloneAsync().
EdgeProperty<V>	EdgeProperty.clone(java.lang.String newPropertyName) Blocking version of cloneAsync(String).
<E> EdgeProperty<PgxVect<E>>	PgxGraph.combineEdgePropertiesIntoVectorProperty(java.util.List<EdgeProperty<E>> edgePropertyList) Blocking version of PgxGraph.combineEdgePropertiesIntoVectorPropertyAsync(List) Calls PgxGraph.combineEdgePropertiesIntoVectorPropertyAsync(List) and waits for the returned PgxFuture to complete.
<E> EdgeProperty<PgxVect<E>>	PgxGraph.combineEdgePropertiesIntoVectorProperty(java.util.List<EdgeProperty<E>> edgePropertyList, java.lang.String name) Blocking version of PgxGraph.combineEdgePropertiesIntoVectorPropertyAsync(List, String) Calls PgxGraph.combineEdgePropertiesIntoVectorPropertyAsync(List, String) and waits for the returned PgxFuture to complete.
<V> EdgeProperty<V>	PgxGraph.createEdgeProperty(PropertyType type) Blocking version of PgxGraph.createEdgePropertyAsync(PropertyType).
<V> EdgeProperty<V>	PgxGraph.createEdgeProperty(PropertyType type, int dimension, java.lang.String name, boolean hardName) Blocking version of PgxGraph.createEdgePropertyAsync(PropertyType, int, String, boolean).
<V> EdgeProperty<V>	PgxGraph.createEdgeProperty(PropertyType type, java.lang.String name) Blocking version of PgxGraph.createEdgePropertyAsync(PropertyType, String).
<V> EdgeProperty<PgxVect<V>>	PgxGraph.createEdgeVectorProperty(PropertyType type, int dimension) Blocking version of PgxGraph.createEdgeVectorPropertyAsync(PropertyType, int).
<V> EdgeProperty<PgxVect<V>>	PgxGraph.createEdgeVectorProperty(PropertyType type, int dimension, java.lang.String name) Blocking version of PgxGraph.createEdgeVectorPropertyAsync(PropertyType, int, String).
<V> EdgeProperty<V>	PgxGraph.getEdgeProperty(java.lang.String name) Blocking version of PgxGraph.getEdgePropertyAsync(String).
EdgeProperty<java.lang.Boolean>	Analyst.prim(PgxGraph graph, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.primAsync(PgxGraph, EdgeProperty).
EdgeProperty<java.lang.Boolean>	Analyst.prim(PgxGraph graph, EdgeProperty<java.lang.Double> weight, EdgeProperty<java.lang.Boolean> mst) Blocking version of Analyst.primAsync(PgxGraph, EdgeProperty, EdgeProperty).
EdgeProperty<java.lang.Boolean>	Analyst.prim(PgxGraph graph, EdgeProperty<java.lang.Double> weight, java.lang.String mstName) Blocking version of Analyst.primAsync(PgxGraph, EdgeProperty, String).

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

Modifier and Type	Method and Description
PgxFuture<EdgeProperty<java.lang.Double>>	Analyst.adamicAdarCountingAsync(PgxGraph graph) Computes 'Adamic-Adar measure' for each edge in the graph.
PgxFuture<EdgeProperty<java.lang.Double>>	Analyst.adamicAdarCountingAsync(PgxGraph graph, EdgeProperty<java.lang.Double> aa) Computes 'Adamic-Adar measure' for each edge in the graph.
PgxFuture<EdgeProperty<V>>	EdgeProperty.cloneAsync() Create a copy of this property. Convenience method for cloneAsync(String) passing newPropertyName as null
PgxFuture<EdgeProperty<V>>	EdgeProperty.cloneAsync(java.lang.String newPropertyName) Creates a copy of this property.
<E> PgxFuture<EdgeProperty<PgxVect<E>>>	PgxGraph.combineEdgePropertiesIntoVectorPropertyAsync(java.util.List<EdgeProperty<E>> edgePropertyList) Takes a list of scalar edge properties of same type and creates a new edge vector property by combining them.
<E> PgxFuture<EdgeProperty<PgxVect<E>>>	PgxGraph.combineEdgePropertiesIntoVectorPropertyAsync(java.util.List<EdgeProperty<E>> edgePropertyList, java.lang.String name) Takes a list of scalar edge properties of same type and creates a new edge vector property by combining them.
<V> PgxFuture<EdgeProperty<V>>	PgxGraph.createEdgePropertyAsync(PropertyType type) Creates a session-bound edge property
<V> PgxFuture<EdgeProperty<V>>	PgxGraph.createEdgePropertyAsync(PropertyType type, java.lang.String name) Creates a session-bound edge property
<V> PgxFuture<EdgeProperty<PgxVect<V>>>	PgxGraph.createEdgeVectorPropertyAsync(PropertyType type, int dimension) Creates a session-bound edge vector property
<V> PgxFuture<EdgeProperty<PgxVect<V>>>	PgxGraph.createEdgeVectorPropertyAsync(PropertyType type, int dimension, java.lang.String name) Creates a session-bound edge vector property
<S> java.util.List<EdgeProperty<S>>	EdgeProperty.expand() Blocking version of expandAsync().
<S> java.util.List<EdgeProperty<S>>	EdgeProperty.expand(java.lang.String namePrefix) Blocking version of expandAsync(String).
<S> PgxFuture<java.util.List<EdgeProperty<S>>>	EdgeProperty.expandAsync() If this is a vector property, expands this property into a list of scalar properties of same type.
<S> PgxFuture<java.util.List<EdgeProperty<S>>>	EdgeProperty.expandAsync(java.lang.String namePrefix) If this is a vector property, expands this property into a list of scalar properties of same type.
java.util.Set<EdgeProperty<?>>	PgxGraph.getEdgeProperties() Blocking version of PgxGraph.getEdgePropertiesAsync().
PgxFuture<java.util.Set<EdgeProperty<?>>>	PgxGraph.getEdgePropertiesAsync() Get the set of edge properties belonging to this graph.
<V> PgxFuture<EdgeProperty<V>>	PgxGraph.getEdgePropertyAsync(java.lang.String name) Gets an edge property of this graph
PgxFuture<EdgeProperty<java.lang.Boolean>>	Analyst.primAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight) Computes the minimum spanning tree of a graph.
PgxFuture<EdgeProperty<java.lang.Boolean>>	Analyst.primAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight, EdgeProperty<java.lang.Boolean> mst) Computes the minimum spanning tree of a graph.

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

Modifier and Type	Method and Description
<V> EdgeProperty<java.lang.Double>	Analyst.adamicAdarCounting(PgxGraph graph, EdgeProperty<java.lang.Double> aa) Blocking version of #adamicAdarCountingAsync(PgxGraph, EdgeProperty<Double>).
PgxFuture<EdgeProperty<java.lang.Double>>	Analyst.adamicAdarCountingAsync(PgxGraph graph, EdgeProperty<java.lang.Double> aa) Computes 'Adamic-Adar measure' for each edge in the graph.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.closenessCentralityDoubleLength(PgxGraph graph, EdgeProperty<java.lang.Double> cost) Blocking version of Analyst.closenessCentralityDoubleLengthAsync(PgxGraph, EdgeProperty).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.closenessCentralityDoubleLength(PgxGraph graph, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> cc) Blocking version of #closenessCentralityDoubleLengthAsync(PgxGraph, EdgeProperty, VertexProperty<ID, Double>).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<java.lang.Double> cost) Compute closeness centrality.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> cc) Compute closeness centrality.
<ID extends java.lang.Comparable<ID>> AllPaths<ID>	PgxGraph.createAllPaths(PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> dist, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Blocking version of PgxGraph.createAllPathsAsync(PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty).
<ID> PgxFuture<AllPaths<ID>>	PgxGraph.createAllPathsAsync(PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> dist, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Creates a AllPaths object representing all the shortest paths from a single source to all the possible destinations (shortest regarding the given edge costs).
<ID> PgxPath<ID>	PgxGraph.createPath(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Blocking version of PgxGraph.createPathAsync(PgxVertex, PgxVertex, EdgeProperty, VertexProperty, VertexProperty).
<ID> PgxFuture<PgxPath<ID>>	PgxGraph.createPathAsync(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Creates a PgxPath object representing the shortest path from one source to one destination (shortest regarding the given edge costs).
B	MutationStrategyBuilder.dropEdgeProperty(EdgeProperty<?> edgeProperty) Set edge property that will be dropped after the mutation.
<ID> AllPaths<ID>	Analyst.fattestPath(PgxGraph graph, ID rootId, EdgeProperty<java.lang.Double> capacity) Convenience wrapper around Analyst.fattestPath(PgxGraph, PgxVertex, EdgeProperty) taking a vertex ID instead of a PgxVertex.
<ID> AllPaths<ID>	Analyst.fattestPath(PgxGraph graph, ID rootId, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.fattestPath(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of a PgxVertex.
<ID> AllPaths<ID>	Analyst.fattestPath(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity) Blocking version of Analyst.fattestPathAsync(PgxGraph, PgxVertex, EdgeProperty).
<ID> AllPaths<ID>	Analyst.fattestPath(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Blocking version of Analyst.fattestPathAsync(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty).
<ID> PgxFuture<AllPaths<ID>>	Analyst.fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity) Fattest Tree Algorithm - Computes the fattest path from a source vertex to all vertices in the graph.
<ID> PgxFuture<AllPaths<ID>>	Analyst.fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Fattest Tree Algorithm - Computes the fattest path from a source vertex to all vertices in the graph.
<ID> MatrixFactorizationModel<ID>	Analyst.matrixFactorizationGradientDescent(BipartiteGraph graph, EdgeProperty<java.lang.Double> weightProperty) Blocking version of Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph, EdgeProperty).
<ID> MatrixFactorizationModel<ID>	Analyst.matrixFactorizationGradientDescent(BipartiteGraph graph, EdgeProperty<java.lang.Double> weightProperty, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength) Blocking version of Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph, EdgeProperty, double, double, double, int, int).
<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) Performs the training step of generating recommendations using matrix factorization.
<ID> PgxFuture<MatrixFactorizationModel<ID>>	Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weightProperty, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength) Performs the training step of generating recommendations using matrix factorization.
<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.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, boolean norm, EdgeProperty<java.lang.Double> weight) Convenience wrapper around Analyst.personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, boolean, EdgeProperty) taking a vertex ID instead of a PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Convenience wrapper around #personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, boolean, EdgeProperty, VertexProperty<ID, Double>) taking a vertex ID instead of a PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, EdgeProperty<java.lang.Double> weight) Convenience wrapper around Analyst.personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, EdgeProperty) taking a vertex ID instead of a PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, ID vertexId, java.math.BigDecimal e, java.math.BigDecimal d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Convenience wrapper around #personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, EdgeProperty, VertexProperty<ID, Double>) taking a vertex ID instead of a PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, boolean, EdgeProperty).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Blocking version of #personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, boolean, EdgeProperty,VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, double, double, int, boolean, EdgeProperty).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Blocking version of #personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, double, double, int, boolean, EdgeProperty, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, double, double, int, EdgeProperty).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Blocking version of #personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, double, double, int, EdgeProperty, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, EdgeProperty) }.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Blocking version of #personalizedWeightedPagerankAsync(PgxGraph, PgxVertex, EdgeProperty, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.personalizedWeightedPagerankAsync(PgxGraph, VertexSet, boolean, EdgeProperty).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Blocking version of #personalizedWeightedPagerankAsync(PgxGraph, VertexSet, boolean, EdgeProperty,VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.personalizedWeightedPagerankAsync(PgxGraph, VertexSet, double, double, int, boolean, EdgeProperty).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Blocking version of #personalizedWeightedPagerankAsync(PgxGraph, VertexSet, double, double, int, boolean, EdgeProperty, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.personalizedWeightedPagerankAsync(PgxGraph, VertexSet, double, double, int, EdgeProperty).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Blocking version of #personalizedWeightedPagerankAsync(PgxGraph, VertexSet, double, double, int, EdgeProperty, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.personalizedWeightedPagerankAsync(PgxGraph, VertexSet, EdgeProperty).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Blocking version of #personalizedWeightedPagerankAsync(PgxGraph, VertexSet, EdgeProperty,VertexProperty<ID, Double>).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
EdgeProperty<java.lang.Boolean>	Analyst.prim(PgxGraph graph, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.primAsync(PgxGraph, EdgeProperty).
EdgeProperty<java.lang.Boolean>	Analyst.prim(PgxGraph graph, EdgeProperty<java.lang.Double> weight, EdgeProperty<java.lang.Boolean> mst) Blocking version of Analyst.primAsync(PgxGraph, EdgeProperty, EdgeProperty).
EdgeProperty<java.lang.Boolean>	Analyst.prim(PgxGraph graph, EdgeProperty<java.lang.Double> weight, EdgeProperty<java.lang.Boolean> mst) Blocking version of Analyst.primAsync(PgxGraph, EdgeProperty, EdgeProperty).
EdgeProperty<java.lang.Boolean>	Analyst.prim(PgxGraph graph, EdgeProperty<java.lang.Double> weight, java.lang.String mstName) Blocking version of Analyst.primAsync(PgxGraph, EdgeProperty, String).
PgxFuture<EdgeProperty<java.lang.Boolean>>	Analyst.primAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight) Computes the minimum spanning tree of a graph.
PgxFuture<EdgeProperty<java.lang.Boolean>>	Analyst.primAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight, EdgeProperty<java.lang.Boolean> mst) Computes the minimum spanning tree of a graph.
PgxFuture<EdgeProperty<java.lang.Boolean>>	Analyst.primAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight, EdgeProperty<java.lang.Boolean> mst) Computes the minimum spanning tree of a graph.
PickingStrategyBuilder	PickingStrategyBuilder.setPickByProperty(EdgeProperty edgeProperty, oracle.pgx.common.mutations.PickingStrategyFunction pickingStrategyFunction) If there are multiple edges between two vertices, the edge that satisfies the PickingStrategyFunction will be picked.
MergingStrategyBuilder	MergingStrategyBuilder.setPropertyMergingStrategy(EdgeProperty edgeProperty, oracle.pgx.common.mutations.MergingFunction mergingFunction) Define a merging function for the given edge property.
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFord(PgxGraph graph, ID srcId, EdgeProperty<java.lang.Double> cost) Convenience wrapper around Analyst.shortestPathBellmanFord(PgxGraph, PgxVertex, EdgeProperty) taking a vertex ID instead of PgxVertex.
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFord(PgxGraph graph, ID srcId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathBellmanFord(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex.
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFord(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost) Blocking version of Analyst.shortestPathBellmanFordAsync(PgxGraph, PgxVertex, EdgeProperty).
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFord(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Blocking version of Analyst.shortestPathBellmanFordAsync(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty).
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost) Compute single source shortest paths using Bellman & Ford algorithm Time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Compute single source shortest paths using Bellman & Ford algorithm Time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFordReverse(PgxGraph graph, ID srcId, EdgeProperty<java.lang.Double> cost) Convenience wrapper around Analyst.shortestPathBellmanFordReverse(PgxGraph, PgxVertex, EdgeProperty) taking a vertex ID instead of PgxVertex.
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFordReverse(PgxGraph graph, ID srcId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathBellmanFordReverse(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty) taking a vertex ID instead of PgxVertex.
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFordReverse(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost) Blocking version of Analyst.shortestPathBellmanFordReverseAsync(PgxGraph, PgxVertex, EdgeProperty).
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFordReverse(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Blocking version of Analyst.shortestPathBellmanFordReverseAsync(PgxGraph, PgxVertex, EdgeProperty, VertexProperty, VertexProperty, VertexProperty).
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost) Compute reverse single source shortest paths using Bellman & Ford algorithm Time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Compute reverse single source shortest paths using Bellman & Ford algorithm Time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length
<ID> PgxPath<ID>	Analyst.shortestPathDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost) Convenience wrapper around Analyst.shortestPathDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty) taking vertex IDs instead of PgxVertex.
<ID> PgxPath<ID>	Analyst.shortestPathDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty) taking vertex IDs instead of PgxVertex.
<ID> PgxPath<ID>	Analyst.shortestPathDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost) Blocking version of Analyst.shortestPathDijkstraAsync(PgxGraph, PgxVertex, PgxVertex, EdgeProperty).
<ID> PgxPath<ID>	Analyst.shortestPathDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Blocking version of Analyst.shortestPathDijkstraAsync(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, VertexProperty, VertexProperty).
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost) Compute shortest path using Dijkstra's algorithm.
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Compute shortest path using Dijkstra's algorithm.
<ID> PgxPath<ID>	Analyst.shortestPathDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost) Convenience wrapper around Analyst.shortestPathDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty) taking vertex IDs instead of PgxVertex.
<ID> PgxPath<ID>	Analyst.shortestPathDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty) taking vertex IDs instead of PgxVertex.
<ID> PgxPath<ID>	Analyst.shortestPathDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost) Blocking version of Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph, PgxVertex, PgxVertex, EdgeProperty).
<ID> PgxPath<ID>	Analyst.shortestPathDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Blocking version of Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, VertexProperty, VertexProperty).
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost) Compute shortest path using a bi-directional Dijkstra variant.
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, java.lang.String parentName, java.lang.String parentEdgeName)
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Compute shortest path using a bi-directional Dijkstra variant.
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr) Convenience wrapper around Analyst.shortestPathFilteredDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter) taking vertex IDs instead of PgxVertex.
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathFilteredDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter) taking vertex IDs instead of PgxVertex.
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr) Blocking version of Analyst.shortestPathFilteredDijkstraAsync(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter).
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Blocking version of Analyst.shortestPathFilteredDijkstraAsync(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter, VertexProperty, VertexProperty).
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr) Compute shortest path using Dijkstra's algorithm on a filtered graph The filter specified by the given filter expression is applied on each edge during traversal of the graph.
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Compute shortest path using Dijkstra's algorithm on a filtered graph The filter specified by the given filter expression is applied on each edge during traversal of the graph.
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr) Convenience wrapper around Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter) taking vertex IDs instead of PgxVertex.
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Convenience wrapper around Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter) taking vertex IDs instead of PgxVertex.
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr) Blocking version of Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter).
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Blocking version of Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter, VertexProperty, VertexProperty).
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr) Compute shortest path using a bi-directional Dijkstra variant on a filtered graph.
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, java.lang.String parentName, java.lang.String parentEdgeName)
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Compute shortest path using a bi-directional Dijkstra variant on a filtered graph.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.weightedPagerankAsync(PgxGraph, boolean, EdgeProperty).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Blocking version of #weightedPagerankAsync(PgxGraph, boolean, EdgeProperty, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.weightedPagerankAsync(PgxGraph, double, double, int, boolean, EdgeProperty).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Blocking version of #weightedPagerankAsync(PgxGraph, double, double, int, boolean, EdgeProperty, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.weightedPagerankAsync(PgxGraph, double, double, int, EdgeProperty).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Blocking version of #weightedPagerankAsync(PgxGraph, double, double, int, EdgeProperty, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, EdgeProperty<java.lang.Double> weight) Blocking version of Analyst.weightedPagerankAsync(PgxGraph, EdgeProperty).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Blocking version of #weightedPagerankAsync(PgxGraph, EdgeProperty, VertexProperty<ID, Double>).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight) Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight) Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight) Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight) Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.

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

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