Consider a simple graph like:
A-[:label1]->B-[:label2]->C-[:label1]->D-[:label1]->E-[:label2]->F
I'd like to find paths in the graph that have both label1 and label2, e.g.,
MATCH r=(n1)-[x:label1|label2*]->(n2)
In addition, if a node x has a relation...