static <A> GraphTraversal<A,A> | 
__.__(A... starts) | 
  | 
static <A> GraphTraversal<A,Edge> | 
__.addE(String edgeLabel) | 
  | 
static <A> GraphTraversal<A,Edge> | 
__.addE(Traversal<?,String> edgeLabelTraversal) | 
  | 
default GraphTraversal<S,Edge> | 
GraphTraversal.addE(String edgeLabel) | 
Adds an  Edge with the specified edge label.  
 | 
default GraphTraversal<S,Edge> | 
GraphTraversal.addE(Traversal<?,String> edgeLabelTraversal) | 
 | 
GraphTraversal<Edge,Edge> | 
GraphTraversalSource.addE(String label) | 
 | 
GraphTraversal<Edge,Edge> | 
GraphTraversalSource.addE(Traversal<?,String> edgeLabelTraversal) | 
 | 
static <A> GraphTraversal<A,Vertex> | 
__.addV() | 
  | 
static <A> GraphTraversal<A,Vertex> | 
__.addV(String vertexLabel) | 
  | 
static <A> GraphTraversal<A,Vertex> | 
__.addV(Traversal<?,String> vertexLabelTraversal) | 
  | 
default GraphTraversal<S,Vertex> | 
GraphTraversal.addV() | 
Adds a  Vertex with a default vertex label.  
 | 
default GraphTraversal<S,Vertex> | 
GraphTraversal.addV(String vertexLabel) | 
 | 
default GraphTraversal<S,Vertex> | 
GraphTraversal.addV(Traversal<?,String> vertexLabelTraversal) | 
 | 
GraphTraversal<Vertex,Vertex> | 
GraphTraversalSource.addV() | 
 | 
GraphTraversal<Vertex,Vertex> | 
GraphTraversalSource.addV(String vertexLabel) | 
 | 
GraphTraversal<Vertex,Vertex> | 
GraphTraversalSource.addV(Traversal<?,String> vertexLabelTraversal) | 
 | 
static <A> GraphTraversal<A,A> | 
__.aggregate(String sideEffectKey) | 
  | 
static <A> GraphTraversal<A,A> | 
__.aggregate(Scope scope,
         String sideEffectKey) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.aggregate(String sideEffectKey) | 
 Eagerly collects objects up to this step into a side-effect. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.aggregate(Scope scope,
         String sideEffectKey) | 
