[Neo4j] Re: Traversal to find friends of friends that are not friends with the user yet

2014-04-05 Thread Rio Eduardo
so any solutions for this case, Lundin? Please help. Thank you. On Saturday, April 5, 2014 7:41:51 PM UTC+7, Rio Eduardo wrote: > > I already tried like you did before you did it > if (position.length()>2){position.length()>2}else{position.length()>1} > > and again it doesn't work because it alwa

[Neo4j] Re: Traversal to find friends of friends that are not friends with the user yet

2014-04-05 Thread Rio Eduardo
I already tried like you did before you did it if (position.length()>2){position.length()>2}else{position.length()>1} and again it doesn't work because it always execute the else statement position.length()>1 and if I set condition statement like this: if (position.length()==2){position.length()>

[Neo4j] Re: Traversal to find friends of friends that are not friends with the user yet

2014-04-05 Thread Lundin
What have you tried so far? The filter body code is sent as javascript and interpreted on the server, test the length before doing the filtering if (position.length()>2){position.length()>2}else{position.length()>1} would work in both cases. Den lördagen den 5:e april 2014 kl. 06:23:59 UTC+2 s

[Neo4j] Re: Traversal to find friends of friends that are not friends with the user yet

2014-04-04 Thread Rio Eduardo
yeah because if the model graph is changed, the way to return filter also changes. For example: In your case here: CREATE (Pontus:People { name:'Pontus Lundin' }),(John:People { name: 'John Hellberg' }),(Jack:People { name: 'Jack Hellberg' }),(Sandra:People { name: 'Sandra Johansson', sex:'fema

[Neo4j] Re: Traversal to find friends of friends that are not friends with the user yet

2014-04-04 Thread Lundin
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 > ar

[Neo4j] Re: Traversal to find friends of friends that are not friends with the user yet

2014-04-04 Thread Lundin
First, why do you say it works sometimes ? That sounds like a bug to me in that case. Can you please start with a small dataset so you know and being sure that you know whats going on in the graph ? CREATE (Pontus:People { name:'Pontus Lundin' }),(John:People { name: 'John Hellberg' }),(Jack:Pe

[Neo4j] Re: Traversal to find friends of friends that are not friends with the user yet

2014-04-04 Thread 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

[Neo4j] Re: Traversal to find friends of friends that are not friends with the user yet

2014-04-04 Thread Rio Eduardo
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 ? > e

[Neo4j] Re: Traversal to find friends of friends that are not friends with the user yet

2014-04-04 Thread Rio Eduardo
Thank you for the reply Lundin. I already tried it, but in some conditions it doesn't work(it returns nodes that shouldn't be returned). That's why I found out the other ways to make condition that can work in many conditions. On Saturday, April 5, 2014 12:43:01 AM UTC+7, Lundin wrote: > > Have

[Neo4j] Re: Traversal to find friends of friends that are not friends with the user yet

2014-04-04 Thread Lundin
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 pos