Neo4J / Cypher需要帮助编写查询，以显示通过特定数量的路径连接到初始节点的所有结果节点

Question

在Neo4J中，如何编写一个Cypher查询来显示通过特定数量的路径连接到初始节点的所有节点？

Answer 1

路径数或跳数？

start n=node(x)
match path = n-[:TYPE*..3]->end // number of hops *..3 is up to 3 hops
return path
limit 10 // number of paths

Answer 2

我认为也许他正在寻找：

start n=node(x) 
match path = n-[*]->end      // maybe specify a max length and type?
with count(path) as cnt, end // group by end node, get count of paths
where cnt = <numpaths>       // replace <numpaths> with the number of paths you want to match
return end