anchor.diff:  ----
   
   NOTE: On the JVM, the fully qualified name for `T` is `org.apache.tinkerpop.gremlin.structure.T`. Another important
  -static import that is often seen in Gremlin comes from `org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.__`,
  +static import that is often seen in Gremlin comes from `+org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.__+`,
   which allows for the creation of link:http://tinkerpop.apache.org/docs/x.y.z/reference/#graph-traversal-steps[anonymous traversals].
  -You can find the analogous variations of `T` and `__` for other Gremlin languages by viewing the "Common Imports"
  +You can find the analogous variations of `T` and `+__+` for other Gremlin languages by viewing the "Common Imports"
   sections for the programming language you are interested in in the
   link:http://tinkerpop.apache.org/docs/x.y.z/reference/#gremlin-drivers-variants[Reference Documentation].
   
  -Second, don't forget that you are working with TinkerGraph which allows for identifier assignment. That is _not_ the
  +Second, don't forget that you are working with TinkerGraph, which allows for identifier assignment. That is _not_ the
   case with most graph databases.
   
  -Finally, the label for an `Edge` is required and is thus part of the method signature of `addEdge()`. It is the first
  -parameter supplied, followed by the `Vertex` to which `v1` should be connected. Therefore, this usage of `addEdge` is
  +Finally, the label for an `Edge` is required and is thus part of the method signature of `addEdge()`. This usage of `addEdge` is
   creating an edge that goes _out_ of `v1` and into `v2` with a label of "created".
   
   === Graph Traversal - Staying Simple
  
positive.code: 
  TIP: The nature of Gremlin leads to long lines of code. Readability can be greatly improved by using line spacing and
  indentation. See the link:http://tinkerpop.apache.org/docs/x.y.z/recipes/#style-guide[Style Guide] for recommendations
  on what well formatted Gremlin should look like.
  
  [gremlin-groovy,modern]
  ----
  
negative.code: 
  == The Next Fifteen Minutes
  
  In the first five minutes of _The TinkerPop Workout — by Gremlin_, you learned some basics for traversing graphs. Of
  course, there wasn't much discussion about what a graph is. A graph is a collection of vertices (i.e., nodes, dots)
  and edges (i.e., relationships, lines), where a vertex is an entity which represents some domain object (e.g., a person or
  a place) and an edge represents the relationship between two vertices.
  
  image:modern-edge-1-to-3-1.png[width=300]
  
  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.
  