anchor.diff:  databases, as link:http://sql2gremlin.com/[SQL] is the query language to relational databases. To tell Gremlin how
   he should "traverse" the graph (i.e. what you want your query to do) you need a way to provide him commands in the
   language he understands - and, of course, that language is called "Gremlin". For this task, you need one of
  -TinkerPop's most important tools: the link:http://tinkerpop.incubator.apache.org/docs/x.y.z/#gremlin-console[Gremlin Console].
  +TinkerPop's most important tools: link:http://tinkerpop.incubator.apache.org/docs/x.y.z/#gremlin-console[The Gremlin Console].
   
   Download the console, unpackage it and start it:
   
  
positive.code: ----
  
  In this section, you have learned a bit more about what property graphs are and how Gremlin interacts with them.
  You also learned how to envision Gremlin moving about a graph and how to use some of the more complex but commonly
  utilized traversal steps. You are now ready to think about TinkerPop in terms of its wider applicability to
  graph computing.
  
  The Final Ten Minutes
  ---------------------
  
  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.
  
  
negative.code: NOTE: The fully qualified name for `T` is `org.apache.tinkerpop.gremlin.structure.T`.
  
  Third, don't forget that you are working with TinkerGraph and so identifier assignment is allowed. That is _not_ the
  case with most graph databases (for example, don't bother to try with Neo4j or Titan).
  
  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
  