anchor.diff:  
   == The Final Ten Minutes
   
  -In these final ten minutes of _The TinkerPop Workout - by Gremlin_ we'll look at TinkerPop from a higher level and
  +In these final ten minutes of _The TinkerPop Workout — by Gremlin_, we'll look at TinkerPop from a higher level and
   introduce different features of the stack in order to orient you with what it offers. In this way, you can
   identify areas of interest and dig into the details from there.
   
  
positive.code: ----
  
  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.__`,
  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"
  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
  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
  creating an edge that goes _out_ of `v1` and into `v2` with a label of "created".
  
  === Graph Traversal - Staying Simple
  
negative.code: 
  When Gremlin is on a vertex or an edge, he has access to all the properties that are available to that element.
  
  IMPORTANT: The above query iterates *all* the vertices in the graph to get its answer. That's fine for our little example,
  but for multi-million- or billion-edge graphs that is a big problem. To solve this problem, you should look to use
  indices. TinkerPop does not provide an abstraction for index management. You should consult the documentation of the
  graph you have chosen and utilize its native API to create indices which will then speed up these types of lookups. Your
  traversals will remain unchanged, however, as the indices will be used transparently at execution time.
  
  Now that Gremlin has found "marko", he can consider the next step in the traversal where we ask him to "walk"
  along "created" edges to "software" vertices. As described earlier, edges have direction, so we have to tell Gremlin
  what direction to follow. In this case, we want him to traverse on outgoing edges from the "marko" vertex. For this,
  we use the link:http://tinkerpop.apache.org/docs/x.y.z/reference/#vertex-steps[outE] step.
  