| ConnectiveStrategy |
ConnectiveStrategy rewrites the binary conjunction form of a.and().b into a AndStep of
and(a,b) (likewise for OrStep). |
| ElementIdStrategy |
Provides a degree of control over element identifier assignment as some graphs don't provide that feature.
|
| ElementIdStrategy.Builder |
|
| EventStrategy |
A strategy that raises events when Mutating steps are encountered and successfully executed. |
| EventStrategy.Builder |
|
| EventStrategy.Detacher |
A common interface for detachment.
|
| EventStrategy.Detachment |
Options for detaching elements from the graph during eventing.
|
| EventStrategy.EventQueue |
Gathers messages from callbacks and fires them to listeners.
|
| HaltedTraverserStrategy |
|
| OptionsStrategy |
This strategy will not alter the traversal.
|
| OptionsStrategy.Builder |
|
| PartitionStrategy |
PartitionStrategy partitions the vertices, edges and vertex properties of a graph into String named
partitions (i.e.
|
| PartitionStrategy.Builder |
|
| SackStrategy |
The SackStrategy is used internal to the withSack() steps of TraversalSource and is not
typically constructed directly. |
| SackStrategy.Builder |
|
| SeedStrategy |
A strategy that resets the specified seed value for Seedable steps, which in turn will produce
deterministic results from those steps. |
| SubgraphStrategy |
|
| SubgraphStrategy.Builder |
|