Neo4j中的多路徑關係檢查

Question

我在搞Neo4j查詢。是否可以使用Neo4j Cypher語言檢查「n1」與標籤「p」的所有關係是否具有「n6」的路徑？看到圖片。

Answer 1

當然，這是可能的：

MATCH (n6:Node {name:"n6"}) 
MATCH (n1:Node {name:"n1"})-[r:p]->() 
WITH n1, n6, collect(r) as pRels 
RETURN ALL(x IN pRels WHERE shortestPath((n1)-[*]-(n6))) 

這將返回true或false

Answer 2

// End node 
MATCH (n6 {name:"n6"}) 
// Start node and neighbors 
MATCH (n1 {name:"n1"})-[:p]-(n) 
// Shortest paths through the neighbor to the end node, 
OPTIONAL MATCH p = shortestPath((n)-[*]-(n6)) 
    // which does not pass through the starting node 
    WHERE NOT n1 IN nodes(p) 
WITH 
    size(collect(distinct n)) as neighborsCount, 
    count(p) as neighborsWithPathCount 
RETURN neighborsCount = neighborsWithPathCount AND 
     neighborsWithPathCount > 0