Uses of Class
oracle.pgx.api.VertexProperty

Packages that use VertexProperty

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

Uses of VertexProperty in oracle.pgx.api

Subclasses of VertexProperty in oracle.pgx.api

Modifier and Type	Class and Description
class	VertexLabels<ID>

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

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

Methods in oracle.pgx.api that return VertexProperty

Modifier and Type	Method and Description
<ID> VertexProperty<ID,java.lang.Double>	Analyst.approximateVertexBetweennessCentrality(PgxGraph graph, int k) Blocking version of Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph, int).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.approximateVertexBetweennessCentralityFromSeeds(PgxGraph graph, PgxVertex<ID>... seeds) Blocking version of Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph, PgxVertex[]).
VertexProperty<ID,V>	VertexProperty.clone() Blocking version of cloneAsync().
VertexProperty<ID,V>	VertexProperty.clone(java.lang.String newPropertyName) Blocking version of cloneAsync(String).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.closenessCentralityDoubleLength(PgxGraph graph, EdgeProperty<java.lang.Double> cost) Blocking version of Analyst.closenessCentralityDoubleLengthAsync(PgxGraph, EdgeProperty).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.closenessCentralityUnitLength(PgxGraph graph) Blocking version of Analyst.closenessCentralityUnitLengthAsync(PgxGraph).
<ID,V> VertexProperty<ID,PgxVect<V>>	PgxGraph.combineVertexPropertiesIntoVectorProperty(java.util.List<VertexProperty<ID,V>> vertexPropertyList) Blocking version of PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List) Calls PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List) and waits for the returned PgxFuture to complete.
<ID,V> VertexProperty<ID,PgxVect<V>>	PgxGraph.combineVertexPropertiesIntoVectorProperty(java.util.List<VertexProperty<ID,V>> vertexPropertyList, java.lang.String name) Blocking version of PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List, String) Calls PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List, String) and waits for the returned PgxFuture to complete.
<ID,V> VertexProperty<ID,V>	PgxGraph.createVertexProperty(PropertyType type) Blocking version of PgxGraph.createVertexPropertyAsync(PropertyType).
<ID,V> VertexProperty<ID,V>	PgxGraph.createVertexProperty(PropertyType type, java.lang.String name) Blocking version of PgxGraph.createVertexPropertyAsync(PropertyType, String).
<ID,V> VertexProperty<ID,PgxVect<V>>	PgxGraph.createVertexVectorProperty(PropertyType type, int dimension) Blocking version of PgxGraph.createVertexVectorPropertyAsync(PropertyType, int).
<ID,V> VertexProperty<ID,PgxVect<V>>	PgxGraph.createVertexVectorProperty(PropertyType type, int dimension, java.lang.String name) Blocking version of PgxGraph.createVertexVectorPropertyAsync(PropertyType, int, String).
<ID> VertexProperty<ID,java.lang.Integer>	Analyst.degreeCentrality(PgxGraph graph) Blocking version of Analyst.degreeCentralityAsync(PgxGraph).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.eigenvectorCentrality(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge) Blocking version of Analyst.eigenvectorCentralityAsync(PgxGraph, int, double, boolean, boolean).
VertexProperty<ID,java.lang.Double>	MatrixFactorizationModel.getEstimatedRatings(PgxVertex<ID> estimateRatingsFor) Blocking version of MatrixFactorizationModel.getEstimatedRatingsAsync(PgxVertex)
VertexProperty<ID,PgxVect<java.lang.Double>>	MatrixFactorizationModel.getFeatures() Gets the features of this model.
<ID> VertexProperty<ID,java.lang.Boolean>	BipartiteGraph.getIsLeftProperty() Blocking version of BipartiteGraph.getIsLeftPropertyAsync().
<ID,V> VertexProperty<ID,V>	PgxGraph.getVertexProperty(java.lang.String name) Blocking version of PgxGraph.getVertexPropertyAsync(String).
<ID> VertexProperty<ID,java.lang.Integer>	Analyst.inDegreeCentrality(PgxGraph graph) Blocking version of Analyst.inDegreeCentralityAsync(PgxGraph).
<ID> VertexProperty<ID,java.lang.Integer>	Analyst.outDegreeCentrality(PgxGraph graph) Blocking version of Analyst.outDegreeCentralityAsync(PgxGraph).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerank(PgxGraph graph, double e, double d, int max) Blocking version of Analyst.pagerankAsync(PgxGraph, double, double, int).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.pagerankApproximate(PgxGraph graph, double e, double d, int max) Blocking version of Analyst.pagerankApproximateAsync(PgxGraph, double, double, int).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, ID vertexId, double e, double d, int max) Convenience wrapper around Analyst.personalizedPagerank(PgxGraph, PgxVertex, double, double, int) taking a vertex ID instead of a PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max) Blocking version of Analyst.personalizedPagerankAsync(PgxGraph, PgxVertex, double, double, int).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max) Blocking version of Analyst.personalizedPagerankAsync(PgxGraph, VertexSet, double, double, int).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIterations, double maxDiff) Blocking version of Analyst.personalizedSalsaAsync(BipartiteGraph, PgxVertex, double, int, double).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIterations, double maxDiff) Blocking version of Analyst.personalizedSalsaAsync(BipartiteGraph, VertexSet, double, int, double).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.vertexBetweennessCentrality(PgxGraph graph) Blocking version of Analyst.vertexBetweennessCentralityAsync(PgxGraph).
<ID extends java.lang.Comparable<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).

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

