Hi Bokyum,
The TRAVERSE command is not designed to find all paths between nodes. To
prevent going into a loop it does not traverse nodes that has already been
handled.
To find all paths between vertexes you can use gremlin query or write your
own function.
Best regards,
Artem Orobets
* Orient T
O are nodes. Their names are not important.
Let's just call them node x, y.
2014년 6월 9일 월요일 오전 8시 3분 20초 UTC+9, Lvc@ 님의 말:
>
> Hi,
> The picture is not clear to me. Do you have O and O as nodes? Can you name
> the node in different way? Or O are edges?
>
> Lvc@
>
>
>
> On 8 June 2014 10:11, Bokyu
Hi,
The picture is not clear to me. Do you have O and O as nodes? Can you name
the node in different way? Or O are edges?
Lvc@
On 8 June 2014 10:11, Bokyum Kim wrote:
> Let me show you a simple example.
>
> There are 2 nodes, node A and B. There are two paths between them as
> follows. The na
Let me show you a simple example.
There are 2 nodes, node A and B. There are two paths between them as
follows. The name of the edge is KNOWS.
A -- OB
\|
\- O
The following query does not return 2 records containing node B. 1 record
is returned.
traverse both
