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: link:http://tinkerpop.apache.org/docs/x.y.z/#gremlin-console[The Gremlin Console].
  +TinkerPop's most important tools: link:http://tinkerpop.apache.org/docs/x.y.z/reference/#gremlin-console[The Gremlin Console].
   
   Download the console, unpackage it and start it:
   
  
positive.code: graphs, working out complex traversals, etc.
  
  To get Gremlin to traverse a graph, you need a `Graph` instance, which holds the
  link:http://tinkerpop.apache.org/docs/x.y.z/#_the_graph_structure[structure] and data of the
  graph. TinkerPop is a graph abstraction layer over different graph databases and different graph processors, so there
  are many `Graph` instances you can choose from to instantiate in the console. The best `Graph` instance to start with
  however is link:http://tinkerpop.apache.org/docs/x.y.z/#tinkergraph-gremlin[TinkerGraph]. TinkerGraph
  is a fast, in-memory graph database with a small handful of configuration options, making it a good choice for beginners.
  
  TIP: TinkerGraph is not just a toy for beginners. It is useful in analyzing subgraphs taken from a large graph,
  
negative.code: Now that Gremlin has found "marko", he can now 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.
  
  [gremlin-groovy,modern]
  ----
  