Hey there.
I have this node tree:
N1
N2
N4
N5
N3
N6
Where nodes are bound together with N2-[:part_of]->N1
I would like to traverse the tree depth-first, so a flat list of the tree would look like this:
N1
N2
N4
N5
N3
N6
Additional i...
Hey Andrew.
It seems that this works when doing the query directly on the neo4j web interface. But doing it through the Ruby library seems to change the outcome. I will have to investigate that some more.
Regarding sorting, is there a way to make the...
Hi Andrew.
Thanks for pitching in. This is really interesting. This is not what I'm seeing when I'm running the query on my db. Do you know of a way that I can debug this?
Hi Shan.
Thanks a lot for your response!
Can I bother you for a little more information, perhaps?
I would love it, if I could control that sorting a little more. What if I add a position property to the nodes, which sorts siblings part_of the same pa...
