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