anchor.diff:  g.V().has('name','marko').out('created')
   ----
   
  -image:gremlin-on-software-vertex.png[width=350,float=right] Let's extend on that query to try to learn who "marko"
  +image:gremlin-on-software-vertex.png[width=325,float=right] Let's extend on that query to try to learn who "marko"
   collaborates with when it comes to the software he created. In other words, let's try to answer the question of: "Who
   are the people that marko develops software with?" To do that, we should first picture Gremlin where we left him in
   the previous query.  He was standing on the "software" vertex. To find out who "created" that "software", we need to
  
positive.code: image:modern-edge-1-to-3-1.png[width=300]
  
  The diagram above shows a graph with two vertices, one with a unique identifier of "1" and another with a unique
  identifier of "3". There is a edge connecting the two with a unique identifier of "9". It is important to consider
  that the edge has a direction which goes _out_ from vertex "1" and _in_ to vertex "3'.
  
  IMPORTANT: Most TinkerPop implementations do not allow for identifier assignment. They will rather assign
  
negative.code: Loading Data
  ~~~~~~~~~~~~
  
  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.
  
  [source,text]
  ----
  