Either use something like this:
MATCH (n:Label {id:124})
MATCH path = (n)-[*]->(m)
RETURN distinct m
Or one of the apoc expand procedures:
https://neo4j-contrib.github.io/neo4j-apoc-procedures/#_expand_paths
Or for large graphs the neo4j-graph-algorithms also offer similar
capabilities:
https://neo4j-contrib.github.io/neo4j-graph-algorithms/#_minimum_weight_spanning_tree
Michael
On Thu, Dec 28, 2017 at 1:20 AM, Kevin Andrews <kevin.andr...@gmail.com>
wrote:
> If this question has already been answered, please point me to the
> relevant post. I searched and couldn't find one.
> Am looking for a cypher query to list all paths for nodes that can be
> reached from a given node.
>
> Thanks
>
> --
> You received this message because you are subscribed to the Google Groups
> "Neo4j" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to neo4j+unsubscr...@googlegroups.com.
> For more options, visit https://groups.google.com/d/optout.
>
--
You received this message because you are subscribed to the Google Groups
"Neo4j" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to neo4j+unsubscr...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
