Uses of Class
oracle.pgx.api.VertexProperty

Packages that use VertexProperty

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

Uses of VertexProperty in oracle.pgx.api

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

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

Methods in oracle.pgx.api that return VertexProperty

Modifier and Type	Method and Description
<ID extends Comparable<ID>> VertexProperty<ID,Double>	Analyst.approximateVertexBetweennessCentrality(PgxGraph graph, int k) Blocking version of #approximateVertexBetweennessCentralityAsync().
<ID extends Comparable<ID>> VertexProperty<ID,Double>	Analyst.approximateVertexBetweennessCentralityFromSeeds(PgxGraph graph, PgxVertex<ID>... seeds) Blocking version of #approximateVertexBetweennessCentralityFromSeedsAsync().
VertexProperty<ID,V>	VertexProperty.clone() Blocking version of cloneAsync().
VertexProperty<ID,V>	VertexProperty.clone(String newPropertyName) Blocking version of cloneAsync(String).
<ID extends Comparable<ID>> VertexProperty<ID,Double>	Analyst.closenessCentralityDoubleLength(PgxGraph graph, EdgeProperty<Double> cost) Blocking version of #closenessCentralityDoubleLengthAsync().
<ID extends Comparable<ID>> VertexProperty<ID,Double>	Analyst.closenessCentralityUnitLength(PgxGraph graph) Blocking version of #closenessCentralityUnitLengthAsync().
<ID extends Comparable<ID>,V extends Comparable<V>> VertexProperty<ID,V>	PgxGraph.createVertexProperty(PropertyType type) Blocking version of #createVertexPropertyAsync().
<ID extends Comparable<ID>,V extends Comparable<V>> VertexProperty<ID,V>	PgxGraph.createVertexProperty(PropertyType type, String name) Blocking version of #createVertexPropertyAsync().
<ID extends Comparable<ID>> VertexProperty<ID,Integer>	Analyst.degreeCentrality(PgxGraph graph) Blocking version of #degreeCentralityAsync().
<ID extends Comparable<ID>> VertexProperty<ID,Double>	Analyst.eigenvectorCentrality(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge) Blocking version of #eigenvectorCentralityAsync().
<ID extends Comparable<ID>> VertexProperty<ID,Boolean>	BipartiteGraph.getIsLeftProperty() Blocking version of BipartiteGraph.getIsLeftPropertyAsync().
<ID extends Comparable<ID>,V extends Comparable<V>> VertexProperty<ID,V>	PgxGraph.getVertexProperty(String name) Blocking version of #getVertexPropertyAsync().
<ID extends Comparable<ID>> VertexProperty<ID,Integer>	Analyst.inDegreeCentrality(PgxGraph graph) Blocking version of #inDegreeCentralityAsync().
<ID extends Comparable<ID>> VertexProperty<ID,Integer>	Analyst.outDegreeCentrality(PgxGraph graph) Blocking version of #outDegreeCentralityAsync().
<ID extends Comparable<ID>> VertexProperty<ID,Double>	Analyst.pagerank(PgxGraph graph, double e, double d, int max) Blocking version of #pagerankAsync().
<ID extends Comparable<ID>> VertexProperty<ID,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 extends Comparable<ID>> VertexProperty<ID,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 extends Comparable<ID>> VertexProperty<ID,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 extends Comparable<ID>> VertexProperty<ID,Double>	Analyst.vertexBetweennessCentrality(PgxGraph graph) Blocking version of #vertexBetweennessCentralityAsync().

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

