if i have tree, from root starting DFS. how to use neo4j function to know one node 's siblings. like 1->2 and 1->3->4 so 2 should be 3 and 4's left siblings. and 3 and 4 will be 2's right siblings. how to recognize this? using dfs to output, it output all the path. While if just want to remember the path which is the longest, like 1-2-3-4 not 1, 1-2, 1-2-3
-- You received this message because you are subscribed to the Google Groups "Neo4j" group. To unsubscribe from this group and stop receiving emails from it, send an email to neo4j+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
