-
Notifications
You must be signed in to change notification settings - Fork 872
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Deep Traversal doesnt seem to work in orientdb v3.0.4 #8490
Comments
Hi @surajhes Vertices And when I execute traversal with max depth 2, result is like following:
Is that what you have on your mind? |
Following. Scott |
I would had expected like |
Can the query be made from the leaf node, as suggested? Not sure that makes a difference or is possible, but maybe that would get the expected result? Scott |
@smolinari
where
finds leaf nodes. But with MATCH you can go further:
or
These queries requires more sophisticated logic to detect if some node is leaf, so final query may looks like:
and if you don't need info about edges connecting nodes:
or unrolled
More details on match can be found here |
OrientDB Version: 3.0.4
Java Version: 1.8.0_171
OS: windows 7 x64
Expected behavior
1->1.1
1->1.2
2->2.1
2->2.2
2->2.3
when traversing from 1.x or 2.x till depth < 2, i expect
1.1,1
1.2,1
2.1,2
2.2,2
2.3,2
Actual behavior
1.1,1
1.2
2.1,2
2.2,
2.3
Steps to reproduce
create a graph above and perform traverse from leaf nodes to depth < 2
The text was updated successfully, but these errors were encountered: