Re: [Neo] Popularity sorting

2010-04-23 Thread Chris Owen
Hi Johan, Just saw this response sometime later, and thats exactly what we did, this was fine as we had a max depth of 5 so wasn't such an issue. Cheers, Chris. On 17 February 2010 12:36, Johan Svensson jo...@neotechnology.com wrote: Chris, Sorry for long response time. The pattern

Re: [Neo] Popularity sorting

2010-02-17 Thread Johan Svensson
Chris, Sorry for long response time. The pattern matcher can only match a single exact depth/pattern at the moment. There is (currently) no way to configure it to match the way you describe. Instead you would have to generate a pattern for each depth meaning: product-customer-product

Re: [Neo] Popularity sorting

2010-02-10 Thread Peter Neubauer
to an   ArrayList, then we wrote a library of classes that allow us to do   SQL-like functions on the resultant collection.   Rick   Original Message   Subject: [Neo] Popularity sorting   From: Chris Owen co...@thoughtworks.com   Date: Wed, February 10, 2010 3:05 am   To: user

Re: [Neo] Popularity sorting

2010-02-10 Thread Johan Svensson
...@neotechnology.com wrote: ... On Wed, Feb 10, 2010 at 1:27 PM, Craig Taverner cr...@amanzi.com wrote: ... On Wed, Feb 10, 2010 at 1:10 PM, rick.bullo...@burningskysoftware.comwrote: ...   Original Message   Subject: [Neo] Popularity sorting   From: Chris Owen co

Re: [Neo] Popularity sorting

2010-02-10 Thread Chris Owen
Thanks for all the response, Johan the pattern matcher looks interesting. Following your example I see the results expected for matching the pattern product-customer-product from the selected node. This is what we want, though I wonder how we could repeat this match until a given depth is found