Package | Description |
---|---|
oracle.pgx.algorithm | |
oracle.pgx.algorithm.filter |
Modifier and Type | Field and Description |
---|---|
static PgxVertex |
PgxVertex.NONE
A value indicating the absence of a vertex.
|
Modifier and Type | Method and Description |
---|---|
PgxVertex |
EdgeSequence.back()
Get the edge at the back of the sequence.
|
PgxVertex |
VertexSequence.back()
Get the vertex at the back of the sequence.
|
PgxVertex |
PgxEdge.destinationVertex()
Get the target vertex of this edge.
|
PgxVertex |
VertexSequence.front()
Get the vertex at the front of the sequence.
|
PgxVertex |
PgxVertex.getRandomInNeighbor()
Return a random incoming neighbor.
|
PgxVertex |
PgxVertex.getRandomInOutNeighbor()
Return a random incoming or outgoing neighbor.
|
PgxVertex |
PgxVertex.getRandomOutNeighbor()
Return a random outgoing neighbor.
|
PgxVertex |
PgxGraph.getRandomVertex()
Get a random vertex from the graph.
|
PgxVertex |
PgxVertex.parentVertex()
Returns the vertex that was visited before this vertex.
|
PgxVertex |
VertexSequence.pop()
Remove and return a vertex from the sequence.
|
PgxVertex |
VertexSequence.popBack()
Remove and return the vertex at the back of the sequence.
|
PgxVertex |
VertexSequence.popFront()
Remove and return the vertex at the front of the sequence.
|
PgxVertex |
PgxEdge.sourceVertex()
Get the source vertex of this edge.
|
Modifier and Type | Method and Description |
---|---|
void |
VertexSet.add(PgxVertex v)
Add the vertex to the set.
|
<T> Reduction |
Reduction.andUpdate(PgxVertex vertex, VertexProperty<T> property, T value)
If the reduction in the Reduction applies, also update the property the property specified here.
|
boolean |
VertexSet.contains(PgxVertex v)
Check if the set contains the given vertex.
|
boolean |
VertexSequence.contains(PgxVertex v)
Check if the sequence contains the given vertex.
|
void |
VertexProperty.decrement(PgxVertex vertex)
Decrement the property of the given vertex.
|
T |
VertexProperty.get(PgxVertex vertex)
Get the property for the given vertex.
|
boolean |
PgxVertex.greaterThan(PgxVertex v)
Check whether this vertex is greater than the given vertex according to the ordering induced on the vertices.
|
boolean |
PgxVertex.hasEdgeFrom(PgxVertex v)
Check if there is an edge from the given vertex to this vertex.
|
boolean |
PgxVertex.hasEdgeTo(PgxVertex v)
Check if there is an edge from this vertex to the given vertex.
|
static Traversal |
Traversal.inBFS(PgxGraph graph, PgxVertex root)
Create a BFS traversal in the given graph rooted at the given vertex.
|
void |
VertexProperty.increment(PgxVertex vertex)
Increment the property of the given vertex.
|
static Traversal |
Traversal.inDFS(PgxGraph graph, PgxVertex root)
Create a DFS traversal in the given graph rooted at the given vertex.
|
boolean |
PgxVertex.lessThan(PgxVertex v)
Check whether this vertex is less than the given vertex according to the ordering induced on the vertices.
|
void |
VertexSequence.push(PgxVertex v)
Add a vertex to the sequence.
|
void |
VertexSequence.pushBack(PgxVertex v)
Add a vertex to the back of the sequence.
|
void |
VertexSequence.pushFront(PgxVertex v)
Add a vertex to the front of the sequence.
|
void |
VertexProperty.reduceAdd(PgxVertex vertex, T value)
Atomically update the vertex's property to the sum of the current value and the given value.
|
void |
VertexProperty.reduceAnd(PgxVertex vertex, T value)
Atomically update the vertex's property to the conjunction of the current value and the given value.
|
void |
VertexProperty.reduceMax(PgxVertex vertex, T value)
Atomically update the given vertex's property to the maximum of the current value and the given value.
|
void |
VertexProperty.reduceMin(PgxVertex vertex, T value)
Atomically update the given vertex's property to the minimum of the current value and the given value.
|
void |
VertexProperty.reduceMul(PgxVertex vertex, T value)
Atomically update the vertex's property to the multiplication of the current value and the given value.
|
void |
VertexProperty.reduceOr(PgxVertex vertex, T value)
Atomically update the vertex's property to the disjunction of the current value and the given value.
|
void |
VertexSet.remove(PgxVertex v)
Remove the vertex from the set.
|
void |
VertexProperty.set(PgxVertex vertex, T value)
Set the value of the vertex property for the given vertex.
|
void |
VertexProperty.setDeferred(PgxVertex vertex, T value)
Set the vertex property to the given value, but only after the current parallel region finishes.
|
static <T> Reduction |
Reduction.updateMaxValue(PgxVertex vertex, VertexProperty<T> property, T value)
Create an atomic reduction of a vertex property.
|
static <T> Reduction |
Reduction.updateMinValue(PgxVertex vertex, VertexProperty<T> property, T value)
Create an atomic reduction of a vertex property.
|
Modifier and Type | Method and Description |
---|---|
boolean |
VertexSet.allMatch(java.util.function.Predicate<PgxVertex> predicate)
Check if the predicate holds for all vertices in the set.
|
boolean |
VertexSet.anyMatch(java.util.function.Predicate<PgxVertex> predicate)
Check if the predicate holds for any vertex in the set.
|
<T extends java.lang.Number> |
VertexSet.avg(java.util.function.Function<PgxVertex,T> reducer)
Apply the reducer to each vertex in the set and compute the average.
|
Traversal |
Traversal.backward(java.util.function.Consumer<PgxVertex> backward)
Visit the vertex in the backward direction of the traversal.
|
Traversal |
Traversal.backwardFilter(java.util.function.Predicate<PgxVertex> filter)
Filter the vertices in the BFS/DFS traversal when going backward.
|
VertexSet |
VertexSet.filter(java.util.function.Predicate<PgxVertex> predicate)
Filter the vertices in the set by the given predicate.
|
VertexSet |
VertexSequence.filter(java.util.function.Predicate<PgxVertex> predicate)
Filter the vertices in the sequence by the given predicate.
|
Traversal |
Traversal.filter(java.util.function.Predicate<PgxVertex> filter)
Filter the vertices in the BFS/DFS traversal.
|
void |
VertexSet.forEach(java.util.function.Consumer<PgxVertex> callable)
Run the callable for each vertex in the set in parallel.
|
void |
VertexSequence.forEach(java.util.function.Consumer<PgxVertex> callable)
Run the callable for each vertex in the sequence in parallel.
|
void |
VertexSet.forSequential(java.util.function.Consumer<PgxVertex> callable)
Run the callable for each vertex in the set in sequence.
|
void |
VertexSequence.forSequential(java.util.function.Consumer<PgxVertex> callable)
Run the callable for each vertex in the sequence in sequence.
|
Traversal |
Traversal.forward(java.util.function.Consumer<PgxVertex> forward)
Visit the vertex in the forward direction of the BFS traversal.
|
<T extends java.lang.Number> |
VertexSet.max(java.util.function.Function<PgxVertex,T> reducer)
Apply the reducer to each vertex in the set and compute the maximum.
|
Traversal |
Traversal.navigator(java.util.function.Predicate<PgxVertex> navigator)
If the navigator is false, do not consider the neighbors of this vertex in the traversal.
|
VertexSet |
VertexSet.orderBy(java.util.function.Function<PgxVertex,java.lang.Number> transform, Order order)
Order the vertices in the set based on the result of the transformation function.
|
void |
VertexProperty.setAll(java.util.function.Function<PgxVertex,T> transform)
Set the vertex property for each vertex to the value based on the transformation function.
|
<T extends java.lang.Number> |
VertexSet.sum(java.util.function.Function<PgxVertex,T> reducer)
Apply the reducer to each vertex in the set and sum the results.
|
Modifier and Type | Method and Description |
---|---|
boolean |
VertexFilter.evaluate(PgxVertex v) |