Re: similar edges and how to prevent them

Daniel Kuppitz <me@...>

I guess the point is, that the edge's direction doesn't matter. Hence it should be more like:

g.V().has(instanceId, "nodeId", nodeA).as("a").
  V().has(instanceId, "nodeId", nodeB).

...or, if performance matters, don't enable path computations (using otherV):

g.V().has(instanceId, "nodeId", nodeA).as("a").
  V().has(instanceId, "nodeId", nodeB).


On Mon, Sep 11, 2017 at 3:32 AM, <tpr...@...> wrote:
You can use coalesce step to do a check or insert query.
Something like g.V(idTo).as('to').V(idFrom).coalesce(__.outE('labelE').has('id',idValue),

You received this message because you are subscribed to the Google Groups "JanusGraph users" group.
To unsubscribe from this group and stop receiving emails from it, send an email to
To view this discussion on the web visit
For more options, visit

Join to automatically receive all group messages.