| Package | Description |
|---|---|
| oracle.pgx.api |
This package contains the main Java APIs.
|
| oracle.pgx.api.filter |
This package contains filter data objects.
|
| Modifier and Type | Method and Description |
|---|---|
<ID> org.apache.commons.lang3.tuple.Triple<VertexSet<ID>,EdgeSet,PgxMap<PgxVertex<ID>,java.lang.Integer>> |
Analyst.allReachableVerticesEdgesFiltered(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int k,
EdgeFilter filter)
Finds all the vertices and edges on a path between the src and target of length smaller or equal to k.
|
<ID> PgxFuture<org.apache.commons.lang3.tuple.Triple<VertexSet<ID>,EdgeSet,PgxMap<PgxVertex<ID>,java.lang.Integer>>> |
Analyst.allReachableVerticesEdgesFilteredAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int k,
EdgeFilter filter)
Finds all the vertices and edges on a path between the src and target of length smaller or equal to k.
|
EdgeSet |
PgxGraph.getEdges(EdgeFilter filter)
Blocking version of
PgxGraph.getEdges(EdgeFilter). |
EdgeSet |
PgxGraph.getEdges(EdgeFilter filter,
java.lang.String name)
Blocking version of
PgxGraph.getEdges(EdgeFilter, String). |
<E> PgxFuture<EdgeSet> |
PgxGraph.getEdgesAsync(EdgeFilter filter)
Creates a new edge set containing edges according to the given filter expression.
|
PgxFuture<EdgeSet> |
PgxGraph.getEdgesAsync(EdgeFilter filter,
java.lang.String name)
Creates a new edge set containing edges according to the given filter expression.
|
<ID> Pair<VertexSequence<ID>,EdgeSequence> |
Analyst.limitedShortestPathHopDistFiltered(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index,
EdgeFilter filter)
Computes the k-hop limited shortest path between two vertices.
|
<ID> Pair<VertexSequence<ID>,EdgeSequence> |
Analyst.limitedShortestPathHopDistFiltered(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index,
EdgeFilter filter,
VertexSequence<ID> pathVertices,
EdgeSequence pathEdges)
Computes the k-hop limited shortest path between two vertices.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>> |
Analyst.limitedShortestPathHopDistFilteredAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index,
EdgeFilter filter)
Computes the k-hop limited shortest path between two vertices.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>> |
Analyst.limitedShortestPathHopDistFilteredAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index,
EdgeFilter filter,
VertexSequence<ID> pathVertices,
EdgeSequence pathEdges)
Computes the k-hop limited shortest path between two vertices.
|
| Modifier and Type | Field and Description |
|---|---|
static EdgeFilter |
EdgeFilter.ALL
Edge filter set equal to true for all edges.
|
static EdgeFilter |
EdgeFilter.NONE
Edge filter set equal to false for all edges.
|
| Modifier and Type | Method and Description |
|---|---|
EdgeFilter |
EdgeFilter.asEdgeFilter() |
EdgeFilter |
GraphFilter.asEdgeFilter()
Gets this filter object as edge filter, if possible.
|
static EdgeFilter |
EdgeFilter.fromCollection(oracle.pgx.common.IdentifiableEdgeCollection edgeCollection)
Instantiates a new edge collection edge filter.
|
static EdgeFilter |
EdgeFilter.fromExpression(java.lang.String filterExpression)
Instantiates a new edge filter using an expression.
|
static EdgeFilter |
EdgeFilter.fromPgqlResultSet(oracle.pgx.common.IdentifiableResultSet resultSet,
java.lang.String columnName)
Instantiates a new result set edge filter.
|