Collects objects in a list using the  Scope argument to determine whether it should be lazy
  Scope.local or eager ( Scope.global while gathering those objects.  
 | 
static <A> GraphTraversal<A,A> | 
__.all(P<A> predicate) | 
  | 
default <S2> GraphTraversal<S,E> | 
GraphTraversal.all(P<S2> predicate) | 
 Filters E lists given the provided predicate. 
 | 
static <A> GraphTraversal<A,A> | 
__.and(Traversal<?,?>... andTraversals) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.and(Traversal<?,?>... andTraversals) | 
 Ensures that all of the provided traversals yield a result. 
 | 
static <A> GraphTraversal<A,A> | 
__.any(P<A> predicate) | 
  | 
default <S2> GraphTraversal<S,E> | 
GraphTraversal.any(P<S2> predicate) | 
 Filters E lists given the provided predicate. 
 | 
static <A> GraphTraversal<A,A> | 
__.as(String label,
  String... labels) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.as(String stepLabel,
  String... stepLabels) | 
 A step modulator that provides a label to the step that can be accessed later in the traversal by other steps. 
 | 
static <A> GraphTraversal<A,Date> | 
__.asDate() | 
  | 
default GraphTraversal<S,Date> | 
GraphTraversal.asDate() | 
Parse value of the incoming traverser as an ISO-8601  Date.  
 | 
static <A> GraphTraversal<A,String> | 
__.asString() | 
  | 
static <A,B> GraphTraversal<A,B> | 
__.asString(Scope scope) | 
  | 
default GraphTraversal<S,String> | 
GraphTraversal.asString() | 
 Returns the value of incoming traverser as strings. 
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.asString(Scope scope) | 
 Returns the value of incoming traverser as strings. 
 | 
static <A> GraphTraversal<A,A> | 
__.barrier() | 
  | 
static <A> GraphTraversal<A,A> | 
__.barrier(int maxBarrierSize) | 
  | 
static <A> GraphTraversal<A,A> | 
__.barrier(Consumer<TraverserSet<Object>> barrierConsumer) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.barrier() | 
 Turns the lazy traversal pipeline into a bulk-synchronous pipeline which basically iterates that traversal to
 the size of the barrier. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.barrier(int maxBarrierSize) | 
 Turns the lazy traversal pipeline into a bulk-synchronous pipeline which basically iterates that traversal to
 the size of the barrier. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.barrier(Consumer<TraverserSet<Object>> barrierConsumer) | 
 Turns the lazy traversal pipeline into a bulk-synchronous pipeline which basically iterates that traversal to
 the size of the barrier. 
 | 
static GraphTraversal<Vertex,Vertex> | 
__.both(String... edgeLabels) | 
  | 
default GraphTraversal<S,Vertex> | 
GraphTraversal.both(String... edgeLabels) | 
Map the  Vertex to its adjacent vertices given the edge labels.  
 | 
static GraphTraversal<Vertex,Edge> | 
__.bothE(String... edgeLabels) | 
  | 
default GraphTraversal<S,Edge> | 
GraphTraversal.bothE(String... edgeLabels) | 
Map the  Vertex to its incident edges given the edge labels.  
 | 
static GraphTraversal<Edge,Vertex> | 
__.bothV() | 
  | 
default GraphTraversal<S,Vertex> | 
GraphTraversal.bothV() | 
Map the  Edge to its incident vertices.  
 | 
static <A,M,B> GraphTraversal<A,B> | 
__.branch(Function<Traverser<A>,M> function) | 
  | 
static <A,M,B> GraphTraversal<A,B> | 
__.branch(Traversal<?,M> traversalFunction) | 
  | 
default <M,E2> GraphTraversal<S,E2> | 
GraphTraversal.branch(Function<Traverser<E>,M> function) | 
Split the  Traverser to all the specified functions.  
 | 
default <M,E2> GraphTraversal<S,E2> | 
GraphTraversal.branch(Traversal<?,M> branchTraversal) | 
Split the  Traverser to all the specified traversals.  
 | 
default GraphTraversal<S,E> | 
GraphTraversal.by() | 
 The by() can be applied to a number of different step to alter their behaviors. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.by(String key) | 
 The by() can be applied to a number of different step to alter their behaviors. 
 | 
default <V> GraphTraversal<S,E> | 
GraphTraversal.by(String key,
  Comparator<V> comparator) | 
 The by() can be applied to a number of different step to alter their behaviors. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.by(Comparator<E> comparator) | 
 The by() can be applied to a number of different step to alter their behaviors. 
 | 
default <U> GraphTraversal<S,E> | 
GraphTraversal.by(Function<U,Object> function,
  Comparator comparator) | 
 The by() can be applied to a number of different step to alter their behaviors. 
 | 
default <V> GraphTraversal<S,E> | 
GraphTraversal.by(Function<V,Object> function) | 
 The by() can be applied to a number of different step to alter their behaviors. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.by(Order order) | 
 The by() can be applied to a number of different step to alter their behaviors. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.by(Traversal<?,?> traversal) | 
 The by() can be applied to a number of different step to alter their behaviors. 
 | 
default <V> GraphTraversal<S,E> | 
GraphTraversal.by(Traversal<?,?> traversal,
  Comparator<V> comparator) | 
 The by() can be applied to a number of different step to alter their behaviors. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.by(T token) | 
 The by() can be applied to a number of different step to alter their behaviors. 
 | 
static <A,B> GraphTraversal<A,B> | 
__.call(String service) | 
  | 
static <A,B> GraphTraversal<A,B> | 
__.call(String service,
    Map params) | 
  | 
static <A,B> GraphTraversal<A,B> | 
__.call(String service,
    Map params,
    Traversal<?,Map<?,?>> childTraversal) | 
  | 
static <A,B> GraphTraversal<A,B> | 
__.call(String service,
    Traversal<?,Map<?,?>> childTraversal) | 
  | 
default <E> GraphTraversal<S,E> | 
GraphTraversal.call(String service) | 
 Perform the specified service call with no parameters. 
 | 
default <E> GraphTraversal<S,E> | 
GraphTraversal.call(String service,
    Map params) | 
 Perform the specified service call with the specified static parameters. 
 | 
default <E> GraphTraversal<S,E> | 
GraphTraversal.call(String service,
    Map params,
    Traversal<?,Map<?,?>> childTraversal) | 
 Perform the specified service call with both static and dynamic parameters produced by the specified child
 traversal. 
 | 
default <E> GraphTraversal<S,E> | 
GraphTraversal.call(String service,
    Traversal<?,Map<?,?>> childTraversal) | 
 Perform the specified service call with dynamic parameters produced by the specified child traversal. 
 | 
<S> GraphTraversal<S,S> | 
GraphTraversalSource.call() | 
 | 
<S> GraphTraversal<S,S> | 
GraphTraversalSource.call(String service) | 
Spawns a  GraphTraversal starting with values produced by the specified service call with no parameters.  
 | 
<S> GraphTraversal<S,S> | 
GraphTraversalSource.call(String service,
    Map params) | 
Spawns a  GraphTraversal starting with values produced by the specified service call with the specified
 static parameters.  
 | 
<S> GraphTraversal<S,S> | 
GraphTraversalSource.call(String service,
    Map params,
    Traversal<S,Map> childTraversal) | 
Spawns a  GraphTraversal starting with values produced by the specified service call with both static and
 dynamic parameters produced by the specified child traversal.  
 | 
<S> GraphTraversal<S,S> | 
GraphTraversalSource.call(String service,
    Traversal<S,Map> childTraversal) | 
Spawns a  GraphTraversal starting with values produced by the specified service call with dynamic
 parameters produced by the specified child traversal.  
 | 
static <A,B> GraphTraversal<A,B> | 
__.cap(String sideEffectKey,
   String... sideEffectKeys) | 
  | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.cap(String sideEffectKey,
   String... sideEffectKeys) | 
 Iterates the traversal up to the itself and emits the side-effect referenced by the key. 
 | 
static <A,M,B> GraphTraversal<A,B> | 
__.choose(Function<A,M> choiceFunction) | 
  | 
static <A,B> GraphTraversal<A,B> | 
__.choose(Predicate<A> choosePredicate,
      Traversal<?,B> trueChoice) | 
  | 
static <A,B> GraphTraversal<A,B> | 
__.choose(Predicate<A> choosePredicate,
      Traversal<?,B> trueChoice,
      Traversal<?,B> falseChoice) | 
  | 
static <A,M,B> GraphTraversal<A,B> | 
__.choose(Traversal<?,M> traversalFunction) | 
  | 
static <A,M,B> GraphTraversal<A,B> | 
__.choose(Traversal<?,M> traversalPredicate,
      Traversal<?,B> trueChoice) | 
  | 
static <A,M,B> GraphTraversal<A,B> | 
__.choose(Traversal<?,M> traversalPredicate,
      Traversal<?,B> trueChoice,
      Traversal<?,B> falseChoice) | 
  | 
default <M,E2> GraphTraversal<S,E2> | 
GraphTraversal.choose(Function<E,M> choiceFunction) | 
 Routes the current traverser to a particular traversal branch option which allows the creation of if-then-else
 like semantics within a traversal. 
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.choose(Predicate<E> choosePredicate,
      Traversal<?,E2> trueChoice) | 
 Routes the current traverser to a particular traversal branch option which allows the creation of if-then
 like semantics within a traversal. 
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.choose(Predicate<E> choosePredicate,
      Traversal<?,E2> trueChoice,
      Traversal<?,E2> falseChoice) | 
 Routes the current traverser to a particular traversal branch option which allows the creation of if-then-else
 like semantics within a traversal. 
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.choose(Traversal<?,?> traversalPredicate,
      Traversal<?,E2> trueChoice) | 
 Routes the current traverser to a particular traversal branch option which allows the creation of if-then
 like semantics within a traversal. 
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.choose(Traversal<?,?> traversalPredicate,
      Traversal<?,E2> trueChoice,
      Traversal<?,E2> falseChoice) | 
 Routes the current traverser to a particular traversal branch option which allows the creation of if-then-else
 like semantics within a traversal. 
 | 
default <M,E2> GraphTraversal<S,E2> | 
GraphTraversal.choose(Traversal<?,M> choiceTraversal) | 
 Routes the current traverser to a particular traversal branch option which allows the creation of if-then-else
 like semantics within a traversal. 
 | 
static <A,B> GraphTraversal<A,B> | 
__.coalesce(Traversal<?,B>... traversals) | 
  | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.coalesce(Traversal<?,E2>... coalesceTraversals) | 
 Evaluates the provided traversals and returns the result of the first traversal to emit at least one object. 
 | 
static <A> GraphTraversal<A,A> | 
__.coin(double probability) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.coin(double probability) | 
 Filter the E object given a biased coin toss. 
 | 
static <A> GraphTraversal<A,List<?>> | 
__.combine(Object values) | 
  | 
default GraphTraversal<S,List<?>> | 
GraphTraversal.combine(Object values) | 
 Combines the list traverser and list argument. 
 | 
static <A> GraphTraversal<A,String> | 
__.concat(String... concatString) | 
  | 
static <A> GraphTraversal<A,String> | 
__.concat(Traversal<A,String> concatTraversal,
      Traversal<A,String>... otherConcatTraversals) | 
  | 
default GraphTraversal<S,String> | 
GraphTraversal.concat(String... concatStrings) | 
 Concatenate an arbitrary number of strings to the incoming traverser. 
 | 
default GraphTraversal<S,String> | 
GraphTraversal.concat(Traversal<?,String> concatTraversal,
      Traversal<?,String>... otherConcatTraversals) | 
 Concatenate values of an arbitrary number of string traversals to the incoming traverser. 
 | 
static <A> GraphTraversal<A,String> | 
__.conjoin(String values) | 
  | 
default GraphTraversal<S,String> | 
GraphTraversal.conjoin(String delimiter) | 
 Joins together the elements of the incoming list traverser together with the provided delimiter. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.connectedComponent() | 
 Executes a Connected Component algorithm over the graph. 
 | 
static <A> GraphTraversal<A,A> | 
__.constant(A a) | 
  | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.constant(E2 e) | 
 Map any object to a fixed E value. 
 | 
static <A> GraphTraversal<A,Long> | 
__.count() | 
  | 
static <A> GraphTraversal<A,Long> | 
__.count(Scope scope) | 
  | 
default GraphTraversal<S,Long> | 
GraphTraversal.count() | 
Map the traversal stream to its reduction as a sum of the  Traverser.bulk() values (i.e.  
 | 
default GraphTraversal<S,Long> | 
GraphTraversal.count(Scope scope) | 
Map the traversal stream to its reduction as a sum of the  Traverser.bulk() values given the specified
  Scope (i.e.  
 | 
static <A> GraphTraversal<A,A> | 
__.cyclicPath() | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.cyclicPath() | 
 | 
static <A> GraphTraversal<A,Date> | 
__.dateAdd(DT dateToken,
       int value) | 
  | 
default GraphTraversal<S,Date> | 
GraphTraversal.dateAdd(DT dateToken,
       int value) | 
Increase value of input  Date.  
 | 
static <A> GraphTraversal<A,Long> | 
__.dateDiff(Date value) | 
  | 
static <A> GraphTraversal<A,Long> | 
__.dateDiff(Traversal<?,Date> dateTraversal) | 
  | 
default GraphTraversal<S,Long> | 
GraphTraversal.dateDiff(Date value) | 
Returns the difference between two  Date in epoch time.  
 | 
default GraphTraversal<S,Long> | 
GraphTraversal.dateDiff(Traversal<?,Date> dateTraversal) | 
Returns the difference between two  Date in epoch time.  
 | 
static <A> GraphTraversal<A,A> | 
__.dedup(String... dedupLabels) | 
  | 
static <A> GraphTraversal<A,A> | 
__.dedup(Scope scope,
     String... dedupLabels) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.dedup(String... dedupLabels) | 
 Remove all duplicates in the traversal stream up to this point. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.dedup(Scope scope,
     String... dedupLabels) | 
 Remove all duplicates in the traversal stream up to this point. 
 | 
static <A> GraphTraversal<A,Set<?>> | 
__.difference(Object values) | 
  | 
default GraphTraversal<S,Set<?>> | 
GraphTraversal.difference(Object values) | 
 Calculates the difference between the list traverser and list argument. 
 | 
static <A> GraphTraversal<A,Set<?>> | 
__.disjunct(Object values) | 
  | 
default GraphTraversal<S,Set<?>> | 
GraphTraversal.disjunct(Object values) | 
 Calculates the disjunction between the list traverser and list argument. 
 | 
static <A> GraphTraversal<A,A> | 
__.drop() | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.drop() | 
 Removes elements and properties from the graph. 
 | 
static <A> GraphTraversal<A,Edge> | 
__.E(Object... edgeIdsOrElements) | 
  | 
default GraphTraversal<S,Edge> | 
GraphTraversal.E(Object... edgeIdsOrElements) | 
 A E step is usually used to start a traversal but it may also be used mid-traversal. 
 | 
GraphTraversal<Edge,Edge> | 
GraphTraversalSource.E(Object... edgeIds) | 
Spawns a  GraphTraversal starting with all edges or some subset of edges as specified by their unique
 identifier.  
 | 
static <A,B> GraphTraversal<A,Element> | 
__.element() | 
  | 
default GraphTraversal<S,Element> | 
GraphTraversal.element() | 
 | 
static <A extends Element,B> GraphTraversal<A,Map<Object,B>> | 
__.elementMap(String... propertyKeys) | 
  | 
default <E2> GraphTraversal<S,Map<Object,E2>> | 
GraphTraversal.elementMap(String... propertyKeys) | 
 | 
static <A> GraphTraversal<A,A> | 
__.emit() | 
  | 
static <A> GraphTraversal<A,A> | 
__.emit(Predicate<Traverser<A>> emitPredicate) | 
  | 
static <A> GraphTraversal<A,A> | 
__.emit(Traversal<?,?> emitTraversal) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.emit() | 
Emit is used in conjunction with  repeat(Traversal) to emit all objects from the loop.  
 | 
default GraphTraversal<S,E> | 
GraphTraversal.emit(Predicate<Traverser<E>> emitPredicate) | 
Emit is used in conjunction with  repeat(Traversal) to determine what objects get emit from the loop.  
 | 
default GraphTraversal<S,E> | 
GraphTraversal.emit(Traversal<?,?> emitTraversal) | 
Emit is used in conjunction with  repeat(Traversal) to determine what objects get emit from the loop.  
 | 
static <A> GraphTraversal<A,A> | 
__.fail() | 
  | 
static <A> GraphTraversal<A,A> | 
__.fail(String message) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.fail() | 
When triggered, immediately throws a  RuntimeException which implements the  Failure interface.  
 | 
default GraphTraversal<S,E> | 
GraphTraversal.fail(String message) | 
When triggered, immediately throws a  RuntimeException which implements the  Failure interface.  
 | 
static <A> GraphTraversal<A,A> | 
__.filter(Predicate<Traverser<A>> predicate) | 
  | 
static <A> GraphTraversal<A,A> | 
__.filter(Traversal<?,?> filterTraversal) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.filter(Predicate<Traverser<E>> predicate) | 
Map the  Traverser to either  true or  false, where  false will not pass the
 traverser to the next step.  
 | 
default GraphTraversal<S,E> | 
GraphTraversal.filter(Traversal<?,?> filterTraversal) | 
Map the  Traverser to either  true or  false, where  false will not pass the
 traverser to the next step.  
 | 
static <A,B> GraphTraversal<A,B> | 
__.flatMap(Function<Traverser<A>,Iterator<B>> function) | 
  | 
static <A,B> GraphTraversal<A,B> | 
__.flatMap(Traversal<?,B> flatMapTraversal) | 
  | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.flatMap(Function<Traverser<E>,Iterator<E2>> function) | 
Map a  Traverser referencing an object of type  E to an iterator of objects of type  E2.  
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.flatMap(Traversal<?,E2> flatMapTraversal) | 
Map a  Traverser referencing an object of type  E to an iterator of objects of type  E2.  
 | 
static <A> GraphTraversal<A,List<A>> | 
__.fold() | 
  | 
static <A,B> GraphTraversal<A,B> | 
__.fold(B seed,
    BiFunction<B,A,B> foldFunction) | 
  | 
default GraphTraversal<S,List<E>> | 
GraphTraversal.fold() | 
 Rolls up objects in the stream into an aggregate list. 
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.fold(E2 seed,
    BiFunction<E2,E,E2> foldFunction) | 
 Rolls up objects in the stream into an aggregate value as defined by a seed and BiFunction. 
 | 
static <A> GraphTraversal<A,String> | 
__.format(String format) | 
  | 
default GraphTraversal<S,String> | 
GraphTraversal.format(String format) | 
 A mid-traversal step which will handle result formatting to string values. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.from(String fromStepLabel) | 
 Provide from()-modulation to respective steps. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.from(Traversal<?,Vertex> fromVertex) | 
When used as a modifier to  addE(String) this method specifies the traversal to use for selecting the
 outgoing vertex of the newly added  Edge.  
 | 
default GraphTraversal<S,E> | 
GraphTraversal.from(Vertex fromVertex) | 
When used as a modifier to  addE(String) this method specifies the traversal to use for selecting the
 outgoing vertex of the newly added  Edge.  
 | 
static <A,K,V> GraphTraversal<A,Map<K,V>> | 
__.group() | 
  | 
static <A> GraphTraversal<A,A> | 
__.group(String sideEffectKey) | 
  | 
default <K,V> GraphTraversal<S,Map<K,V>> | 
GraphTraversal.group() | 
 Organize objects in the stream into a Map. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.group(String sideEffectKey) | 
 Organize objects in the stream into a Map. 
 | 
static <A,K> GraphTraversal<A,Map<K,Long>> | 
__.groupCount() | 
  | 
static <A> GraphTraversal<A,A> | 
__.groupCount(String sideEffectKey) | 
  | 
default <K> GraphTraversal<S,Map<K,Long>> | 
GraphTraversal.groupCount() | 
 Counts the number of times a particular objects has been part of a traversal, returning a Map where the
 object is the key and the value is the count. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.groupCount(String sideEffectKey) | 
 Counts the number of times a particular objects has been part of a traversal, returning a Map where the
 object is the key and the value is the count. 
 | 
static <A> GraphTraversal<A,A> | 
__.has(String propertyKey) | 
  | 
static <A> GraphTraversal<A,A> | 
__.has(String propertyKey,
   Object value) | 
  | 
static <A> GraphTraversal<A,A> | 
__.has(String label,
   String propertyKey,
   Object value) | 
  | 
static <A> GraphTraversal<A,A> | 
__.has(String label,
   String propertyKey,
   P<?> predicate) | 
  | 
static <A> GraphTraversal<A,A> | 
__.has(String propertyKey,
   P<?> predicate) | 
  | 
static <A> GraphTraversal<A,A> | 
__.has(String propertyKey,
   Traversal<?,?> propertyTraversal) | 
  | 
static <A> GraphTraversal<A,A> | 
__.has(T accessor,
   Object value) | 
  | 
static <A> GraphTraversal<A,A> | 
__.has(T accessor,
   P<?> predicate) | 
  | 
static <A> GraphTraversal<A,A> | 
__.has(T accessor,
   Traversal<?,?> propertyTraversal) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.has(String propertyKey) | 
 Filters vertices, edges and vertex properties based on the existence of properties. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.has(String propertyKey,
   Object value) | 
 Filters vertices, edges and vertex properties based on their properties. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.has(String label,
   String propertyKey,
   Object value) | 
 Filters vertices, edges and vertex properties based on their properties. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.has(String label,
   String propertyKey,
   P<?> predicate) | 
 Filters vertices, edges and vertex properties based on their properties. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.has(String propertyKey,
   P<?> predicate) | 
 Filters vertices, edges and vertex properties based on their properties. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.has(String propertyKey,
   Traversal<?,?> propertyTraversal) | 
 Filters vertices, edges and vertex properties based on the value of the specified property key. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.has(T accessor,
   Object value) | 
 Filters vertices, edges and vertex properties based on their properties. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.has(T accessor,
   P<?> predicate) | 
 Filters vertices, edges and vertex properties based on their properties. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.has(T accessor,
   Traversal<?,?> propertyTraversal) | 
Filters vertices, edges and vertex properties based on their value of  T where only  T.id and
  T.label are supported.  
 | 
static <A> GraphTraversal<A,A> | 
__.hasId(Object id,
     Object... otherIds) | 
  | 
static <A> GraphTraversal<A,A> | 
__.hasId(P<?> predicate) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.hasId(Object id,
     Object... otherIds) | 
 Filters vertices, edges and vertex properties based on their identifier. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.hasId(P<?> predicate) | 
 Filters vertices, edges and vertex properties based on their identifier. 
 | 
static <A> GraphTraversal<A,A> | 
__.hasKey(String label,
      String... otherLabels) | 
  | 
static <A> GraphTraversal<A,A> | 
__.hasKey(P<String> predicate) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.hasKey(String label,
      String... otherLabels) | 
Filters  Property objects based on their key.  
 | 
default GraphTraversal<S,E> | 
GraphTraversal.hasKey(P<String> predicate) | 
Filters  Property objects based on their key.  
 | 
static <A> GraphTraversal<A,A> | 
__.hasLabel(String label,
        String... otherLabels) | 
  | 
static <A> GraphTraversal<A,A> | 
__.hasLabel(P<String> predicate) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.hasLabel(String label,
        String... otherLabels) | 
 Filters vertices, edges and vertex properties based on their label. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.hasLabel(P<String> predicate) | 
 Filters vertices, edges and vertex properties based on their label. 
 | 
static <A> GraphTraversal<A,A> | 
__.hasNot(String propertyKey) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.hasNot(String propertyKey) | 
 Filters vertices, edges and vertex properties based on the non-existence of properties. 
 | 
static <A> GraphTraversal<A,A> | 
__.hasValue(Object value,
        Object... values) | 
  | 
static <A> GraphTraversal<A,A> | 
__.hasValue(P<?> predicate) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.hasValue(Object value,
        Object... otherValues) | 
Filters  Property objects based on their value.  
 | 
default GraphTraversal<S,E> | 
GraphTraversal.hasValue(P<?> predicate) | 
 | 
static <A extends Element> GraphTraversal<A,Object> | 
__.id() | 
  | 
default GraphTraversal<S,Object> | 
GraphTraversal.id() | 
 | 
static <A> GraphTraversal<A,A> | 
__.identity() | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.identity() | 
 Map the E object to itself. 
 | 
static GraphTraversal<Vertex,Vertex> | 
__.in(String... edgeLabels) | 
  | 
default GraphTraversal<S,Vertex> | 
GraphTraversal.in(String... edgeLabels) | 
Map the  Vertex to its incoming adjacent vertices given the edge labels.  
 | 
static <A,B> GraphTraversal<A,B> | 
__.index() | 
  | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.index() | 
 Indexes all items of the current collection. 
 | 
static GraphTraversal<Vertex,Edge> | 
__.inE(String... edgeLabels) | 
  | 
default GraphTraversal<S,Edge> | 
GraphTraversal.inE(String... edgeLabels) | 
Map the  Vertex to its incoming incident edges given the edge labels.  
 | 
static <A> GraphTraversal<A,A> | 
__.inject(A... injections) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.inject(E... injections) | 
 Provides a way to add arbitrary objects to a traversal stream. 
 | 
<S> GraphTraversal<S,S> | 
GraphTraversalSource.inject(S... starts) | 
 | 
static <A> GraphTraversal<A,Set<?>> | 
__.intersect(Object values) | 
  | 
default GraphTraversal<S,Set<?>> | 
GraphTraversal.intersect(Object values) | 
 Calculates the intersection between the list traverser and list argument. 
 | 
static GraphTraversal<Edge,Vertex> | 
__.inV() | 
  | 
default GraphTraversal<S,Vertex> | 
GraphTraversal.inV() | 
Map the  Edge to its incoming/head incident  Vertex.  
 | 
<S> GraphTraversal<S,S> | 
GraphTraversalSource.io(String file) | 
Performs a read or write based operation on the  Graph backing this  GraphTraversalSource.  
 | 
static <A> GraphTraversal<A,A> | 
__.is(Object value) | 
  | 
static <A> GraphTraversal<A,A> | 
__.is(P<A> predicate) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.is(Object value) | 
Filter the  E object if it is not  P.eq(V) to the provided value.  
 | 
default GraphTraversal<S,E> | 
GraphTraversal.is(P<E> predicate) | 
 Filters E object values given the provided predicate. 
 | 
GraphTraversal<S,E> | 
DefaultGraphTraversal.iterate() | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.Admin.iterate() | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.iterate() | 
 Iterates the traversal presumably for the generation of side-effects. 
 | 
static <A extends Property> GraphTraversal<A,String> | 
__.key() | 
  | 
default GraphTraversal<S,String> | 
GraphTraversal.key() | 
 | 
static <A extends Element> GraphTraversal<A,String> | 
__.label() | 
  | 
default GraphTraversal<S,String> | 
GraphTraversal.label() | 
 | 
static <A> GraphTraversal<A,Integer> | 
__.length() | 
  | 
static <A,B> GraphTraversal<A,B> | 
__.length(Scope scope) | 
  | 
default GraphTraversal<S,Integer> | 
GraphTraversal.length() | 
 Returns the length incoming string traverser. 
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.length(Scope scope) | 
 Returns the length incoming string or list. 
 | 
static <A> GraphTraversal<A,A> | 
__.limit(long limit) | 
  | 
static <A> GraphTraversal<A,A> | 
__.limit(Scope scope,
     long limit) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.limit(long limit) | 
 Filter the objects in the traversal by the number of them to pass through the stream, where only the first
 n objects are allowed as defined by the limit argument. 
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.limit(Scope scope,
     long limit) | 
Filter the objects in the traversal by the number of them to pass through the stream given the  Scope,
 where only the first  n objects are allowed as defined by the  limit argument.  
 | 
static <A,B> GraphTraversal<A,B> | 
__.local(Traversal<?,B> localTraversal) | 
  | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.local(Traversal<?,E2> localTraversal) | 
 Provides a execute a specified traversal on a single element within a stream. 
 | 
static <A> GraphTraversal<A,Integer> | 
__.loops() | 
  | 
static <A> GraphTraversal<A,Integer> | 
__.loops(String loopName) | 
  | 
default GraphTraversal<S,Integer> | 
GraphTraversal.loops() | 
If the  Traverser supports looping then calling this method will extract the number of loops for that
 traverser.  
 | 
default GraphTraversal<S,Integer> | 
GraphTraversal.loops(String loopName) | 
If the  Traverser supports looping then calling this method will extract the number of loops for that
 traverser for the named loop.  
 | 
static <A> GraphTraversal<A,String> | 
__.lTrim() | 
  | 
static <A,B> GraphTraversal<A,B> | 
__.lTrim(Scope scope) | 
  | 
default GraphTraversal<S,String> | 
GraphTraversal.lTrim() | 
 Returns a string with leading whitespace removed. 
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.lTrim(Scope scope) | 
 Returns a string with leading whitespace removed. 
 | 
static <A,B> GraphTraversal<A,B> | 
__.map(Function<Traverser<A>,B> function) | 
  | 
static <A,B> GraphTraversal<A,B> | 
__.map(Traversal<?,B> mapTraversal) | 
  | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.map(Function<Traverser<E>,E2> function) | 
Map a  Traverser referencing an object of type  E to an object of type  E2.  
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.map(Traversal<?,E2> mapTraversal) | 
Map a  Traverser referencing an object of type  E to an object of type  E2.  
 | 
static <A,B> GraphTraversal<A,Map<String,B>> | 
__.match(Traversal<?,?>... matchTraversals) | 
  | 
default <E2> GraphTraversal<S,Map<String,E2>> | 
GraphTraversal.match(Traversal<?,?>... matchTraversals) | 
Map the  Traverser to a  Map of bindings as specified by the provided match traversals.  
 | 
static <A> GraphTraversal<A,Double> | 
__.math(String expression) | 
  | 
default GraphTraversal<S,Double> | 
GraphTraversal.math(String expression) | 
Map the  Traverser to a  Double according to the mathematical expression provided in the argument.  
 | 
static <A,B extends Comparable> GraphTraversal<A,B> | 
__.max() | 
  | 
static <A,B extends Comparable> GraphTraversal<A,B> | 
__.max(Scope scope) | 
  | 
default <E2 extends Comparable> GraphTraversal<S,E2> | 
GraphTraversal.max() | 
 Determines the largest value in the stream. 
 | 
default <E2 extends Comparable> GraphTraversal<S,E2> | 
GraphTraversal.max(Scope scope) | 
Determines the largest value in the stream given the  Scope.  
 | 
static <A> GraphTraversal<A,Double> | 
__.mean() | 
  | 
static <A> GraphTraversal<A,Double> | 
__.mean(Scope scope) | 
  | 
default <E2 extends Number> GraphTraversal<S,E2> | 
GraphTraversal.mean() | 
 Determines the mean value in the stream. 
 | 
default <E2 extends Number> GraphTraversal<S,E2> | 
GraphTraversal.mean(Scope scope) | 
Determines the mean value in the stream given the  Scope.  
 | 
static <A,B> GraphTraversal<A,B> | 
__.merge(Object values) | 
  | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.merge(Object values) | 
 Merges the list traverser and list argument. 
 | 
static <A> GraphTraversal<A,Edge> | 
__.mergeE() | 
  | 
static <A> GraphTraversal<A,Edge> | 
__.mergeE(Map<Object,Object> searchCreate) | 
  | 
static <A> GraphTraversal<A,Edge> | 
__.mergeE(Traversal<?,Map<Object,Object>> searchCreate) | 
  | 
default GraphTraversal<S,Edge> | 
GraphTraversal.mergeE() | 
 | 
default GraphTraversal<S,Edge> | 
GraphTraversal.mergeE(Map<Object,Object> searchCreate) | 
 | 
default GraphTraversal<S,Edge> | 
GraphTraversal.mergeE(Traversal<?,Map<Object,Object>> searchCreate) | 
 | 
GraphTraversal<Edge,Edge> | 
GraphTraversalSource.mergeE(Map<?,Object> searchCreate) | 
 | 
GraphTraversal<Edge,Edge> | 
GraphTraversalSource.mergeE(Traversal<?,Map<Object,Object>> searchCreate) | 
 | 
static <A> GraphTraversal<A,Vertex> | 
__.mergeV() | 
  | 
static <A> GraphTraversal<A,Vertex> | 
__.mergeV(Map<Object,Object> searchCreate) | 
  | 
static <A> GraphTraversal<A,Vertex> | 
__.mergeV(Traversal<?,Map<Object,Object>> searchCreate) | 
  | 
default GraphTraversal<S,Vertex> | 
GraphTraversal.mergeV() | 
 Performs a merge (i.e. 
 | 
default GraphTraversal<S,Vertex> | 
GraphTraversal.mergeV(Map<Object,Object> searchCreate) | 
 Performs a merge (i.e. 
 | 
default GraphTraversal<S,Vertex> | 
GraphTraversal.mergeV(Traversal<?,Map<Object,Object>> searchCreate) | 
 Performs a merge (i.e. 
 | 
GraphTraversal<Vertex,Vertex> | 
GraphTraversalSource.mergeV(Map<Object,Object> searchCreate) | 
 | 
<S> GraphTraversal<S,Vertex> | 
GraphTraversalSource.mergeV(Traversal<?,Map<Object,Object>> searchCreate) | 
 | 
static <A,B extends Comparable> GraphTraversal<A,B> | 
__.min() | 
  | 
static <A,B extends Comparable> GraphTraversal<A,B> | 
__.min(Scope scope) | 
  | 
default <E2 extends Comparable> GraphTraversal<S,E2> | 
GraphTraversal.min() | 
 Determines the smallest value in the stream. 
 | 
default <E2 extends Comparable> GraphTraversal<S,E2> | 
GraphTraversal.min(Scope scope) | 
Determines the smallest value in the stream given the  Scope.  
 | 
static <A> GraphTraversal<A,A> | 
__.none() | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.none() | 
 Filter all traversers in the traversal. 
 | 
static <A> GraphTraversal<A,A> | 
__.not(Traversal<?,?> notTraversal) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.not(Traversal<?,?> notTraversal) | 
 Removes objects from the traversal stream when the traversal provided as an argument returns any objects. 
 | 
default <M,E2> GraphTraversal<S,E> | 
GraphTraversal.option(M token,
      Map<Object,Object> m) | 
This is a step modulator to a  TraversalOptionParent like  choose() or  mergeV() where the
 provided argument associated to the  token is applied according to the semantics of the step.  
 | 
default <M,E2> GraphTraversal<S,E> | 
GraphTraversal.option(M token,
      Traversal<?,E2> traversalOption) | 
This is a step modulator to a  TraversalOptionParent like  choose() or  mergeV() where the
 provided argument associated to the  token is applied according to the semantics of the step.  
 | 
default <M,E2> GraphTraversal<S,E> | 
GraphTraversal.option(Merge merge,
      Map<Object,Object> m,
      VertexProperty.Cardinality cardinality) | 
This is a step modulator to  mergeV() where the provided argument associated to the  token is
 applied according to the semantics of the step.  
 | 
default <E2> GraphTraversal<S,E> | 
GraphTraversal.option(Traversal<?,E2> traversalOption) | 
This step modifies  choose(Function) to specifies the available choices that might be executed.  
 | 
static <A> GraphTraversal<A,A> | 
__.optional(Traversal<?,A> optionalTraversal) | 
  | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.optional(Traversal<?,E2> optionalTraversal) | 
 Returns the result of the specified traversal if it yields a result, otherwise it returns the calling element. 
 | 
static <A> GraphTraversal<A,A> | 
__.or(Traversal<?,?>... orTraversals) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.or(Traversal<?,?>... orTraversals) | 
 Ensures that at least one of the provided traversals yield a result. 
 | 
static <A> GraphTraversal<A,A> | 
__.order() | 
  | 
static <A> GraphTraversal<A,A> | 
__.order(Scope scope) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.order() | 
 Order all the objects in the traversal up to this point and then emit them one-by-one in their ordered sequence. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.order(Scope scope) | 
 | 
static GraphTraversal<Edge,Vertex> | 
__.otherV() | 
  | 
default GraphTraversal<S,Vertex> | 
GraphTraversal.otherV() | 
Map the  Edge to the incident vertex that was not just traversed from in the path history.  
 | 
static GraphTraversal<Vertex,Vertex> | 
__.out(String... edgeLabels) | 
  | 
default GraphTraversal<S,Vertex> | 
GraphTraversal.out(String... edgeLabels) | 
Map the  Vertex to its outgoing adjacent vertices given the edge labels.  
 | 
static GraphTraversal<Vertex,Edge> | 
__.outE(String... edgeLabels) | 
  | 
default GraphTraversal<S,Edge> | 
GraphTraversal.outE(String... edgeLabels) | 
Map the  Vertex to its outgoing incident edges given the edge labels.  
 | 
static GraphTraversal<Edge,Vertex> | 
__.outV() | 
  | 
default GraphTraversal<S,Vertex> | 
GraphTraversal.outV() | 
Map the  Edge to its outgoing/tail incident  Vertex.  
 | 
default GraphTraversal<S,E> | 
GraphTraversal.pageRank() | 
 Calculates a PageRank over the graph using a 0.85 for the alpha value. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.pageRank(double alpha) | 
 Calculates a PageRank over the graph. 
 | 
static <A> GraphTraversal<A,Path> | 
__.path() | 
  | 
default GraphTraversal<S,Path> | 
GraphTraversal.path() | 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.peerPressure() | 
 Executes a Peer Pressure community detection algorithm over the graph. 
 | 
static <A> GraphTraversal<A,List<List<?>>> | 
__.product(Object values) | 
  | 
default GraphTraversal<S,List<List<?>>> | 
GraphTraversal.product(Object values) | 
 Calculates the cartesian product between the list traverser and list argument. 
 | 
default GraphTraversal<S,TraversalMetrics> | 
GraphTraversal.profile() | 
 Allows developers to examine statistical information about a traversal providing data like execution times,
 counts, etc. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.profile(String sideEffectKey) | 
 Allows developers to examine statistical information about a traversal providing data like execution times,
 counts, etc. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.program(VertexProgram<?> vertexProgram) | 
 | 
static <A,B> GraphTraversal<A,Map<String,B>> | 
__.project(String projectKey,
       String... projectKeys) | 
  | 
default <E2> GraphTraversal<S,Map<String,E2>> | 
GraphTraversal.project(String projectKey,
       String... otherProjectKeys) | 
 Projects the current object in the stream into a Map that is keyed by the provided labels. 
 | 
static <A extends Element,B> GraphTraversal<A,? extends Property<B>> | 
__.properties(String... propertyKeys) | 
  | 
default <E2> GraphTraversal<S,? extends Property<E2>> | 
GraphTraversal.properties(String... propertyKeys) | 
Map the  Element to its associated properties given the provide property keys.  
 | 
static <A> GraphTraversal<A,A> | 
__.property(Object key,
        Object value,
        Object... keyValues) | 
  | 
static <A> GraphTraversal<A,A> | 
__.property(Map<Object,Object> value) | 
  | 
static <A> GraphTraversal<A,A> | 
__.property(VertexProperty.Cardinality cardinality,
        Object key,
        Object value,
        Object... keyValues) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.property(Object key,
        Object value,
        Object... keyValues) | 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.property(Map<Object,Object> value) | 
When a  Map is supplied then each of the key/value pairs in the map will
 be added as property.  
 | 
default GraphTraversal<S,E> | 
GraphTraversal.property(VertexProperty.Cardinality cardinality,
        Object key,
        Object value,
        Object... keyValues) | 
 | 
static <A extends Element,B> GraphTraversal<A,Map<String,B>> | 
__.propertyMap(String... propertyKeys) | 
  | 
default <E2> GraphTraversal<S,Map<String,E2>> | 
GraphTraversal.propertyMap(String... propertyKeys) | 
 | 
static <A> GraphTraversal<A,A> | 
__.range(long low,
     long high) | 
  | 
static <A> GraphTraversal<A,A> | 
__.range(Scope scope,
     long low,
     long high) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.range(long low,
     long high) | 
 Filter the objects in the traversal by the number of them to pass through the stream. 
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.range(Scope scope,
     long low,
     long high) | 
Filter the objects in the traversal by the number of them to pass through the stream as constrained by the
  Scope.  
 | 
default GraphTraversal<S,E> | 
GraphTraversal.read() | 
This step is technically a step modulator for the the  GraphTraversalSource.io(String) step which
 instructs the step to perform a read with its given configuration.  
 | 
static <A> GraphTraversal<A,A> | 
__.repeat(String loopName,
      Traversal<?,A> traversal) | 
  | 
static <A> GraphTraversal<A,A> | 
__.repeat(Traversal<?,A> traversal) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.repeat(String loopName,
      Traversal<?,E> repeatTraversal) | 
 This step is used for looping over a traversal given some break predicate and with a specified loop name. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.repeat(Traversal<?,E> repeatTraversal) | 
 This step is used for looping over a traversal given some break predicate. 
 | 
static <A> GraphTraversal<A,String> | 
__.replace(String oldChar,
       String newChar) | 
  | 
static <A,B> GraphTraversal<A,B> | 
__.replace(Scope scope,
       String oldChar,
       String newChar) | 
  | 
default GraphTraversal<S,String> | 
GraphTraversal.replace(String oldChar,
       String newChar) | 
 Returns a string with the specified characters in the original string replaced with the new characters. 
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.replace(Scope scope,
       String oldChar,
       String newChar) | 
 Returns a string with the specified characters in the original string replaced with the new characters. 
 | 
static <A,B> GraphTraversal<A,B> | 
__.reverse() | 
  | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.reverse() | 
 Returns the reverse of the incoming traverser. 
 | 
static <A> GraphTraversal<A,String> | 
__.rTrim() | 
  | 
static <A,B> GraphTraversal<A,B> | 
__.rTrim(Scope scope) | 
  | 
default GraphTraversal<S,String> | 
GraphTraversal.rTrim() | 
 Returns a string with trailing whitespace removed. 
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.rTrim(Scope scope) | 
 Returns a string with trailing whitespace removed. 
 | 
static <A,B> GraphTraversal<A,B> | 
__.sack() | 
  | 
static <A,V,U> GraphTraversal<A,A> | 
__.sack(BiFunction<V,U,V> sackOperator) | 
  | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.sack() | 
 | 
default <V,U> GraphTraversal<S,E> | 
GraphTraversal.sack(BiFunction<V,U,V> sackOperator) | 
 | 
static <A> GraphTraversal<A,A> | 
__.sample(int amountToSample) | 
  | 
static <A> GraphTraversal<A,A> | 
__.sample(Scope scope,
      int amountToSample) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.sample(int amountToSample) | 
 Allow some specified number of objects to pass through the stream. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.sample(Scope scope,
      int amountToSample) | 
 Allow some specified number of objects to pass through the stream. 
 | 
static <A,B> GraphTraversal<A,B> | 
__.select(String selectKey) | 
  | 
static <A,B> GraphTraversal<A,Map<String,B>> | 
__.select(String selectKey1,
      String selectKey2,
      String... otherSelectKeys) | 
  | 
static <A,B> GraphTraversal<A,B> | 
__.select(Pop pop,
      String selectKey) | 
  | 
static <A,B> GraphTraversal<A,Map<String,B>> | 
__.select(Pop pop,
      String selectKey1,
      String selectKey2,
      String... otherSelectKeys) | 
  | 
static <A,B> GraphTraversal<A,B> | 
__.select(Pop pop,
      Traversal<A,B> keyTraversal) | 
  | 
static <A,B> GraphTraversal<A,B> | 
__.select(Traversal<A,B> keyTraversal) | 
  | 
static <A,B> GraphTraversal<A,Collection<B>> | 
__.select(Column column) | 
  | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.select(String selectKey) | 
Map the  Traverser to the object specified by the  selectKey.  
 | 
default <E2> GraphTraversal<S,Map<String,E2>> | 
GraphTraversal.select(String selectKey1,
      String selectKey2,
      String... otherSelectKeys) | 
Map the  Traverser to a  Map projection of sideEffect values, map values, and/or path values.  
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.select(Pop pop,
      String selectKey) | 
Map the  Traverser to the object specified by the  selectKey and apply the  Pop operation
 to it.  
 | 
default <E2> GraphTraversal<S,Map<String,E2>> | 
GraphTraversal.select(Pop pop,
      String selectKey1,
      String selectKey2,
      String... otherSelectKeys) | 
Map the  Traverser to a  Map projection of sideEffect values, map values, and/or path values.  
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.select(Pop pop,
      Traversal<S,E2> keyTraversal) | 
Map the  Traverser to the object specified by the key returned by the  keyTraversal and apply the  Pop operation
 to it.  
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.select(Traversal<S,E2> keyTraversal) | 
Map the  Traverser to the object specified by the key returned by the  keyTraversal.  
 | 
default <E2> GraphTraversal<S,Collection<E2>> | 
GraphTraversal.select(Column column) | 
A version of  select that allows for the extraction of a  Column from objects in the traversal.  
 | 
default GraphTraversal<S,Path> | 
GraphTraversal.shortestPath() | 
 Executes a Shortest Path algorithm over the graph. 
 | 
static <A> GraphTraversal<A,A> | 
__.sideEffect(Consumer<Traverser<A>> consumer) | 
  | 
static <A> GraphTraversal<A,A> | 
__.sideEffect(Traversal<?,?> sideEffectTraversal) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.sideEffect(Consumer<Traverser<E>> consumer) | 
Perform some operation on the  Traverser and pass it to the next step unmodified.  
 | 
default GraphTraversal<S,E> | 
GraphTraversal.sideEffect(Traversal<?,?> sideEffectTraversal) | 
Perform some operation on the  Traverser and pass it to the next step unmodified.  
 | 
static <A> GraphTraversal<A,A> | 
__.simplePath() | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.simplePath() | 
 | 
static <A> GraphTraversal<A,A> | 
__.skip(long skip) | 
  | 
static <A> GraphTraversal<A,A> | 
__.skip(Scope scope,
    long skip) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.skip(long skip) | 
 Filters out the first n objects in the traversal. 
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.skip(Scope scope,
    long skip) | 
 Filters out the first n objects in the traversal. 
 | 
static <A> GraphTraversal<A,List<String>> | 
__.split(String separator) | 
  | 
static <A,B> GraphTraversal<A,List<B>> | 
__.split(Scope scope,
     String separator) | 
  | 
default GraphTraversal<S,List<String>> | 
GraphTraversal.split(String separator) | 
 Returns a list of strings created by splitting the incoming string traverser around the matches of the given separator. 
 | 
default <E2> GraphTraversal<S,List<E2>> | 
GraphTraversal.split(Scope scope,
     String separator) | 
 Returns a list of strings created by splitting the incoming string traverser around the matches of the given separator. 
 | 
static <A> GraphTraversal<A,A> | 
__.start() | 
  | 
static <A> GraphTraversal<A,A> | 
__.store(String sideEffectKey) | 
 Deprecated.
 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.store(String sideEffectKey) | 
 Deprecated.
 
 | 
static <A> GraphTraversal<A,Edge> | 
__.subgraph(String sideEffectKey) | 
  | 
default GraphTraversal<S,Edge> | 
GraphTraversal.subgraph(String sideEffectKey) | 
Extracts a portion of the graph being traversed into a  Graph object held in the specified side-effect
 key.  
 | 
static <A> GraphTraversal<A,String> | 
__.substring(int startIndex) | 
  | 
static <A> GraphTraversal<A,String> | 
__.substring(int startIndex,
         int endIndex) | 
  | 
static <A,B> GraphTraversal<A,B> | 
__.substring(Scope scope,
         int startIndex) | 
  | 
static <A,B> GraphTraversal<A,B> | 
__.substring(Scope scope,
         int startIndex,
         int endIndex) | 
  | 
default GraphTraversal<S,String> | 
GraphTraversal.substring(int startIndex) | 
 Returns a substring of the incoming string traverser with a 0-based start index (inclusive) specified,
 to the end of the string. 
 | 
default GraphTraversal<S,String> | 
GraphTraversal.substring(int startIndex,
         int endIndex) | 
 Returns a substring of the incoming string traverser with a 0-based start index (inclusive) and end index
 (exclusive). 
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.substring(Scope scope,
         int startIndex) | 
 Returns a substring of the incoming string traverser with a 0-based start index (inclusive) specified,
 to the end of the string. 
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.substring(Scope scope,
         int startIndex,
         int endIndex) | 
 Returns a substring of the incoming string traverser with a 0-based start index (inclusive) and end index
 (exclusive). 
 | 
static <A> GraphTraversal<A,Double> | 
__.sum() | 
  | 
static <A> GraphTraversal<A,Double> | 
__.sum(Scope scope) | 
  | 
default <E2 extends Number> GraphTraversal<S,E2> | 
GraphTraversal.sum() | 
 | 
default <E2 extends Number> GraphTraversal<S,E2> | 
GraphTraversal.sum(Scope scope) | 
 | 
static <A> GraphTraversal<A,A> | 
__.tail() | 
  | 
static <A> GraphTraversal<A,A> | 
__.tail(long limit) | 
  | 
static <A> GraphTraversal<A,A> | 
__.tail(Scope scope) | 
  | 
static <A> GraphTraversal<A,A> | 
__.tail(Scope scope,
    long limit) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.tail() | 
 Filters the objects in the traversal emitted as being last objects in the stream. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.tail(long limit) | 
 Filters the objects in the traversal emitted as being last objects in the stream. 
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.tail(Scope scope) | 
Filters the objects in the traversal emitted as being last objects in the stream given the  Scope.  
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.tail(Scope scope,
    long limit) | 
Filters the objects in the traversal emitted as being last objects in the stream given the  Scope.  
 | 
static <A> GraphTraversal<A,A> | 
__.timeLimit(long timeLimit) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.timeLimit(long timeLimit) | 
Once the first  Traverser hits this step, a count down is started.  
 | 
static <A> GraphTraversal<A,A> | 
__.times(int maxLoops) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.times(int maxLoops) | 
 | 
static GraphTraversal<Vertex,Vertex> | 
__.to(Direction direction,
  String... edgeLabels) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.to(String toStepLabel) | 
 Provide to()-modulation to respective steps. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.to(Traversal<?,Vertex> toVertex) | 
When used as a modifier to  addE(String) this method specifies the traversal to use for selecting the
 incoming vertex of the newly added  Edge.  
 | 
default GraphTraversal<S,Vertex> | 
GraphTraversal.to(Direction direction,
  String... edgeLabels) | 
Map the  Vertex to its adjacent vertices given a direction and edge labels.  
 | 
default GraphTraversal<S,E> | 
GraphTraversal.to(Vertex toVertex) | 
When used as a modifier to  addE(String) this method specifies the traversal to use for selecting the
 incoming vertex of the newly added  Edge.  
 | 
static GraphTraversal<Vertex,Edge> | 
__.toE(Direction direction,
   String... edgeLabels) | 
  | 
default GraphTraversal<S,Edge> | 
GraphTraversal.toE(Direction direction,
   String... edgeLabels) | 
Map the  Vertex to its incident edges given the direction and edge labels.  
 | 
static <A> GraphTraversal<A,String> | 
__.toLower() | 
  | 
static <A,B> GraphTraversal<A,B> | 
__.toLower(Scope scope) | 
  | 
default GraphTraversal<S,String> | 
GraphTraversal.toLower() | 
 Returns the lowercase representation of incoming string traverser. 
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.toLower(Scope scope) | 
 Returns the lowercase representation of incoming string or list of strings. 
 | 
static <A> GraphTraversal<A,String> | 
__.toUpper() | 
  | 
static <A,B> GraphTraversal<A,B> | 
__.toUpper(Scope scope) | 
  | 
default GraphTraversal<S,String> | 
GraphTraversal.toUpper() | 
 Returns the uppercase representation of incoming string traverser. 
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.toUpper(Scope scope) | 
 Returns the uppercase representation of incoming string or list of strings. 
 | 
static GraphTraversal<Edge,Vertex> | 
__.toV(Direction direction) | 
  | 
default GraphTraversal<S,Vertex> | 
GraphTraversal.toV(Direction direction) | 
Map the  Edge to its incident vertices given the direction.  
 | 
static <A> GraphTraversal<A,Tree> | 
__.tree() | 
  | 
static <A> GraphTraversal<A,A> | 
__.tree(String sideEffectKey) | 
  | 
default GraphTraversal<S,Tree> | 
GraphTraversal.tree() | 
Aggregates the emanating paths into a  Tree data structure.  
 | 
default GraphTraversal<S,E> | 
GraphTraversal.tree(String sideEffectKey) | 
Aggregates the emanating paths into a  Tree data structure.  
 | 
static <A> GraphTraversal<A,String> | 
__.trim() | 
  | 
static <A,B> GraphTraversal<A,B> | 
__.trim(Scope scope) | 
  | 
default GraphTraversal<S,String> | 
GraphTraversal.trim() | 
 Returns a string with leading and trailing whitespace removed. 
 | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.trim(Scope scope) | 
 Returns a string with leading and trailing whitespace removed. 
 | 
static <A> GraphTraversal<A,A> | 
__.unfold() | 
  | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.unfold() | 
 Unrolls a Iterator, Iterable or Map into a linear form or simply emits the object if it
 is not one of those types. 
 | 
static <A,B> GraphTraversal<A,B> | 
__.union(Traversal<?,B>... traversals) | 
  | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.union(Traversal<?,E2>... unionTraversals) | 
 Merges the results of an arbitrary number of traversals. 
 | 
<S> GraphTraversal<S,S> | 
GraphTraversalSource.union(Traversal<?,S>... unionTraversals) | 
 Merges the results of an arbitrary number of traversals. 
 | 
static <A> GraphTraversal<A,A> | 
__.until(Predicate<Traverser<A>> untilPredicate) | 
  | 
static <A> GraphTraversal<A,A> | 
__.until(Traversal<?,?> untilTraversal) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.until(Predicate<Traverser<E>> untilPredicate) | 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.until(Traversal<?,?> untilTraversal) | 
 | 
static <A> GraphTraversal<A,Vertex> | 
__.V(Object... vertexIdsOrElements) | 
  | 
default GraphTraversal<S,Vertex> | 
GraphTraversal.V(Object... vertexIdsOrElements) | 
 A V step is usually used to start a traversal but it may also be used mid-traversal. 
 | 
GraphTraversal<Vertex,Vertex> | 
GraphTraversalSource.V(Object... vertexIds) | 
Spawns a  GraphTraversal starting with all vertices or some subset of vertices as specified by their
 unique identifier.  
 | 
static <A extends Property,B> GraphTraversal<A,B> | 
__.value() | 
  | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.value() | 
 | 
static <A extends Element,B> GraphTraversal<A,Map<Object,B>> | 
__.valueMap(boolean includeTokens,
        String... propertyKeys) | 
 Deprecated.
 
 | 
static <A extends Element,B> GraphTraversal<A,Map<Object,B>> | 
__.valueMap(String... propertyKeys) | 
  | 
default <E2> GraphTraversal<S,Map<Object,E2>> | 
GraphTraversal.valueMap(boolean includeTokens,
        String... propertyKeys) | 
 Deprecated.
 
 | 
default <E2> GraphTraversal<S,Map<Object,E2>> | 
GraphTraversal.valueMap(String... propertyKeys) | 
 | 
static <A extends Element,B> GraphTraversal<A,B> | 
__.values(String... propertyKeys) | 
  | 
default <E2> GraphTraversal<S,E2> | 
GraphTraversal.values(String... propertyKeys) | 
Map the  Element to the values of the associated properties given the provide property keys.  
 | 
static <A> GraphTraversal<A,A> | 
__.where(String startKey,
     P<String> predicate) | 
  | 
static <A> GraphTraversal<A,A> | 
__.where(P<String> predicate) | 
  | 
static <A> GraphTraversal<A,A> | 
__.where(Traversal<?,?> whereTraversal) | 
  | 
default GraphTraversal<S,E> | 
GraphTraversal.where(String startKey,
     P<String> predicate) | 
 Filters the current object based on the object itself or the path history. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.where(P<String> predicate) | 
 Filters the current object based on the object itself or the path history. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.where(Traversal<?,?> whereTraversal) | 
 Filters the current object based on the object itself or the path history. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.with(String key) | 
 Provides a configuration to a step in the form of a key which is the same as with(key, true). 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.with(String key,
    Object value) | 
 Provides a configuration to a step in the form of a key and value pair. 
 | 
default GraphTraversal<S,E> | 
GraphTraversal.write() | 
This step is technically a step modulator for the the  GraphTraversalSource.io(String) step which
 instructs the step to perform a write with its given configuration.  
 |