Question

I need to traverse a directed acyclic graph (DAG) using BFS.
I am using neo4j via REST API, so my main way of commuication with neo4j is using Cypher.

With Cypher I can retrieve a set of all the paths from a starting node, and from them derive a BFS traversal.

I was wondering if there’s a simpler way of getting a BFS traversal using Cypher. What I expect as output would be an array of sets of nodes.

Answer 1

Couldn’t you then just order resulting paths after length, maybe take the last node from each, like http://bit.ly/HF0p0t like

start n=node(1) match p = n-[*1..]->m return p, length(p), last(p) order by length(p) asc

To get back the paths in ascending order?