What does
start n = node(1) match p=n-[*3]->(x) return x, length(p) and start n = node(1) match p=n-[*4]->(x) return x, length(p) Yields ? n lördagen den 5:e april 2014 kl. 02:37:58 UTC+2 skrev Rio Eduardo: I'm sorry Lundin, I asked the wrong question. I meant how to check if there > are only 3 depth level in graph? > > On Saturday, April 5, 2014 7:25:48 AM UTC+7, Rio Eduardo wrote: >> >> Lundin, Do you know the way how to count many relationships in the graph >> because I don't see it in the doc(method for the position object(the path))? >> >> Thank you. >> >> On Saturday, April 5, 2014 12:43:01 AM UTC+7, Lundin wrote: >>> >>> Have you tried experimenting with ther filter and the path length ? >>> endNod() is not the only method for the position object(the path), Mabey >>> position.length>1 or something. >>> >>> Den fredagen den 4:e april 2014 kl. 18:10:33 UTC+2 skrev Rio Eduardo: >>>> >>>> Please anyone in this group help me. I already posted my problem at >>>> >>>> >>>> http://stackoverflow.com/questions/22861424/neo4j-traversal-to-find-friends-of-friends-that-are-not-friends-with-the-user >>>> >>>> Thank you. >>>> >>> -- 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.
