anchor.diff:  gremlin> g.V(4).outE()  // all outgoing edges
   ==>e[10][4-created->5]
   ==>e[11][4-created->3]
  -gremlin> g.V(4).outE(1)  // at most one outgoing edge per incoming vertex
  -==>e[10][4-created->5]
   gremlin> g.V(4).inE('knows')  // all incoming knows-edges
   ==>e[8][1-knows->4]
   gremlin> g.V(4).inE('created') // all incoming created-edges
  
positive.code: 
  [source,groovy]
  gremlin> g.V(4).out().values('name').inject('daniel')
  ==>ripple
  ==>lop
  ==>daniel
  gremlin> g.V(4).out().values('name').inject('daniel').map{it.get().length()}
  ==>6
  ==>3
  ==>6
  gremlin> g.V(4).out().values('name').inject('daniel').map{it.get().length()}.path()
  ==>[v[4], v[5], ripple, 6]
  ==>[v[4], v[3], lop, 3]
  ==>[daniel, 6]
  
  In the last example above, note that the path starting with `daniel` is only of length 2. This is because the `daniel` string was inserted half-way in the traversal. Finally, a typical use case is provided below -- when the start of the traversal is not a graph object.
  
  
negative.code: image::timelimit-step.png[width=500]
  
  [source,groovy]
  gremlin> :pin use tinkerpop.utilities
  ==>tinkerpop.utilities activated
  gremlin> g = TinkerFactory.createClassic()
  ==>tinkergraph[vertices:6 edges:6]
  gremlin> g.V().as('x').both().groupCount('m').jump('x',16).cap('m').next().sort{-it.value}
  