anchor.diff:  link:http://tinkerpop.apache.org[Apache TinkerPop™] is an open source Graph Computing Framework. Within itself, TinkerPop
   represents a large collection of capabilities and technologies and, in its wider ecosystem, an additionally extended
   world of link:http://tinkerpop.apache.org/#graph-systems[third-party contributed] graph libraries and
  -systems. TinkerPop's ecosystem can appear complex to newcomers of all experience, especially when glancing at the
  +systems. TinkerPop's ecosystem can appear complex to newcomers of all experience levels, especially when glancing at the
   link:http://tinkerpop.apache.org/docs/x.y.z/reference/[reference documentation] for the first time.
   
  -So, where do you get started with TinkerPop? How do you dive in quickly and get productive? Well - Gremlin, the
  -most recognizable citizen of The TinkerPop, is here to help with this thirty minute tutorial. That's right - in just
  +So, where do you get started with TinkerPop? How do you dive in quickly and get productive? Well ... Gremlin, the
  +most recognizable citizen of The TinkerPop, is here to help with this thirty-minute tutorial. That's right: in just
   thirty short minutes, you too can be fit to start building graph applications with TinkerPop. Welcome to _The
  -TinkerPop Workout - by Gremlin_!
  +TinkerPop Workout — by Gremlin_!
   
   image::gremlin-gym.png[width=1024]
   
  
positive.code: 
  Gremlin helps you navigate the vertices and edges of a graph. He is essentially your query language to graph
  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: link:http://tinkerpop.apache.org/docs/x.y.z/reference/#gremlin-console[The Gremlin Console].
  
  NOTE: Are you unsure of what a vertex or edge is? That topic is covered in the <<_the_next_fifteen_minutes, next section>>,
  
negative.code: ----
  
  <1> Get all the vertices in the `Graph`.
  <2> Get the vertex with the unique identifier of "1".
  <3> Get the value of the `name` property on the vertex with the unique identifier of "1".
  <4> Get the edges with the label "knows" for the vertex with the unique identifier of "1".
  <5> Get the names of the people whom the vertex with the unique identifier of "1" "knows".
  <6> Note that when one uses `outE().inV()` as shown in the previous command, this can be shortened to just `out()`
  (similar to `inE().outV()` and `in()` for incoming edges).
  <7> Get the names of the people vertex "1" knows who are over the age of 30.
  