How to find all vertices that have no incoming edges in TinkerPop 3?

Question

How would write a traversal in use Gremlin TinkerPop 3 to find all vertices that have no incoming edges?

As a follow up I also need to find a vertices that have no outgoing edges as well.

Alaa Mahmoud · Answer 1 · 2016-08-25T13:29:56.170

10

This is simpler than the below version

g.V().not(inE())
g.V().not(outE())

Keeping my original answer for reference

g.V().where(inE().count().is(eq(0)))

For 0 outgoing edges

g.V().where(outE().count().is(eq(0)))

edited Aug 25 '16 at 13:29

answered Aug 24 '16 at 19:03

Alaa Mahmoud

5

This is correct, but can be simplified: `g.V().not(inE())` – Daniel Kuppitz Aug 25 '16 at 09:01
@DanielKuppitz Like! This is definitely simpler. I'll change my answer to use yours. – Alaa Mahmoud Aug 25 '16 at 13:27

1 Answers1