Find all downstream nodes recursively

Totally new to Neo4j so I'm a little bit lost.

From a subset of nodes that are not necessarily connected, I want to trace all the nodes that they have a TO connection with recursively until I reach the end of the trees. I've got a query that returns all the nodes I'm interested as my starting seeds, but I'm not sure how to recursively follow their relationships.

Also, is there a way to run a pagerank based only on the resulting nodes that I have rather than running it offline for all nodes?

Thanks so much for the help!

You should read up on variable-length pattern matching, that is probably what you're after:

1 Like

Thanks so much @andrew.bowman ! That's perfect!