I would really appreciate your suggestions
In its most simplest form, you could do something like this. It will find all paths start at a given node 'n' and terminating on a node with label DI.
match(n:NodeLabelOfInterest{key:0})
match path = (n)-[*]-(:DI)
return path
The above has no constraints on its traversal, not direction, number of hops, nor nodes/relations it traverses through. You need to add these types of constraints to the query to be more targeted to what you want and to be more efficient.
Can you be more specific requirements?
1 Like