| Interface | Description | 
|---|---|
| Barrier<B> | A Barrier is any step that requires all left traversers to be processed prior to emitting result traversers to the right. | 
| ByModulating | A  ByModulatingstep is able to takeGraphTraversal.by()calls. | 
| Bypassing | A  ByPassingstep can be stated (at runtime) to simply enact the identity function. | 
| ComparatorHolder<S,C extends Comparable> | |
| FromToModulating | FromToModulating are for  Steps that support from()- and to()-modulation. | 
| Generating<S,E> | A  Generatingstep is one that has a side-effect that needs post-processing prior to being returned. | 
| GraphComputing | A  GraphComputingstep is one that will change its behavior whether its on aGraphComputeror not. | 
| HasContainerHolder | |
| LambdaHolder | This is a marker interface stating that the  Stepcontains a
 lambda/anonymous function. | 
| LocalBarrier<S> | |
| MapReducer<MK,MV,RK,RV,R> | |
| MemoryComputing<M> | |
| Mutating<E extends Event> | A marker interface for steps that modify the graph. | 
| PathProcessor | |
| Profiling | A  Stepcan implement this interface in order to receive a reference to theMutableMetricsobject
 for theStep. | 
| Ranging | |
| Scoping | This interface is implemented by  Stepimplementations that access labeled path steps, side-effects orMapvalues by key, such asselect('a')step. | 
| SideEffectCapable<S,E> | A  SideEffectCapablestep stores a side-effect data structure accessible by a side-effect key. | 
| TimesModulating | A  TimesModulatingstep is one that can do something withGraphTraversal.times(int). | 
| TraversalOptionParent<M,S,E> | |
| TraversalParent | 
| Class | Description | 
|---|---|
| ComplexTest | |
| ComplexTest.Traversals | 
| Enum | Description | 
|---|---|
| PathProcessor.ElementRequirement | |
| Scoping.Variable | |
| TraversalOptionParent.Pick | 
Copyright © 2013–2018 Apache Software Foundation. All rights reserved.