anchor.diff:  <2> Get the vertices that are outgoing adjacent to the marko-vertex via knows-edges.
   <3> Get the names of the marko-vertex's friends.
   
  -=== The Traverser
  +==== The Traverser
   
   When a traversal is executed, the source of the traversal is on the left of the expression (e.g. vertex 1), the steps
   are the middle of the traversal (e.g. `out('knows')` and `values('name')`), and the results are "traversal.next()'d"
  
positive.code: more about it in the link:http://tinkerpop.apache.org/docs/x.y.z/dev/provider/[Graph Provider] documentation.
  
  [[the-graph-process]]
  == The Graph Process
  
  image:gremlin-running.png[width=125,float=left] The primary way in which graphs are processed are via graph
  traversals. The TinkerPop process API is focused on allowing users to create graph traversals in a
  
negative.code:  ** `VertexProgram`: code executed at all vertices in a logically parallel manner with intercommunication via message passing.
   ** `MapReduce`: a computation that analyzes all vertices in the graph in parallel and yields a single reduced result.
  
  NOTE: The TinkerPop API rides a fine line between providing concise "query language" method names and respecting
  Java method naming standards. The general convention used throughout TinkerPop is that if a method is "user exposed,"
  then a concise name is provided (e.g. `out()`, `path()`, `repeat()`). If the method is primarily for graph systems
  providers, then the standard Java naming convention is followed (e.g. `getNextStep()`, `getSteps()`,
  `getElementComputeKeys()`).
  
  === The Graph Structure
  
  image:gremlin-standing.png[width=125,float=left] A graph's structure is the topology formed by the explicit references
  between its vertices, edges, and properties. A vertex has incident edges. A vertex is adjacent to another vertex if
  