| Package | Description | 
|---|---|
| org.apache.tinkerpop.gremlin.process.traversal.strategy.optimization | 
| Class and Description | 
|---|
| AdjacentToIncidentStrategy This 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. | 
| FilterRankingStrategy FilterRankingStrategy reorders filter- and order-steps according to their rank. | 
| IdentityRemovalStrategy IdentityRemovalStrategylooks forIdentityStepinstances and removes them. | 
| IncidentToAdjacentStrategy This strategy looks for  .outE().inV(),.inE().outV()and.bothE().otherV()and replaces these step sequences with.out(),.in()or.both()respectively. | 
| MatchPredicateStrategy MatchWhereStrategy will fold any post- where()step that maintains a traversal constraint intomatch(). | 
| RangeByIsCountStrategy This strategy optimizes any occurrence of  CountGlobalStepfollowed by anIsStep. | 
Copyright © 2013–2015 Apache Software Foundation. All rights reserved.