Uses of Class
oracle.pgx.api.filter.VertexFilter

Packages that use VertexFilter

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

Uses of VertexFilter in oracle.pgx.api

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

Modifier and Type	Method	Description
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, int maxDepth)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, int maxDepth, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredBfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, int maxDepth)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, int maxDepth)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, int maxDepth, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, int maxDepth)	A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredDfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredDfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredDfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, int maxDepth)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredDfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, int maxDepth, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredDfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>	Analyst.filteredDfs(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, int maxDepth)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, int maxDepth)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, int maxDepth, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredDfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter navigator, int maxDepth)	A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
<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).
<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.

Uses of VertexFilter in oracle.pgx.api.filter

Fields in oracle.pgx.api.filter declared as VertexFilter

Modifier and Type	Field	Description
static VertexFilter	VertexFilter.ALL	Vertex filter set equal to true for all edges.
static VertexFilter	VertexFilter.NONE	Vertex filter set equal to false for all edges.

Methods in oracle.pgx.api.filter that return VertexFilter

Modifier and Type	Method	Description
VertexFilter	GraphFilter.asVertexFilter()	Gets this filter object as vertex filter, if possible.
VertexFilter	VertexFilter.asVertexFilter()
static VertexFilter	VertexFilter.fromCollection(oracle.pgx.common.IdentifiableVertexCollection vertexCollection)	Instantiates a new vertex collection vertex filter.
static VertexFilter	VertexFilter.fromExpression(java.lang.String filterExpression)	Instantiates a new vertex filter using an expression.
static VertexFilter	VertexFilter.fromPgqlResultSet(oracle.pgx.common.IdentifiableResultSet resultSet, java.lang.String columnName)	Instantiates a new result set vertex filter.