Uses of Class
oracle.pgx.api.VertexSet

Packages that use VertexSet

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

Uses of VertexSet in oracle.pgx.api

Methods in oracle.pgx.api that return VertexSet

Modifier and Type	Method and Description
<ID> VertexSet<ID>	Analyst.center(PgxGraph graph)
<ID> VertexSet<ID>	Analyst.center(PgxGraph graph, VertexSet<ID> center)
<E> VertexSet<E>	PgxGraph.createVertexSet() Blocking version of PgxGraph.createVertexSetAsync().
<E> VertexSet<E>	PgxGraph.createVertexSet(java.lang.String name) Blocking version of PgxGraph.createVertexSetAsync(String).
<E> VertexSet<E>	PgxGraph.getVertices() Blocking version of PgxGraph.getVerticesAsync().
<E> VertexSet<E>	PgxGraph.getVertices(VertexFilter filter) Blocking version of PgxGraph.getVerticesAsync(VertexFilter).
<E> VertexSet<E>	PgxGraph.getVertices(VertexFilter filter, java.lang.String name) Blocking version of PgxGraph.getVerticesAsync(VertexFilter, String).
<ID> VertexSet<ID>	Analyst.periphery(PgxGraph graph)
<ID> VertexSet<ID>	Analyst.periphery(PgxGraph graph, VertexSet<ID> periphery)

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

Modifier and Type	Method and Description
<ID> PgxFuture<VertexSet<ID>>	Analyst.centerAsync(PgxGraph graph)
<ID> PgxFuture<VertexSet<ID>>	Analyst.centerAsync(PgxGraph graph, VertexSet<ID> center)
<E> PgxFuture<VertexSet<E>>	PgxGraph.createVertexSetAsync() Creates a new vertex set.
<E> PgxFuture<VertexSet<E>>	PgxGraph.createVertexSetAsync(java.lang.String name) Creates a new vertex set.
<E> PgxFuture<VertexSet<E>>	PgxGraph.getVerticesAsync() Creates a new vertex set containing all vertices.
<E> PgxFuture<VertexSet<E>>	PgxGraph.getVerticesAsync(VertexFilter filter) Creates a new vertex set containing vertices according to the given filter expression.
<E> PgxFuture<VertexSet<E>>	PgxGraph.getVerticesAsync(VertexFilter filter, java.lang.String name) Creates a new vertex set containing vertices according to the given filter expression.
<ID> PgxFuture<VertexSet<ID>>	Analyst.peripheryAsync(PgxGraph graph)
<ID> PgxFuture<VertexSet<ID>>	Analyst.peripheryAsync(PgxGraph graph, VertexSet<ID> periphery)

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

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).
BipartiteGraph	PgxGraph.bipartiteSubGraphFromLeftSet(VertexSet<?> vertexSet) Blocking version of PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet).
BipartiteGraph	PgxGraph.bipartiteSubGraphFromLeftSet(VertexSet<?> vertexSet, java.lang.String newGraphName) Blocking version of PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet, String).
PgxFuture<BipartiteGraph>	PgxGraph.bipartiteSubGraphFromLeftSetAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName) Create a bipartite version of this graph with the given vertex set being the left set.
PgxFuture<BipartiteGraph>	PgxGraph.bipartiteSubGraphFromLeftSetAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName, java.lang.String isLeftPropName) Create a bipartite version of this graph with the given vertex set being the left set.
PgxFuture<BipartiteGraph>	PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet<?> vertexSet) Create a bipartite version of this graph with the given vertex set being the left set.
PgxFuture<BipartiteGraph>	PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet<?> vertexSet, java.lang.String newGraphName) Create a bipartite version of this graph with the given vertex set being the left set.
<ID> VertexSet<ID>	Analyst.center(PgxGraph graph, VertexSet<ID> center)
<ID> PgxFuture<VertexSet<ID>>	Analyst.centerAsync(PgxGraph graph, VertexSet<ID> center)
<ID> VertexSet<ID>	Analyst.periphery(PgxGraph graph, VertexSet<ID> periphery)
<ID> PgxFuture<VertexSet<ID>>	Analyst.peripheryAsync(PgxGraph graph, VertexSet<ID> periphery)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIter, double maxDiff)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIter, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIter, double maxDiff)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIter, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight)
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight)
<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)
<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)
<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)
<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)
<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)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight)
<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)
<ID> VertexProperty<ID,java.lang.Integer>	Analyst.topologicalSchedule(PgxGraph graph, VertexSet<ID> source)
<ID> VertexProperty<ID,java.lang.Integer>	Analyst.topologicalSchedule(PgxGraph graph, VertexSet<ID> source, VertexProperty<ID,java.lang.Integer> topoSched)
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.topologicalScheduleAsync(PgxGraph graph, VertexSet<ID> source)
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.topologicalScheduleAsync(PgxGraph graph, VertexSet<ID> source, VertexProperty<ID,java.lang.Integer> topoSched)