I am trying to retrieve all the nodes and edges (edges can be optional if it improves performance) that connect a set of nodes n, m, x, and y
I know the connectivity in advance:
(n)-[]->(m)-[]->(x)
(y)-[*]->(x)
What would be the most efficient way to...
