anchor.diff:  reached, any `next()` evaluation of the step will yield a `NoSuchElementException` and any `hasNext()` evaluation will
   yield `false`.
   
  +*Additional References*
  +
  +link:http://tinkerpop.apache.org/javadocs/x.y.z/core/org/apache/tinkerpop/gremlin/process/traversal/dsl/graph/GraphTraversal.html#timeLimit-long-[`timeLimit(long)`]
  +
   [[to-step]]
   === To Step
   
  
positive.code: <1> When the `tree()` is created, vertex 3 and 5 are unique and thus, form unique branches in the tree structure.
  <2> When the `tree()` is `by()`-modulated by `label`, then vertex 3 and 5 are both "software" and thus are merged to a single node in the tree.
  
  
  [[unfold-step]]
  === Unfold Step
  
negative.code: IMPORTANT: A `where()`-step is a filter and thus, variables within a `where()` clause are not globally bound to the
  path of the traverser in `match()`. As such, `where()`-steps in `match()` are used for filtering, not binding.
  
  *Additional References*
  
  link:http://tinkerpop.apache.org/javadocs/x.y.z/core/org/apache/tinkerpop/gremlin/process/traversal/dsl/graph/GraphTraversal.html#match-org.apache.tinkerpop.gremlin.process.traversal.Traversal...-[`match(Traversal...)`]
  
  [[max-step]]
  === Max Step
  
  