as an idea , not tested..
match p=(n)-[:REL1*]-(m)
where NOT n-[:REL2*]-m
return n,m
or return p
--
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
hi thx, that one works (just tested it) :
match p=(n:label1)-[:REL1*]-(m:label2)
where NOT (n)-[:REL2*]-(m)
return p
any other syntax ideas ?
ps .. i was thing far more complex withdual match ... with to pass data
to the secondary match ... and some functions to compare the 2 sets ...
hard to say without any idea about the far more complex stuff you're trying
to achieve, and the comparisons you'd like to do ..
--
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
hi, sure.. actually i would like to build a kind of report that reflects
the amount of paths found for a specific relstype (REL1) between each 2
nodes (actully this means duplicate paths if more than 1 found) , their
length, the shortest based on weight, and whether there is at least also
one