Modifier and Type	Method and Description
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph graph, int k) Approximate vertex betweenness centrality (without considering edge length).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph, PgxVertex<ID>... seeds) Approximate vertex betweenness centrality (without considering edge length).
PgxFuture<VertexProperty<ID,V>>	VertexProperty.cloneAsync() Create a copy of this property. Convenience method for cloneAsync(String) passing newPropertyName as null
PgxFuture<VertexProperty<ID,V>>	VertexProperty.cloneAsync(java.lang.String newPropertyName) Creates a copy of this property.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<java.lang.Double> cost) Compute closed centrality.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.closenessCentralityUnitLengthAsync(PgxGraph graph) Compute closed centrality.
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>>	PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(java.util.List<VertexProperty<ID,V>> vertexPropertyList) Takes a list of scalar vertex properties of same type and creates a new vertex vector property by combining them.
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>>	PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(java.util.List<VertexProperty<ID,V>> vertexPropertyList, java.lang.String name) Takes a list of scalar vertex properties of same type and creates a new vertex vector property by combining them.
<ID,V> PgxFuture<VertexProperty<ID,V>>	PgxGraph.createVertexPropertyAsync(PropertyType type) Creates a session-bound vertex property
<ID,V> PgxFuture<VertexProperty<ID,V>>	PgxGraph.createVertexPropertyAsync(PropertyType type, java.lang.String name) Creates a session-bound vertex property
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>>	PgxGraph.createVertexVectorPropertyAsync(PropertyType type, int dimension) Creates a session-bound vertex vector property
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>>	PgxGraph.createVertexVectorPropertyAsync(PropertyType type, int dimension, java.lang.String name) Creates a session-bound vertex vector property
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.degreeCentralityAsync(PgxGraph graph) Compute vertex centrality based on the sum of in- and out-degree.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.eigenvectorCentralityAsync(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge) Compute eigenvector centrality using power iteration (with L1 norm).
<S> java.util.List<VertexProperty<ID,S>>	VertexProperty.expand() Blocking version of expandAsync().
<S> java.util.List<VertexProperty<ID,S>>	VertexProperty.expand(java.lang.String namePrefix) Blocking version of expandAsync(String).
<S> PgxFuture<java.util.List<VertexProperty<ID,S>>>	VertexProperty.expandAsync() If this is a vector property, expands this property into a list of scalar properties of same type.
<S> PgxFuture<java.util.List<VertexProperty<ID,S>>>	VertexProperty.expandAsync(java.lang.String namePrefix) If this is a vector property, expands this property into a list of scalar properties of same type.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator) Blocking version of Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter, VertexFilter).
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator) Blocking version of Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter, VertexFilter).
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf) Blocking version of Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean).
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf) Blocking version of Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean).
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator)
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator)
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf)
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf)
PgxFuture<VertexProperty<ID,java.lang.Double>>	MatrixFactorizationModel.getEstimatedRatingsAsync(PgxVertex<ID> estimateRatingsFor) Computes estimated ratings for a specific vertex.
<ID> PgxFuture<VertexProperty<ID,java.lang.Boolean>>	BipartiteGraph.getIsLeftPropertyAsync() Gets the 'is Left' vertex property of the graph.
java.util.Set<VertexProperty<?,?>>	PgxGraph.getVertexProperties() Blocking version of PgxGraph.getVertexPropertiesAsync().
PgxFuture<java.util.Set<VertexProperty<?,?>>>	PgxGraph.getVertexPropertiesAsync() Get the set of vertex properties belonging to this graph.
<ID,V> PgxFuture<VertexProperty<ID,V>>	PgxGraph.getVertexPropertyAsync(java.lang.String name) Gets a vertex property of this graph
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>	Analyst.hits(PgxGraph graph, int max) Blocking version of Analyst.hitsAsync(PgxGraph, int).
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>	Analyst.hits(PgxGraph graph, int max) Blocking version of Analyst.hitsAsync(PgxGraph, int).
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>>	Analyst.hitsAsync(PgxGraph graph, int max) This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>>	Analyst.hitsAsync(PgxGraph graph, int max) This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.inDegreeCentralityAsync(PgxGraph graph) Compute vertex centrality based on the in-degree.
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>	Analyst.kcore(PgxGraph graph, int minCore, int maxCore) Blocking version of Analyst.kcoreAsync(PgxGraph, int, int).
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>>	Analyst.kcoreAsync(PgxGraph graph, int minCore, int maxCore) Computes the k-core decomposition of the graph.
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.outDegreeCentralityAsync(PgxGraph graph) Compute vertex centrality based on the out-degree.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankApproximateAsync(PgxGraph graph, double e, double d, int max) Computes an approximate pagerank.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max) Classic pagerank algorithm.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max) Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max) Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIterations, double maxDiff) Personalized SALSA computes recommendations ith respect to a given vertex v.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIterations, double maxDiff) Personalized SALSA computes recommendations ith respect to a given set of vertices.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.salsa(BipartiteGraph graph, double maxDiff, int maxIter) Blocking version of Analyst.salsaAsync(BipartiteGraph, double, int).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.salsaAsync(BipartiteGraph graph, double maxDiff, int maxIter)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.vertexBetweennessCentralityAsync(PgxGraph graph) Compute vertex betweenness centrality (without considering edge length).
<ID extends java.lang.Comparable<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.

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

