g.V().has("name", "e").inE().filter(outV().is(b))
--
You received this message because you are subscribed to the Google Groups "Aurelius" group.
To unsubscribe from this group and stop receiving emails from it, send an email to aureliusgraphs+unsubscribe@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/aureliusgraphs/1eec56f5-cbfd-460e-a495-f7b67246514e%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
Since you know vertex e and vertex b, you probably want to find the edge between them (if one exists):g.V().has("name", "e").inE().filter(outV().is(b))If all you need is a boolean value, then just append a .hasNext().Cheers,Daniel
On Thu, Aug 25, 2016 at 9:15 AM, Eric Cyliu <farsca...@live.com> wrote:
For a vertex 'e', there are three in edges. I would like to check whether one of vertex 'b' is in the list.I am quite new for gremlin. Thanks for your help.//g.V().has('name','e').inE().outV()==>v[2]==>v[4]==>v[6]//b==>v[2]// this did not workg.V().has('name','e').inE().outV() == b==>false
--
You received this message because you are subscribed to the Google Groups "Aurelius" group.
To unsubscribe from this group and stop receiving emails from it, send an email to aureliusgraph...@googlegroups.com.