Specifying the uniqueness of paths is a planned feature of cypher.
So right now we have to ascertain that no node is a duplicate in the path.
There is an ALL
predicate that must hold true for all elements of a collection (which a path is).
And with filter
you can extract the elements of an collection for that a certain condition holds true.
START neo=node(1)
MATCH path= neo-[r:KNOWS*..4]->other
WHERE ALL(n in nodes(path) where
1=length(filter(m in nodes(path) : m=n)))
RETURN neo, LENGTH(path) AS length, EXTRACT(p in NODES(path) : p.name), other
ORDER BY length
So what I did was:
- For all nodes of the path
n
- Filter the path for the nodes that are equal to
n
- determine the
length
of that collection
- assert with
ALL
that it has to be ONE for each n
see: http://console.neo4j.org/r/dpalbl
与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…