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

Packages that use GraphFilter

Package	Description
oracle.pgx.api	This package contains the main Java APIs.
oracle.pgx.api.filter	This package contains filter data objects.
oracle.pgx.config	This package contains all configuration-related classes of PGX.

Uses of GraphFilter in oracle.pgx.api

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

Modifier and Type	Method and Description
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).
PgxGraph	PgxGraph.filter(GraphFilter graphFilter) Blocking version of PgxGraph.filterAsync(GraphFilter).
PgxGraph	PgxGraph.filter(GraphFilter graphFilter, java.lang.String newGraphName) Blocking version of PgxGraph.filterAsync(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.
PgxFuture<PgxGraph>	PgxGraph.filterAsync(GraphFilter graphFilter) Create a subgraph of this graph.
PgxFuture<PgxGraph>	PgxGraph.filterAsync(GraphFilter graphFilter, java.lang.String newGraphName) Create a subgraph of this graph.
<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, 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) 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) Filtered Dijkstra is a fast algorithm for finding a shortest path while also filtering edges
<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, 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) 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, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges

Uses of GraphFilter in oracle.pgx.api.filter

Subclasses of GraphFilter in oracle.pgx.api.filter

Modifier and Type	Class and Description
class	BinaryGraphFilterOperation
class	EdgeFilter A class that wraps a filter expression supposed to be evaluated on each edge of the graph
class	FilterIntersection A class that represents an intersection between two graph-filters
class	FilterUnion A class that represents an union between two graph-filters
class	GraphFilterWithExpression
class	PathFindingFilter
class	VertexFilter A class that wraps a filter expression supposed to be evaluated on each vertex of the graph

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

Modifier and Type	Method and Description
static GraphFilter	BinaryGraphFilterOperation.fromTypeAndFilters(FilterType type, GraphFilter leftFilter, GraphFilter rightFilter)
GraphFilter	PathFindingFilter.getGraphFilter()
GraphFilter	BinaryGraphFilterOperation.getLeftFilter() Gets the filter object representing the left side of the operation.
GraphFilter	BinaryGraphFilterOperation.getRightFilter() Gets the filter object representing the right side of the operation.

Methods in oracle.pgx.api.filter with parameters of type GraphFilter

Modifier and Type	Method and Description
static GraphFilter	BinaryGraphFilterOperation.fromTypeAndFilters(FilterType type, GraphFilter leftFilter, GraphFilter rightFilter)
FilterIntersection	GraphFilter.intersect(GraphFilter other) Intersects this filter with another graph-filter object.
FilterUnion	GraphFilter.union(GraphFilter other) Unions this filter with another graph-filter object.

Constructors in oracle.pgx.api.filter with parameters of type GraphFilter

Constructor and Description
FilterIntersection(GraphFilter leftFilter, GraphFilter rightFilter) Instantiates a new filter intersection.
FilterUnion(GraphFilter leftFilter, GraphFilter rightFilter) Instantiates a new filter union.
PathFindingFilter(GraphFilter graphFilter, java.lang.Object sourceVertex, java.lang.Object destinationVertex)

Uses of GraphFilter in oracle.pgx.config

Methods in oracle.pgx.config that return GraphFilter

Modifier and Type	Method and Description
static GraphFilter	GraphFilterFactory.createFromFilterExpressionConfig(FilterExpressionConfig filterConfig)

Methods in oracle.pgx.config that return types with arguments of type GraphFilter

Modifier and Type	Method and Description
java.util.Optional<GraphFilter>	GraphConfig.getLoadingFilter() Deprecated. Filtered loading is deprecated since PGX 22.3

Methods in oracle.pgx.config with parameters of type GraphFilter

Modifier and Type	Method and Description
static FilterExpressionConfig	FilterExpressionConfigFactory.createFromGraphFilter(GraphFilter graphFilter)
T	AbstractGraphConfigBuilder.setFilter(GraphFilter filter) Deprecated. Filtered loading is deprecated since PGX 22.3.