I have a graph: root(neo4j id : 0) -[:include]-> childA(neo4j id 1) -[:include]-> childAA(neo4j id 2) -[:include]-> childAAA(neo4j id 3)
I want match from childAAA reversely along include edge, but stop when the endNode of current edge in node set [0, 1]. In other words root->childA is not in result, but childA->childAA should be in.
I don't know how to write the cypher statement. I'm looking forward to help!
Thanks a lot!