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	Description
class	EdgeLabel

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

Modifier and Type	Field	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	Description
<V> EdgeProperty<java.lang.Double>	Analyst.adamicAdarCounting(PgxGraph graph)	The adamic-adar index compares the amount of neighbors shared between vertices, this measure can be used with communities.
<V> EdgeProperty<java.lang.Double>	Analyst.adamicAdarCounting(PgxGraph graph, EdgeProperty<java.lang.Double> aa)	The adamic-adar index compares the amount of neighbors shared between vertices, this measure can be used with communities.
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).
<V> EdgeProperty<V>	PgxGraph.getEdgeProperty(Namespace namespace, java.lang.String name)	Blocking version of PgxGraph.getEdgePropertyAsync(Namespace, String).
<V> EdgeProperty<V>	PgxGraph.getOrCreateEdgeProperty(PropertyType type, java.lang.String name)	Blocking version of PgxGraph.getOrCreateEdgePropertyAsync(PropertyType, String).
<V> EdgeProperty<PgxVect<V>>	PgxGraph.getOrCreateEdgeVectorProperty(PropertyType type, int dimension, java.lang.String name)	Blocking version of PgxGraph.getOrCreateEdgeVectorPropertyAsync(PropertyType, int, String).
EdgeProperty<java.lang.Boolean>	Analyst.prim(PgxGraph graph, EdgeProperty<java.lang.Double> weight)	prim reveals tree structures with shortest paths in a graph
EdgeProperty<java.lang.Boolean>	Analyst.prim(PgxGraph graph, EdgeProperty<java.lang.Double> weight, java.lang.String mstName)	Convenience wrapper around Analyst.prim(PgxGraph, EdgeProperty, String)
EdgeProperty<java.lang.Boolean>	Analyst.prim(PgxGraph graph, EdgeProperty<java.lang.Double> weight, EdgeProperty<java.lang.Boolean> mst)	prim reveals tree structures with shortest paths in a graph

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

Modifier and Type	Method	Description
PgxFuture<EdgeProperty<java.lang.Double>>	Analyst.adamicAdarCountingAsync(PgxGraph graph)	The adamic-adar index compares the amount of neighbors shared between vertices, this measure can be used with communities.
PgxFuture<EdgeProperty<java.lang.Double>>	Analyst.adamicAdarCountingAsync(PgxGraph graph, EdgeProperty<java.lang.Double> aa)	The adamic-adar index compares the amount of neighbors shared between vertices, this measure can be used with communities.
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
<V> PgxFuture<EdgeProperty<V>>	PgxGraph.getEdgePropertyAsync(Namespace namespace, java.lang.String name)	Gets an edge property of this graph in the given namespace.
<V> PgxFuture<EdgeProperty<V>>	PgxGraph.getOrCreateEdgePropertyAsync(PropertyType type, java.lang.String name)	Gets or creates an edge property
<V> PgxFuture<EdgeProperty<PgxVect<V>>>	PgxGraph.getOrCreateEdgeVectorPropertyAsync(PropertyType type, int dimension, java.lang.String name)	Gets or creates an edge vector property
<V> PgxFuture<EdgeProperty<PgxVect<V>>>	PgxGraph.getOrCreateEdgeVertexPropertyAsync(PropertyType type, int dimension, java.lang.String name)	Gets or creates an edge vector property
PgxFuture<EdgeProperty<java.lang.Boolean>>	Analyst.primAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight)	prim reveals tree structures with shortest paths in a graph
PgxFuture<EdgeProperty<java.lang.Boolean>>	Analyst.primAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight, EdgeProperty<java.lang.Boolean> mst)	prim reveals tree structures with shortest paths in a graph

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

