anchor.diff:  for (String[] quad : quads) {
       Vertex[] vertices = new Vertex[2];
       for (int i=0;i<2;i++) {
  -        vertices[i] = bgraph.v(quad[i]);
  +        vertices[i] = bgraph.V(quad[i]);
           if (null == vertices[i]) vertices[i]=bgraph.addVertex(T.id, quad[i]);
       }
       Edge edge = vertices[0].addEdge(quad[2],vertices[1], "annotation",quad[3]);
  
positive.code: ==>stephen
  ----
  
  By getting the "base graph" (i.e. the underlying `TinkerGraph`) it is possible to mutate the graph.  The above code demonstrates that and also shows that it then possible to read back that added vertex. The following sections explain details of the specific `GraphStrategy` implementations.
  
  IdStrategy
  ~~~~~~~~~~~~~~~
  
negative.code: [source,groovy]
  ----
  gremlin> v1 = sg.addVertex("name", "one")
  ==>v[0]*
  gremlin> v2 = sg.addVertex("name", "two")
  ==>v[3]*
  gremlin> v1.addEdge("knows", v2)
  ==>e[6][0-knows->3]*
  gremlin> strategy.setWritePartition("B")
  ==>null
  gremlin> v3 = sg.addVertex("name", "three")
  ==>v[7]*
  gremlin> v1.addEdge("knows", v3)
  ==>e[10][0-knows->7]*
  gremlin> 
  ----
  
  