anchor.diff:  <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.
   
  -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.
  +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]
   ----
  
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: 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,
  