I agree with Tom, but if you really want to do it:
You could do:
match p=(n:label1)-[:REL1*]->(m:label2)
with collect([n,m]) as start_end
match p=(n:label1)-[:REL2*]->(m:label2)
where [n,m] not in start_end
return p
if you want to compare collections
match p=(n:label1)-[:REL1*]->(m:label2)
w
Hi, i wonder how to solve the following using cypher
1) using a match i find all paths for a certain relstype (REL1) between all
nodes of certain labeltypes (LABEL1 and LABEL2).. for example
match rel1paths=(n:LABEL1)-[:REL1*]->(m:LABEL2)
lets assume this gives me in total 4 paths
2) now i