Modifier and Type	Method and Description
<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Double>>	Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph graph, int k) Approximate vertex betweenness centrality (without considering edge length).
<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Double>>	Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph, PgxVertex<ID>... seeds) Approximate vertex betweenness centrality (without considering edge length).
PgxFuture<VertexProperty<ID,V>>	VertexProperty.cloneAsync()
PgxFuture<VertexProperty<ID,V>>	VertexProperty.cloneAsync(String newPropertyName)
<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Double>>	Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<Double> cost) Compute closed centrality.
<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Double>>	Analyst.closenessCentralityUnitLengthAsync(PgxGraph graph) Compute closed centrality.
<ID extends Comparable<ID>,V extends Comparable<V>> PgxFuture<VertexProperty<ID,V>>	PgxGraph.createVertexPropertyAsync(PropertyType type) Creates a session-bound vertex property
<ID extends Comparable<ID>,V extends Comparable<V>> PgxFuture<VertexProperty<ID,V>>	PgxGraph.createVertexPropertyAsync(PropertyType type, String name) Creates a session-bound vertex property
<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Integer>>	Analyst.degreeCentralityAsync(PgxGraph graph) Compute degree centrality.
<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Double>>	Analyst.eigenvectorCentralityAsync(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge) Compute eigenvector centrality using power iteration (with L1 norm).
<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Boolean>>	BipartiteGraph.getIsLeftPropertyAsync() Gets the 'is Left' vertex property of the graph.
Set<VertexProperty<?,?>>	PgxGraph.getVertexProperties() Blocking version of PgxGraph.getVertexPropertiesAsync().
PgxFuture<Set<VertexProperty<?,?>>>	PgxGraph.getVertexPropertiesAsync() Get the set of vertex properties belonging to this graph.
<ID extends Comparable<ID>,V extends Comparable<V>> PgxFuture<VertexProperty<ID,V>>	PgxGraph.getVertexPropertyAsync(String name) Gets a vertex property of this graph
<ID extends Comparable<ID>> Pair<VertexProperty<ID,Double>,VertexProperty<ID,Double>>	Analyst.hits(PgxGraph graph, int max) Blocking version of #hitsAsync().
<ID extends Comparable<ID>> Pair<VertexProperty<ID,Double>,VertexProperty<ID,Double>>	Analyst.hits(PgxGraph graph, int max) Blocking version of #hitsAsync().
<ID extends Comparable<ID>> PgxFuture<Pair<VertexProperty<ID,Double>,VertexProperty<ID,Double>>>	Analyst.hitsAsync(PgxGraph graph, int max) Classic HITS algorithm (Hyperlink-Induced Topic Search, aka.
<ID extends Comparable<ID>> PgxFuture<Pair<VertexProperty<ID,Double>,VertexProperty<ID,Double>>>	Analyst.hitsAsync(PgxGraph graph, int max) Classic HITS algorithm (Hyperlink-Induced Topic Search, aka.
<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Integer>>	Analyst.inDegreeCentralityAsync(PgxGraph graph) Compute in-degree centrality.
<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Integer>>	Analyst.outDegreeCentralityAsync(PgxGraph graph) Compute out-degree centrality.
<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Double>>	Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max) Classic pagerank algorithm.
<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,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 extends Comparable<ID>> PgxFuture<VertexProperty<ID,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 extends Comparable<ID>> PgxFuture<VertexProperty<ID,Double>>	Analyst.vertexBetweennessCentralityAsync(PgxGraph graph) Compute vertex betweenness centrality (without considering edge length).

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

Modifier and Type	Method and Description
<ID extends Comparable<ID>> AllPaths<ID>	PgxGraph.createAllPaths(PgxVertex<ID> src, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Blocking version of #createAllPathsAsync().
<ID extends Comparable<ID>> AllPaths<ID>	PgxGraph.createAllPaths(PgxVertex<ID> src, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Blocking version of #createAllPathsAsync().
<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>	PgxGraph.createAllPathsAsync(PgxVertex<ID> src, EdgeProperty<Double> cost, 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 extends Comparable<ID>> PgxFuture<AllPaths<ID>>	PgxGraph.createAllPathsAsync(PgxVertex<ID> src, EdgeProperty<Double> cost, 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 extends Comparable<ID>> Partition<ID>	PgxGraph.createComponents(VertexProperty<ID,Integer> components, int numComponents) Blocking version of #createComponentsAsync().
<ID extends Comparable<ID>> PgxFuture<Partition<ID>>	PgxGraph.createComponentsAsync(VertexProperty<ID,Integer> components, int numComponents) Creates a Partition object holding a collection of vertex sets, each representing a component.
<ID extends Comparable<ID>> PgxPath<ID>	PgxGraph.createPath(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Blocking version of #createPathAsync().
<ID extends Comparable<ID>> PgxPath<ID>	PgxGraph.createPath(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Blocking version of #createPathAsync().
<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>	PgxGraph.createPathAsync(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<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 extends Comparable<ID>> PgxFuture<PgxPath<ID>>	PgxGraph.createPathAsync(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<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).

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

Modifier and Type	Method and Description
BipartiteGraph	PgxGraph.bipartiteSubGraphFromLeftSet(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, String newGraphName) Blocking version of #bipartiteSubGraphFromLeftSetAsync().
BipartiteGraph	PgxGraph.bipartiteSubGraphFromLeftSet(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, String newGraphName, String isLeftPropName) Blocking version of #bipartiteSubGraphFromLeftSetAsync().
PgxFuture<BipartiteGraph>	PgxGraph.bipartiteSubGraphFromLeftSetAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, String newGraphName) Create a bipartite version of a graph.
PgxFuture<BipartiteGraph>	PgxGraph.bipartiteSubGraphFromLeftSetAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, String newGraphName, String isLeftPropName)
PgxGraph	PgxGraph.clone(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, String newGraphName) Blocking version of PgxGraph.cloneAsync().
PgxFuture<PgxGraph>	PgxGraph.cloneAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, String newGraphName) Create a copy of a graph.
PgxGraph	PgxGraph.filter(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, GraphFilter graphFilter, String newGraphName) Blocking version of #filterAsync().
PgxFuture<PgxGraph>	PgxGraph.filterAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, GraphFilter graphFilter, String newGraphName) Create a subgraph of a graph.
PgxGraph	PgxGraph.simplify(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, String newGraphName) Blocking version of #simplifyAsync().
PgxFuture<PgxGraph>	PgxGraph.simplifyAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, String newGraphName) Create a simplified version of a graph.
PgxGraph	PgxGraph.sortByDegree(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, PgxGraph.Direction direction, PgxGraph.Degree degree, PgxGraph.Mode mode, String newGraphName) Blocking version of PgxGraph.sortByDegreeAsync().
PgxFuture<PgxGraph>	PgxGraph.sortByDegreeAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, PgxGraph.Direction direction, PgxGraph.Degree degree, PgxGraph.Mode mode, String newGraphName) Create a sorted version of a graph and all its properties.
PgxGraph	PgxGraph.sparsify(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, double e, String newGraphName) Blocking version of #sparsifyAsync().
PgxFuture<PgxGraph>	PgxGraph.sparsifyAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, double e, String newGraphName) Sparsifies the given graph and returns a new graph with less edges.
FileGraphConfig	PgxGraph.store(Format targetFormat, String targetPath, Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, boolean overwrite) Blocking version of PgxGraph.storeAsync(Format, String, Collection, Collection, boolean).
PgxFuture<FileGraphConfig>	PgxGraph.storeAsync(Format targetFormat, String targetPath, Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, boolean overwrite)
PgxGraph	PgxGraph.undirect(Collection<VertexProperty<?,?>> vertexProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, String newGraphName) Blocking version of PgxGraph.undirectAsync().
PgxFuture<PgxGraph>	PgxGraph.undirectAsync(Collection<VertexProperty<?,?>> vertexProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, String newGraphName) Create an undirected version of a graph.