anchor.diff:          final GraphTraversal<Vertex, Vertex> traversal = new DefaultGraphTraversal<>(this);
           return traversal.addStep(new MyGraphStep<>(traversal, Edge.class, this));
        }
  -
        ...
   }
   ----
  
positive.code: The methods `Graph.v()` and `Graph.e()` are default methods in Graph and can be overridden as desired if a more optimal retrieval is possible.
  
  IMPORTANT: The MyGraph implementation of V() and E() are linear scans. In many situations, indices can be leveraged in situations such as `g.V().has('name','dan')`. In order to "fold" the has()-step into MyGraphStep, a <<traversalstrategy,`TraversalStrategy`>> is required. Please review TinkerGraph's `TinkerGraphStepStrategy` and `TinkerGraphStep` for the fundamentals.
  
  [[olap-implementations]]
  OLAP Implementations
  
negative.code: [source,java]
  ----
  public class MyGraph implements Graph {
      ...
      @Override
      public GraphTraversal<Vertex, Vertex> V() {
          final GraphTraversal<Vertex, Vertex> traversal = new DefaultGraphTraversal<>(this);
  