I am storing a very complex tree in Neo4J. This tree can be very deep. At later point of time, I need to traverse this tree in breadth first format. What would be the most efficient way of achieving this?
Use the Traversal Framework, it supports BFSs. Cypher is better suited to declarative graph pattern matching-like operations, while traversals require imperative navigation operations.
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With