<ID> org.apache.commons.lang3.tuple.Triple<VertexSet<ID>,EdgeSet,PgxMap<PgxVertex<ID>,java.lang.Integer>> |
Analyst.allReachableVerticesEdges(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int k) |
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.allReachableVerticesEdgesAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int k) |
Finds all the vertices and edges on a path between the src and target of length smaller or equal to k.
|
<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.
|
PgxFuture<EdgeSet> |
PgxGraph.createEdgeSetAsync() |
Creates a new edge set.
|
PgxFuture<EdgeSet> |
PgxGraph.createEdgeSetAsync(java.lang.String name) |
Creates a new edge set.
|
PgxFuture<EdgeSet> |
PgxGraph.getEdgesAsync() |
Creates a new edge set containing all edges.
|
<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.
|