Re: Graph Traversal

[alessand...@gmail.com]

Hi,

do you want all paths from A - D or the shortest path or other ?

Best regards,

Alessandro 

[alessand...@gmail.com]

I have replicated your structure.

You could use this query

g.V.has('@class','V').has('name',T.in,['A','B','C','D'])

Kind regards,

Alessandro

[Amrutha Valli]

Can you explain the query

[alessand...@gmail.com]

Hi, with 

g.V.has('@class','V')

it get all vertices of class "V" while with

 

has('name',T.in,['A','B','C','D'])

it get all the previous vertices where the field "name" is one of A,B,C,D.

The equivalent OSQL query is :

select from v where name contains ["A","B","C","D"]

[Amrutha Valli]

i have the below classes

A,B,C,D,E,F  with the properties name and id and all are related with has relation the query didnt work for me

[Amrutha Valli]

can i have a orient query for the same

[alessand...@gmail.com]

You could use

g.V.has('@class',T.in,['A','B','C','D','E','F'])

Hope it helps.