Modifier and Type	Method and Description
<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 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 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> PgxFuture<AllPaths<ID>>	PgxGraph.createAllPathsAsync(PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> dist, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Creates a AllPaths object representing all the shortest paths from a single source to all the possible destinations (shortest regarding the given edge costs).
<ID> PgxFuture<AllPaths<ID>>	PgxGraph.createAllPathsAsync(PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> dist, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Creates a AllPaths object representing all the shortest paths from a single source to all the possible destinations (shortest regarding the given edge costs).
<ID> Partition<ID>	PgxGraph.createComponents(VertexProperty<ID,java.lang.Long> components, long numComponents) Blocking version of PgxGraph.createComponentsAsync(VertexProperty, long).
<ID> PgxFuture<Partition<ID>>	PgxGraph.createComponentsAsync(VertexProperty<ID,java.lang.Long> components, long numComponents) Creates a Partition object holding a collection of vertex sets, each representing a component.
<ID> PgxPath<ID>	PgxGraph.createPath(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Blocking version of PgxGraph.createPathAsync(PgxVertex, PgxVertex, EdgeProperty, VertexProperty, VertexProperty).
<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).
<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).
java.lang.Boolean	PgxGraph.isBipartiteGraph(VertexProperty<?,java.lang.Boolean> isLeft) Blocking version of PgxGraph.isBipartiteGraphAsync(VertexProperty).
PgxFuture<java.lang.Boolean>	PgxGraph.isBipartiteGraphAsync(VertexProperty<?,java.lang.Boolean> isLeft) Checks whether a given graph is a bipartite graph.

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

Modifier and Type	Method and Description
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.
PgxFuture<BipartiteGraph>	PgxGraph.bipartiteSubGraphFromLeftSetAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName, java.lang.String isLeftPropName)
PgxGraph	PgxGraph.clone(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName) Blocking version of PgxGraph.cloneAsync().
PgxFuture<PgxGraph>	PgxGraph.cloneAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName) Creates a copy of this graph.
<ID,V> VertexProperty<ID,PgxVect<V>>	PgxGraph.combineVertexPropertiesIntoVectorProperty(java.util.List<VertexProperty<ID,V>> vertexPropertyList) Blocking version of PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List) Calls PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List) and waits for the returned PgxFuture to complete.
<ID,V> VertexProperty<ID,PgxVect<V>>	PgxGraph.combineVertexPropertiesIntoVectorProperty(java.util.List<VertexProperty<ID,V>> vertexPropertyList, java.lang.String name) Blocking version of PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List, String) Calls PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List, String) and waits for the returned PgxFuture to complete.
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>>	PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(java.util.List<VertexProperty<ID,V>> vertexPropertyList) Takes a list of scalar vertex properties of same type and creates a new vertex vector property by combining them.
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>>	PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(java.util.List<VertexProperty<ID,V>> vertexPropertyList, java.lang.String name) Takes a list of scalar vertex properties of same type and creates a new vertex vector property by combining them.
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.
SingleFileGraphConfig	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<SingleFileGraphConfig>	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.undirect(java.util.Collection<VertexProperty<?,?>> vertexProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, java.lang.String newGraphName) Blocking version of PgxGraph.undirectAsync(Collection, MultiEdges, SelfEdges, TrivialVertices, Mode, String).
PgxFuture<PgxGraph>	PgxGraph.undirectAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, java.lang.String newGraphName) Create an undirected version of a graph.