Gremlin: What's an efficient way of finding an edge between two vertices?

Question

So obviously, a straight forward way to find an edge between two vertices is to:

graph.traversal().V(outVertex).bothE(edgeLabel).filter(__.otherV().is(inVert         


        

Answer 1

In case one does not know the vertex Id's, another solution might be

g.V().has('propertykey','value1').outE('thatlabel').as('e').inV().has('propertykey','value2').select('e')

This is also only unidirectional so one needs to reformulate the query for the opposite direction.