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: ==>marko
  ==>lop
  ==>josh
  gremlin> g.V().values('name').order{a,b -> a.get()[1] <=> b.get[1]} // order by the second letter
  ==>marko
  ==>vadas
  ==>peter
  
negative.code: ==>v[1]
  ==>v[1]
  ==>v[1]
  gremlin> g.V(1).as('a').out().back('a') <3>
  ==>v[1]
  ==>v[1]
  ==>v[1]
  