anchor.diff:  the line and stores those vertices in the `fromVertex` and `toVertex` variables respectively.
   
   NOTE: While this is a tab-delimited structure, this same pattern can be applied
  -to any data source you require and Groovy tends to have nice libraries that can help making working with data
  +to any data source you require and Groovy tends to have nice libraries that can help make working with data
   link:https://thinkaurelius.wordpress.com/2013/02/04/polyglot-persistence-and-query-with-gremlin/[quite enjoyable].
   
   WARNING: Take care if using a `Graph` implementation that supports
  
positive.code: 
  image:gremlin-to-the-7.png[width=100,float=left] There are many strategies for getting data into your graph. As you are
  just getting started, let's look at the more simple methods aimed at "smaller" graphs. A "small" graph, in this
  context, is one that has less than ten million edges. The most direct way to load this data is to write a Groovy script
  that can be executed in the Gremlin Console, a tool that you should be well familiar with at this point. For our
  example, let's use the link:http://snap.stanford.edu/data/wiki-Vote.html[Wikipedia Vote Network] data set which
  contains 7,115 vertices and 103,689 edges.
  
negative.code: ----
  
  NOTE: 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].
  
  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()`. 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
  