使用 Neo4J 对有向树进行通用遍历

CREATE (n:Node {id: 1, name: 'root'})
CREATE (n)-[:CHILD]->(n1:Node {id: 2, name: 'child1'})
CREATE (n1)-[:CHILD]->(n2:Node {id: 3, name: 'child2'})
CREATE (n1)-[:CHILD]->(n3:Node {id: 4, name: 'child3'})
CREATE (n2)-[:CHILD]->(n4:Node {id: 5, name: 'child4'})

MATCH (n:Node)
WHERE NOT (n)-[:CHILD]->()
WITH n
CALL apoc.path.subgraphNodes(n, {relationshipFilter: 'CHILD>', labelFilter: 'Node'})
YIELD nodes
RETURN nodes

MATCH (n:Node)
WHERE NOT (n)-[:CHILD]->()
WITH n
CALL apoc.path.subgraphNodes(n, {relationshipFilter: 'CHILD>', labelFilter: 'Node'})
YIELD nodes
RETURN nodes