anchor.diff:  [source,groovy]
   ----
   gremlin> v1 = sg.addVertex("name", "one")
  -==>partitiongraphstrategy[v[0]]
  +==>v[0]*
   gremlin> v2 = sg.addVertex("name", "two")
  -==>partitiongraphstrategy[v[1]]
  +==>v[3]*
   gremlin> v1.addEdge("knows", v2)
  -==>partitiongraphstrategy[e[2][0-knows->1]]
  +==>e[6][0-knows->3]*
   gremlin> strategy.setWritePartition("B")
   ==>null
   gremlin> v3 = sg.addVertex("name", "three")
  -==>partitiongraphstrategy[v[3]]
  +==>v[7]*
   gremlin> v1.addEdge("knows", v3)
  -==>partitiongraphstrategy[e[4][0-knows->3]]
  +==>e[10][0-knows->7]*
   gremlin> 
   ----
   
  
positive.code: sg.getStrategy().setGraphStrategy(strategy);
  
  // all vertices are here
  System.out.println("" + sg.V().count() + " of " + g.V().count() + " vertices");
  
  // only the given edges are included
  System.out.println("" + sg.E().count() + " of " + g.E().count() + " edges");
  ----
  
negative.code: 
  * `Graph.addVertex()` for adding vertices
  * `Vertex.addEdge()` for adding edges
  * `Graph.V()` to get vertices by their id
  * Property getter, setter and removal methods for vertices and edges as well as `Element.id()`
  
  An important limitation of `BatchGraph` is that edge properties can only be set immediately after the edge has been added. If other vertices or edges have been created in the meantime, setting, getting or removing properties will throw exceptions. This is done to avoid caching of edges which would require memory.
  