Modifier and Type	Method	Description
<V> EdgeProperty<java.lang.Double>	Analyst.adamicAdarCounting(PgxGraph graph, EdgeProperty<java.lang.Double> aa)	The adamic-adar index compares the amount of neighbors shared between vertices, this measure can be used with communities.
PgxFuture<EdgeProperty<java.lang.Double>>	Analyst.adamicAdarCountingAsync(PgxGraph graph, EdgeProperty<java.lang.Double> aa)	The adamic-adar index compares the amount of neighbors shared between vertices, this measure can be used with communities.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.closenessCentralityDoubleLength(PgxGraph graph, EdgeProperty<java.lang.Double> cost)	Closeness centrality measures the centrality of the vertices based on weighted distances, allowing to find well-connected vertices
<ID> VertexProperty<ID,java.lang.Double>	Analyst.closenessCentralityDoubleLength(PgxGraph graph, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> cc)	Closeness centrality measures the centrality of the vertices based on weighted distances, allowing to find well-connected vertices
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<java.lang.Double> cost)	Closeness centrality measures the centrality of the vertices based on weighted distances, allowing to find well-connected vertices
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> cc)	Closeness centrality measures the centrality of the vertices based on weighted distances, allowing to find well-connected vertices
<ID> Partition<ID>	Analyst.communitiesInfomap(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank, EdgeProperty<java.lang.Double> weight)	Infomap can find high quality communities in a graph.
<ID> Partition<ID>	Analyst.communitiesInfomap(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank, EdgeProperty<java.lang.Double> weight, double tau, double tol, int maxIter)	Infomap can find high quality communities in a graph.
<ID> Partition<ID>	Analyst.communitiesInfomap(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank, EdgeProperty<java.lang.Double> weight, double tau, double tol, int maxIter, VertexProperty<ID,java.lang.Long> module)	Infomap can find high quality communities in a graph.
<ID> Partition<ID>	Analyst.communitiesInfomap(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Long> module)	Infomap can find high quality communities in a graph.
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesInfomapAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank, EdgeProperty<java.lang.Double> weight)	Infomap can find high quality communities in a graph.
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesInfomapAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank, EdgeProperty<java.lang.Double> weight, double tau, double tol, int maxIter)	Infomap can find high quality communities in a graph.
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesInfomapAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank, EdgeProperty<java.lang.Double> weight, double tau, double tol, int maxIter, VertexProperty<ID,java.lang.Long> module)	Infomap can find high quality communities in a graph.
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesInfomapAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Long> module)	Infomap can find high quality communities in a graph.
<ID> 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)	Fattest path is a fast algorithm for finding a shortest path adding constraints for flowing related matters
<ID> AllPaths<ID>	Analyst.fattestPath(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, boolean ignoreEdgeDirection)	Undirected Fattest path is variation of the fattest graph algorithm that ignores edge directions.
<ID> AllPaths<ID>	Analyst.fattestPath(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)	Fattest path is a fast algorithm for finding a shortest path adding constraints for flowing related matters
<ID> AllPaths<ID>	Analyst.fattestPath(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge, boolean ignoreEdgeDirection)	Undirected Fattest path is variation of the fattest graph algorithm that ignores edge directions.
<ID> PgxFuture<AllPaths<ID>>	Analyst.fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity)	Fattest path is a fast algorithm for finding a shortest path adding constraints for flowing related matters
<ID> PgxFuture<AllPaths<ID>>	Analyst.fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, boolean ignoreEdgeDirection)	Undirected Fattest path is variation of the fattest graph algorithm that ignores edge directions.
<ID> PgxFuture<AllPaths<ID>>	Analyst.fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)	Fattest path is a fast algorithm for finding a shortest path adding constraints for flowing related matters
<ID> PgxFuture<AllPaths<ID>>	Analyst.fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge, boolean ignoreEdgeDirection)	Undirected Fattest path is variation of the fattest graph algorithm that ignores edge directions.
<ID> VertexProperty<ID,java.lang.String>	Analyst.filteredWeightedSpeakerListenerLabelPropagation(PgxGraph graph, java.lang.String labelsPropName, int maxIter, double threshold, java.lang.String delimiter, EdgeProperty<java.lang.Double> weight, EdgeFilter filter)	Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
<ID> VertexProperty<ID,java.lang.String>	Analyst.filteredWeightedSpeakerListenerLabelPropagation(PgxGraph graph, java.lang.String labelsPropName, EdgeProperty<java.lang.Double> weight, EdgeFilter filter)	Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
<ID> VertexProperty<ID,java.lang.String>	Analyst.filteredWeightedSpeakerListenerLabelPropagation(PgxGraph graph, VertexProperty<ID,java.lang.String> labels, int maxIter, double threshold, java.lang.String delimiter, EdgeProperty<java.lang.Double> weight, EdgeFilter filter)	Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
<ID> PgxFuture<VertexProperty<ID,java.lang.String>>	Analyst.filteredWeightedSpeakerListenerLabelPropagationAsync(PgxGraph graph, java.lang.String labelsPropName, int maxIter, double threshold, java.lang.String delimiter, EdgeProperty<java.lang.Double> weight, EdgeFilter filter)	Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
<ID> PgxFuture<VertexProperty<ID,java.lang.String>>	Analyst.filteredWeightedSpeakerListenerLabelPropagationAsync(PgxGraph graph, java.lang.String labelsPropName, EdgeProperty<java.lang.Double> weight, EdgeFilter filter)	Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
<ID> PgxFuture<VertexProperty<ID,java.lang.String>>	Analyst.filteredWeightedSpeakerListenerLabelPropagationAsync(PgxGraph graph, VertexProperty<ID,java.lang.String> labels, int maxIter, double threshold, java.lang.String delimiter, EdgeProperty<java.lang.Double> weight, EdgeFilter filter)	Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
<ID> VertexProperty<ID,java.lang.Long>	Analyst.louvain(PgxGraph graph, EdgeProperty<java.lang.Double> weight)	Louvain can detect communities in a large graph relatively fast.
<ID> VertexProperty<ID,java.lang.Long>	Analyst.louvain(PgxGraph graph, EdgeProperty<java.lang.Double> weight, int maxIter)	Louvain can detect communities in a large graph relatively fast.
<ID> VertexProperty<ID,java.lang.Long>	Analyst.louvain(PgxGraph graph, EdgeProperty<java.lang.Double> weight, int maxIter, int nbrPass, double tol, VertexProperty<ID,java.lang.Long> community)	Louvain can detect communities in a large graph relatively fast.
<ID> PgxFuture<VertexProperty<ID,java.lang.Long>>	Analyst.louvainAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight)	Louvain can detect communities in a large graph relatively fast.
<ID> PgxFuture<VertexProperty<ID,java.lang.Long>>	Analyst.louvainAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight, int maxIter)	Louvain can detect communities in a large graph relatively fast.
<ID> PgxFuture<VertexProperty<ID,java.lang.Long>>	Analyst.louvainAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight, int maxIter, int nbrPass, double tol, VertexProperty<ID,java.lang.Long> community)	Louvain can detect communities in a large graph relatively fast.
<ID> MatrixFactorizationModel<ID>	Analyst.matrixFactorizationGradientDescent(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight)	Matrix factorization can be used as a recommendation algorithm for bipartite graphs
<ID> MatrixFactorizationModel<ID>	Analyst.matrixFactorizationGradientDescent(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength)	Matrix factorization can be used as a recommendation algorithm for bipartite graphs
<ID> MatrixFactorizationModel<ID>	Analyst.matrixFactorizationGradientDescent(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength, VertexProperty<ID,PgxVect<java.lang.Double>> features)	Matrix factorization can be used as a recommendation algorithm for bipartite graphs
<ID> MatrixFactorizationModel<ID>	Analyst.matrixFactorizationGradientDescent(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,PgxVect<java.lang.Double>> features)	Matrix factorization can be used as a recommendation algorithm for bipartite graphs
<ID> PgxFuture<MatrixFactorizationModel<ID>>	Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight)	Matrix factorization can be used as a recommendation algorithm for bipartite graphs
<ID> PgxFuture<MatrixFactorizationModel<ID>>	Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength)	Matrix factorization can be used as a recommendation algorithm for bipartite graphs
<ID> PgxFuture<MatrixFactorizationModel<ID>>	Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength, VertexProperty<ID,PgxVect<java.lang.Double>> features)	Matrix factorization can be used as a recommendation algorithm for bipartite graphs
<ID> PgxFuture<MatrixFactorizationModel<ID>>	Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,PgxVect<java.lang.Double>> features)	Matrix factorization can be used as a recommendation algorithm for bipartite graphs
<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)	Personalized weighted pagerank for a vertex and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	Personalized weighted pagerank for a vertex and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight)	Personalized weighted pagerank for a vertex and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	Personalized weighted pagerank for a vertex and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight)	Personalized weighted pagerank for a vertex and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	Personalized weighted pagerank for a vertex and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight)	Personalized weighted pagerank for a vertex and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	Personalized weighted pagerank for a vertex and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight)	Personalized pagerank for a set of vertices and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	Personalized pagerank for a set of vertices and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight)	Personalized pagerank for a set of vertices and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	Personalized pagerank for a set of vertices and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight)	Personalized pagerank for a set of vertices and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	Personalized pagerank for a set of vertices and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight)	Personalized pagerank for a set of vertices and weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	Personalized pagerank for a set of vertices and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight)	Personalized weighted pagerank for a vertex and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	Personalized weighted pagerank for a vertex and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight)	Personalized weighted pagerank for a vertex and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	Personalized weighted pagerank for a vertex and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight)	Personalized weighted pagerank for a vertex and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	Personalized weighted pagerank for a vertex and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight)	Personalized weighted pagerank for a vertex and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	Personalized weighted pagerank for a vertex and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight)	Personalized pagerank for a set of vertices and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	Personalized pagerank for a set of vertices and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight)	Personalized pagerank for a set of vertices and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	Personalized pagerank for a set of vertices and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight)	Personalized pagerank for a set of vertices and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	Personalized pagerank for a set of vertices and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight)	Personalized pagerank for a set of vertices and weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	Personalized pagerank for a set of vertices and weighted edges.
EdgeProperty<java.lang.Boolean>	Analyst.prim(PgxGraph graph, EdgeProperty<java.lang.Double> weight)	prim reveals tree structures with shortest paths in a graph
EdgeProperty<java.lang.Boolean>	Analyst.prim(PgxGraph graph, EdgeProperty<java.lang.Double> weight, java.lang.String mstName)	Convenience wrapper around Analyst.prim(PgxGraph, EdgeProperty, String)
EdgeProperty<java.lang.Boolean>	Analyst.prim(PgxGraph graph, EdgeProperty<java.lang.Double> weight, EdgeProperty<java.lang.Boolean> mst)	prim reveals tree structures with shortest paths in a graph
PgxFuture<EdgeProperty<java.lang.Boolean>>	Analyst.primAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight)	prim reveals tree structures with shortest paths in a graph
PgxFuture<EdgeProperty<java.lang.Boolean>>	Analyst.primAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight, EdgeProperty<java.lang.Boolean> mst)	prim reveals tree structures with shortest paths in a graph
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)	Bellman-ford finds multiple shortest paths at the same time
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFord(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, boolean ignoreEdgeDirection)	Bellman-ford finds multiple shortest paths at the same time
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFord(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)	Bellman-ford finds multiple shortest paths at the same time
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFord(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge, boolean ignoreEdgeDirection)	Bellman-ford finds multiple shortest paths at the same time
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost)	Bellman-ford finds multiple shortest paths at the same time
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, boolean ignoreEdgeDirection)	Bellman-ford finds multiple shortest paths at the same time
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)	Bellman-ford finds multiple shortest paths at the same time
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge, boolean ignoreEdgeDirection)	Bellman-ford finds multiple shortest paths at the same time
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFordReverse(PgxGraph graph, ID srcId, EdgeProperty<java.lang.Double> cost)	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)	Reversed bellman-ford finds multiple shortest paths at the same time
<ID> AllPaths<ID>	Analyst.shortestPathBellmanFordReverse(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)	Reversed bellman-ford finds multiple shortest paths at the same time
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost)	Reversed bellman-ford finds multiple shortest paths at the same time
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)	Reversed bellman-ford finds multiple shortest paths at the same time
<ID> PgxPath<ID>	Analyst.shortestPathDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost)	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)	Dijkstra is a fast algorithm for finding a shortest path in a graph
<ID> PgxPath<ID>	Analyst.shortestPathDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, boolean ignoreEdgeDirection)	Undirected Dijkstra's algorithm is a variant of Dijkstra's algorithm that ignores edge directions.
<ID> PgxPath<ID>	Analyst.shortestPathDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)	Dijkstra is a fast algorithm for finding a shortest path in a graph
<ID> PgxPath<ID>	Analyst.shortestPathDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge, boolean ignoreEdgeDirection)	Undirected Dijkstra's algorithm is a variant of Dijkstra's algorithm that ignores edge directions.
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost)	Dijkstra is a fast algorithm for finding a shortest path in a graph
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, boolean ignoreEdgeDirection)	Undirected Dijkstra's algorithm is a variant of Dijkstra's algorithm that ignores edge directions.
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)	Dijkstra is a fast algorithm for finding a shortest path in a graph
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge, boolean ignoreEdgeDirection)	Undirected Dijkstra's algorithm is a variant of Dijkstra's algorithm that ignores edge directions.
<ID> PgxPath<ID>	Analyst.shortestPathDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost)	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)	Bidirectional dijkstra is a fast algorithm for finding a shortest path in a graph
<ID> PgxPath<ID>	Analyst.shortestPathDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, boolean ignoreEdgeDirection)	Undirected bidirectional dijkstra is a variant of bidirectional dijkstra that ignores edge directions
<ID> PgxPath<ID>	Analyst.shortestPathDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)	Bidirectional dijkstra is a fast algorithm for finding a shortest path in a graph
<ID> PgxPath<ID>	Analyst.shortestPathDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge, boolean ignoreEdgeDirection)	Undirected bidirectional dijkstra is a variant of bidirectional dijkstra that ignores edge directions
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost)	Bidirectional dijkstra is a fast algorithm for finding a shortest path in a graph
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, boolean ignoreEdgeDirection)	Undirected bidirectional dijkstra is a variant of bidirectional dijkstra that ignores edge directions
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, java.lang.String parentName, java.lang.String parentEdgeName)
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, java.lang.String parentName, java.lang.String parentEdgeName, boolean ignoreEdgeDirection)
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)	Bidirectional dijkstra is a fast algorithm for finding a shortest path in a graph
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge, boolean ignoreEdgeDirection)	Undirected bidirectional dijkstra is a variant of bidirectional dijkstra that ignores edge directions
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr)	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)	Filtered Dijkstra is a fast algorithm for finding a shortest path while also filtering edges
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, boolean ignoreEdgeDirection)	Undirected filtered djkstra is variation of the filtered djkstra's algorithm that ignores edge directions.
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)	Filtered Dijkstra is a fast algorithm for finding a shortest path while also filtering edges
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge, boolean ignoreEdgeDirection)	Undirected filtered djkstra is variation of the filtered djkstra's algorithm that ignores edge directions.
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr)	Filtered Dijkstra is a fast algorithm for finding a shortest path while also filtering edges
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, boolean ignoreEdgeDirection)	Undirected filtered djkstra is variation of the filtered djkstra's algorithm that ignores edge directions.
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)	Filtered Dijkstra is a fast algorithm for finding a shortest path while also filtering edges
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge, boolean ignoreEdgeDirection)	Undirected filtered djkstra is variation of the filtered djkstra's algorithm that ignores edge directions.
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr)	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)	Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, boolean ignoreEdgeDirection)	Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)	Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
<ID> PgxPath<ID>	Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge, boolean ignoreEdgeDirection)	Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr)	Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, boolean ignoreEdgeDirection)	Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, java.lang.String parentName, java.lang.String parentEdgeName)
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, java.lang.String parentName, java.lang.String parentEdgeName, boolean ignoreEdgeDirection)
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)	Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge, boolean ignoreEdgeDirection)	Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
<ID> AllPaths<ID>	Analyst.shortestPathMultiDestinationDijkstra(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost)	Dijkstra is a fast algorithm for finding a shortest path in a graph and goes to all destinations.
<ID> AllPaths<ID>	Analyst.shortestPathMultiDestinationDijkstra(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)	Dijkstra is a fast algorithm for finding a shortest path in a graph and goes to all destinations.
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathMultiDestinationDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost)	Dijkstra is a fast algorithm for finding a shortest path in a graph and goes to all destinations.
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathMultiDestinationDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)	Dijkstra is a fast algorithm for finding a shortest path in a graph and goes to all destinations.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight)	PageRank on weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	PageRank on weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight)	PageRank on weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	PageRank on weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight)	PageRank on weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	PageRank on weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, EdgeProperty<java.lang.Double> weight)	PageRank on weighted edges.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.weightedPagerank(PgxGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	PageRank on weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight)	PageRank on weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	PageRank on weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight)	PageRank on weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	PageRank on weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight)	PageRank on weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	PageRank on weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight)	PageRank on weighted edges.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)	PageRank on weighted edges.
<ID> VertexProperty<ID,java.lang.String>	Analyst.weightedSpeakerListenerLabelPropagation(PgxGraph graph, java.lang.String labelsPropName, int maxIter, double threshold, java.lang.String delimiter, EdgeProperty<java.lang.Double> weight)	Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
<ID> VertexProperty<ID,java.lang.String>	Analyst.weightedSpeakerListenerLabelPropagation(PgxGraph graph, java.lang.String labelsPropName, EdgeProperty<java.lang.Double> weight)	Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
<ID> VertexProperty<ID,java.lang.String>	Analyst.weightedSpeakerListenerLabelPropagation(PgxGraph graph, VertexProperty<ID,java.lang.String> labels, int maxIter, double threshold, java.lang.String delimiter, EdgeProperty<java.lang.Double> weight)	Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
<ID> PgxFuture<VertexProperty<ID,java.lang.String>>	Analyst.weightedSpeakerListenerLabelPropagationAsync(PgxGraph graph, java.lang.String labelsPropName, int maxIter, double threshold, java.lang.String delimiter, EdgeProperty<java.lang.Double> weight)	Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
<ID> PgxFuture<VertexProperty<ID,java.lang.String>>	Analyst.weightedSpeakerListenerLabelPropagationAsync(PgxGraph graph, java.lang.String labelsPropName, EdgeProperty<java.lang.Double> weight)	Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.
<ID> PgxFuture<VertexProperty<ID,java.lang.String>>	Analyst.weightedSpeakerListenerLabelPropagationAsync(PgxGraph graph, VertexProperty<ID,java.lang.String> labels, int maxIter, double threshold, java.lang.String delimiter, EdgeProperty<java.lang.Double> weight)	Speaker listener label propagation can find overlaping and multiple communities in a graph relatively fast.

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

Modifier and Type	Method	Description
<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.
B	MutationStrategyBuilder.setKeptEdgeProperties(java.util.Collection<EdgeProperty<?>> propsToKeep)	Set edge properties that will be kept By default (without calling this) all edgeProperties will be kept.