| Modifier and Type | Class and Description | 
|---|---|
| class  | Neo4jGraphStepStrategy | 
| Modifier and Type | Class and Description | 
|---|---|
| static class  | ComputerTraversalEngine.ComputerResultStrategy | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | ConnectiveStrategy | 
| class  | ElementIdStrategyProvides a degree of control over element identifier assignment as some graphs don't provide that feature. | 
| class  | EventStrategyA strategy that raises events when  Mutatingsteps are encountered and successfully executed. | 
| class  | PartitionStrategyPartitionStrategypartitions the vertices, edges and vertex properties of a graph into String named
 partitions (i.e. | 
| class  | SubgraphStrategyThis  TraversalStrategyprovides a way to limit the view of aTraversal. | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | EngineDependentStrategyA  Stepcan extendEngineDependent. | 
| class  | LazyBarrierStrategy | 
| class  | MatchAlgorithmStrategy | 
| class  | ProfileStrategy | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | AdjacentToIncidentStrategyThis strategy looks for vertex- and value-emitting steps followed by a  CountGlobalStepand replaces the
 pattern with an edge- or property-emitting step followed by aCountGlobalStep. | 
| class  | FilterRankingStrategyFilterRankingStrategy reorders filter- and order-steps according to their rank. | 
| class  | IdentityRemovalStrategyIdentityRemovalStrategylooks forIdentityStepinstances and removes them. | 
| class  | IncidentToAdjacentStrategyThis strategy looks for  .outE().inV(),.inE().outV()and.bothE().otherV()and replaces these step sequences with.out(),.in()or.both()respectively. | 
| class  | MatchPredicateStrategyMatchWhereStrategy will fold any post- where()step that maintains a traversal constraint intomatch(). | 
| class  | RangeByIsCountStrategyThis strategy optimizes any occurrence of  CountGlobalStepfollowed by anIsStep. | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | ComputerVerificationStrategy | 
| class  | LambdaRestrictionStrategyLambdaRestrictionStrategydoes not allow lambdas to be used in aTraversal. | 
| class  | ReadOnlyStrategyDetects steps marked with  Mutatingand throws anIllegalStateExceptionif one is found. | 
| class  | StandardVerificationStrategy | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | TinkerGraphStepStrategy | 
Copyright © 2013–2017 Apache Software Foundation. All rights reserved.