(node1)->(node2)->(node3)->(node4)
also, I have "node5" connected to "node2", and "node6" connected to "node3"
Is it possible to get the paths from node1 to node4 with all the nodes and relationships in between, and also all the nodes that are related to node2 and node3 (node5 and node6) with one query?
Thanks!
Thank you for the help!
Can you please explain?
Let's say all have "CONTAINS" relationships, directions are like in the diagram:
(node1)-[r:CONTAINS]->(node2)
(node5)-[r:CONTAINS]->(node2)
(node6)-[r:CONTAINS]->(node3)
(node2)-[r:CONTAINS]->(node3)
(node3)-[r:CONTAINS]->(node4)
Thanks