anchor.diff:  path.b
   path.c
   path.d == path.e
  -----
  +----   
  +
  +*Additional References*
  +
  +link:http://tinkerpop.apache.org/javadocs/x.y.z/core/org/apache/tinkerpop/gremlin/process/traversal/dsl/graph/GraphTraversal.html#path--[`path()`]
   
   [[peerpressure-step]]
   === PeerPressure 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: of computing is the vertex and its local "star graph," it is important that the anonymous traversal does not leave
  the confines of the vertex's star graph. In other words, it can not traverse to an adjacent vertex's properties or edges.
  
  *Additional References*
  
  link:http://tinkerpop.apache.org/javadocs/x.y.z/core/org/apache/tinkerpop/gremlin/process/traversal/dsl/graph/GraphTraversal.html#local-org.apache.tinkerpop.gremlin.process.traversal.Traversal-[`local(Traversal)`]
  
  [[loops-step]]
  === Loops Step
  
  