anchor.diff:  "iterating your traversal" is described further in link:http://tinkerpop.apache.org/docs/x.y.z/tutorials/the-gremlin-console/[The Gremlin Console Tutorial].
   
   In this first five minutes with Gremlin, you've gotten the Gremlin Console installed, instantiated a `Graph` and
  -`TraversalSource`, wrote some traversals and hopefully learned something about TinkerPop in general. You've only
  +`TraversalSource`, written some traversals and hopefully learned something about TinkerPop in general. You've only
   scratched the surface of what there is to know, but those accomplishments will help enable your understanding of the
   more detailed sections to come.
   
  
positive.code: the line and stores those vertices in the `fromVertex` and `toVertex` variables respectively.
  
  NOTE: While this is a tab-delimited structure, this same pattern can be applied
  to any data source you require and Groovy tends to have nice libraries that can help making working with data
  link:https://thinkaurelius.wordpress.com/2013/02/04/polyglot-persistence-and-query-with-gremlin/[quite enjoyable].
  
  WARNING: Take care if using a `Graph` implementation that supports
  
negative.code: 
  The diagram above shows a graph with two vertices, one with a unique identifier of "1" and another with a unique
  identifier of "3". There is an edge connecting the two with a unique identifier of "9". It is important to consider
  that the edge has a direction which goes _out_ from vertex "1" and _in_ to vertex "3".
  
  IMPORTANT: Most TinkerPop implementations do not allow for identifier assignment. They will rather assign
  their own identifiers and ignore assigned identifiers that you attempt to assign to them.
  