| Modifier and Type | Class and Description |
|---|---|
class |
Neo4jGraphStepStrategy |
| Modifier and Type | Class and Description |
|---|---|
class |
VertexProgramStrategy |
| Modifier and Type | Class and Description |
|---|---|
class |
ComputerFinalizationStrategy |
| Modifier and Type | Class and Description |
|---|---|
class |
GraphFilterStrategy |
class |
MessagePassingReductionStrategy |
| Modifier and Type | Class and Description |
|---|---|
class |
RemoteStrategy
Reconstructs a
Traversal by appending a RemoteStep to its end. |
| Modifier and Type | Class and Description |
|---|---|
class |
ConnectiveStrategy
|
class |
ElementIdStrategy
Provides a degree of control over element identifier assignment as some graphs don't provide that feature.
|
class |
EventStrategy
A strategy that raises events when
Mutating steps are encountered and successfully executed. |
class |
HaltedTraverserStrategy |
class |
PartitionStrategy
PartitionStrategy partitions the vertices, edges and vertex properties of a graph into String named
partitions (i.e. |
class |
RequirementsStrategy |
class |
SackStrategy |
class |
SideEffectStrategy |
class |
SubgraphStrategy
This
TraversalStrategy provides a way to limit the view of a Traversal. |
class |
TranslationStrategy |
| Modifier and Type | Class and Description |
|---|---|
class |
MatchAlgorithmStrategy |
class |
ProfileStrategy |
| Modifier and Type | Class and Description |
|---|---|
class |
AdjacentToIncidentStrategy
This strategy looks for vertex- and value-emitting steps followed by a
CountGlobalStep and replaces the
pattern with an edge- or property-emitting step followed by a CountGlobalStep. |
class |
CountStrategy
This strategy optimizes any occurrence of
CountGlobalStep followed by an IsStep. |
class |
FilterRankingStrategy
FilterRankingStrategy reorders filter- and order-steps according to their rank.
|
class |
IdentityRemovalStrategy
IdentityRemovalStrategy looks for IdentityStep instances and removes them. |
class |
IncidentToAdjacentStrategy
This strategy looks for
.outE().inV(), .inE().outV() and .bothE().otherV()
and replaces these step sequences with .out(), .in() or .both() respectively. |
class |
InlineFilterStrategy
InlineFilterStrategy analyzes filter-steps with child traversals that themselves are pure filters.
|
class |
LazyBarrierStrategy |
class |
MatchPredicateStrategy
MatchWhereStrategy will fold any post-
where() step that maintains a traversal constraint into
match(). |
class |
OrderLimitStrategy |
class |
PathProcessorStrategy
PathProcessStrategy is an OLAP strategy that does its best to turn non-local children in
where() and select()
into local children by inlining components of the non-local child. |
class |
PathRetractionStrategy |
class |
RepeatUnrollStrategy |
| Modifier and Type | Class and Description |
|---|---|
class |
ComputerVerificationStrategy |
class |
LambdaRestrictionStrategy
LambdaRestrictionStrategy does not allow lambdas to be used in a Traversal. |
class |
ReadOnlyStrategy
Detects steps marked with
Mutating and throws an IllegalStateException if one is found. |
class |
StandardVerificationStrategy |
| Modifier and Type | Class and Description |
|---|---|
class |
SparkInterceptorStrategy |
class |
SparkSingleIterationStrategy |
| Modifier and Type | Class and Description |
|---|---|
class |
TinkerGraphCountStrategy
This strategy will do a direct
TinkerHelper.getVertices(org.apache.tinkerpop.gremlin.tinkergraph.structure.TinkerVertex, org.apache.tinkerpop.gremlin.structure.Direction, java.lang.String...)
size call if the traversal is a count of the vertices and edges of the graph or a one-to-one map chain thereof. |
class |
TinkerGraphStepStrategy |
Copyright © 2013–2018 Apache Software Foundation. All rights reserved.