anchor.diff:  gB.V()
   ----
   
  +The following examples demonstrate the above `PartitionStrategy` definition for "strategyA" in other programming
  +languages:
  +
  +[source,java,tab]
  +----
  +PartitionStrategy strategyA = PartitionStrategy.build().partitionKey("_partition")
  +                                                       .writePartition("a")
  +                                                       .readPartitions("a").create();
  +----
  +[source,csharp]
  +----
  +PartitionStrategy strategyA = new PartitionStrategy(
  +                                      partitionKey: "_partition", writePartition: "a",
  +                                      readPartitions: new List<string>(){"a"});
  +----
  +[source,javascript]
  +----
  +const strategyA = new PartitionStrategy(partitionKey: "_partition", writePartition: "a", readPartitions: ["a"])
  +----
  +[source,python]
  +----
  +strategyA = PartitionStrategy(partitionKey="_partition", writePartition="a", readPartitions=["a"])
  +----
  +
   Partitions may also extend to `VertexProperty` elements if the `Graph` can support meta-properties and if the
   `includeMetaProperties` value is set to `true` when the `PartitionStrategy` is built.  The `partitionKey` will be
   stored in the meta-properties of the `VertexProperty` and blind the traversal to those properties.  Please note that
  
positive.code: [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()
  gA = traversal().withEmbedded(graph).withStrategies(strategyA)
  gA.addV() // this vertex has a property of {_partition:"a"}
  gB = traversal().withEmbedded(graph).withStrategies(strategyB)
  
negative.code: A collection of useful `DecorationStrategy` strategies are provided with TinkerPop and are generally useful to
  end-users.  The following sub-sections detail these strategies:
  
  === EdgeLabelVerificationStrategy
  
  `EdgeLabelVerificationStrategy` prevents traversals from writing traversals that do not explicitly specify and edge
  label when using steps like `out()`, 'in()', 'both()' and their related `E` oriented steps, providing the
  option to throw an exception, log a warning or do both when one of these keys is encountered in a mutating step.
  
  [source,java,tab]
  ----
  EdgeLabelVerificationStrategy verificationStrategy = EdgeLabelVerificationStrategy.build()
                                                                                    .throwException().create()
  // results in VerificationException - as out() does not have a label specified
  g.withStrategies(verificationStrategy).V(1).out().iterate();
  ----
  [source,groovy]
  ----
  // results in VerificationException - as out() does not have a label specified
  g.withStrategies(new EdgeLabelVerificationStrategy(throwException: true))
       .V(1).out().iterate()
  ----
  [source,csharp]
  ----
  // results in VerificationException - as out() does not have a label specified
  g.WithStrategies(new EdgeLabelVerificationStrategy(throwException: true))
       .V(1).Out().Iterate();
  ----
  [source,javascript]
  ----
  // results in Error - as out() does not have a label specified
  g.withStrategies(new EdgeLabelVerificationStrategy(throwException: true))
       .V(1).out().iterate();
  ----
  [source,python]
  ----
  // results in Error - as out() does not have a label specified
  g.withStrategies(EdgeLabelVerificationStrategy(throwException=true))
       .V(1).out().iterate()
  ----
  
  === ElementIdStrategy
  
  `ElementIdStrategy` provides control over element identifiers. Some Graph implementations, such as TinkerGraph,
  