you can try:
match path = (a:Node {p1:1})-[:NEXT*10]->()
where all(idx in range(0,size(path)-1) WHERE (nodes(path)[idx]).p1 <
(nodes(path)[idx+1]).p1 )
return path
> Am 05.05.2015 um 23:15 schrieb Alex Ginhoux <[email protected]>:
>
> Hi,
>
> I have some nodes with a long property like this: (:Node{p1:1}),
> (:Node{p1:2), (:Node{p1:3).
>
> I'm searching for paths with contraints on nodes like this:
> In the path, I want the p1 property of all nodes are greater than the p1
> property of the previous node (in the path).
>
> Is it possible to do this with or without shortestPath? I don't find anything
> about it.
>
> Regards,
>
> --
> 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 [email protected]
> <mailto:[email protected]>.
> For more options, visit https://groups.google.com/d/optout
> <https://groups.google.com/d/optout>.
--
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 [email protected].
For more options, visit https://groups.google.com/d/optout.
