anchor.diff:  [gremlin-groovy]
   ----
   graph = TinkerFactory.createModern()
  -strategyA = PartitionStrategy.build().partitionKey("_partition").writePartition("a").readPartitions("a").create()
  -strategyB = PartitionStrategy.build().partitionKey("_partition").writePartition("b").readPartitions("b").create()
  +strategyA = new PartitionStrategy(partitionKey: "_partition", writePartition: "a", readPartitions: ["a"])
  +strategyB = new PartitionStrategy(partitionKey: "_partition", writePartition: "b", readPartitions: ["b"])
   gA = traversal().withEmbedded(graph).withStrategies(strategyA)
   gA.addV() // this vertex has a property of {_partition:"a"}
   gB = traversal().withEmbedded(graph).withStrategies(strategyB)
  
positive.code: g = traversal().withEmbedded(graph)
  g.V().as('a').values('location').as('b').  <1>
    select('a','b').by('name').by()
  g = g.withStrategies(SubgraphStrategy.build().vertexProperties(hasNot('endTime')).create()) <2>
  g.V().as('a').values('location').as('b').  <3>
    select('a','b').by('name').by()
  g.V().as('a').values('location').as('b').
  
negative.code: <2> Create a `SubgraphStrategy` where vertex properties must not have an `endTime`-property (thus, the current location).
  <3> Get all vertices and their current vertex property locations.
  
  The following examples demonstrate the above `SubgraphStrategy` definition in other programming languages:
  
  [source,java,tab]
  ----
  g.withStrategies(SubgraphStrategy.build().vertexProperties(hasNot("endTime")).create());
  ----
  [source,csharp]
  ----
  g.WithStrategies(new SubgraphStrategy(vertexProperties: HasNot("endTime")));
  ----
  [source,javascript]
  ----
  g.withStrategies(new SubgraphStrategy(vertexProperties: hasNot("endTime")));
  ----
  [source,python]
  ----
  g.withStrategies(new SubgraphStrategy(vertexProperties=hasNot("endTime")))
  ----
  
  IMPORTANT: This strategy is implemented such that the vertices attached to an `Edge` must both satisfy the vertex
  criterion (if present) in order for the `Edge` to be considered a part of the subgraph.
  
  The example below uses all three filters: vertex, edge, and vertex property. People vertices must have lived in more
  than three places, edges must be labeled "develops," and vertex properties must be the persons current location or a
  non-location property.
  
  [gremlin-groovy]
  ----
  