Thanks, that will help! Iwill try defining my own uniqueness criteria.
> Oh, so if any node in the path has been returned in any other path
> before if (except the start node) then exclude it? That's the first
> time I've heard that requirement. Love the fact that you sent a
> picture, guys :)
>
2011/4/7 Stephan Hagemann :
> Thanks for clearing that up!
>
> Then I can come back to my initial comment. If the Evaluator returns paths
> and we are looking for nodes (sets of nodes to be specific), we have no easy
> mechanism that will ensure we do not return duplicate nodes (because the
> paths
Thanks for clearing that up!
Then I can come back to my initial comment. If the Evaluator returns paths
and we are looking for nodes (sets of nodes to be specific), we have no easy
mechanism that will ensure we do not return duplicate nodes (because the
paths they are extracted from are not duplic
2011/4/7 Michael Hunger :
> I think the confusing thing here is that ReturnableEvaluator talked about
> including/excluding nodes
> whereas when describing the Evaluations you spoke about including/excluding
> paths.
Oh, sorry... one major difference from the old traversal framework is
that it r
If they are indeed equivalent, Michael is right - then I was confused by the
doc talking about nodes vs the other talking about paths.
On Thu, Apr 7, 2011 at 10:43, Michael Hunger <
michael.hun...@neotechnology.com> wrote:
> I think the confusing thing here is that ReturnableEvaluator talked abo
I think the confusing thing here is that ReturnableEvaluator talked about
including/excluding nodes
whereas when describing the Evaluations you spoke about including/excluding
paths.
Which of those is correct ?
Cheers
Michael
Am 07.04.2011 um 10:40 schrieb Mattias Persson:
> 2011/4/7 Stephan
2011/4/7 Stephan Hagemann :
> Hi guys,
>
> Dario and I are working together on this, so let me clarify, what we want to
> achieve. An example query in a friend network would be:
>
> Retrieve a set of people P that are the direct friends of person A. P should
> include only those friends that are al
Hi guys,
Dario and I are working together on this, so let me clarify, what we want to
achieve. An example query in a friend network would be:
Retrieve a set of people P that are the direct friends of person A. P should
include only those friends that are also on a path between A and another
user
Sory, I meant
INCLUDE_AND_PRUNE
the path will be included in the result set, but the traversal
won't go further down that path, but will continue down other paths
that haven't been pruned
--
Mattias Persson, [matt...@neotechnology.com]
Hacker, Neo Technology
www.neotechnology.com
INCLUDE_AND_CONTINUE
the path will be included in the result set and the traversal will
go further down that path
INCLUDE_AND_PRUNE
the path will be included in the result set, but the traversal
will continue from that path
EXCLUDE_AND_CONTINUE
the path won't be included in the result s
That would be EXCLUDE_AND_PRUNE.
On Thu, Apr 7, 2011 at 7:58 AM, Dario Rexin wrote:
> Hi Peter, yes that would be not to include the path in the result set.
>
>
>
> On 07.04.2011, at 07:01, "Peter Neubauer" <
> peter.neuba...@neotechnology.com> wrote:
>
> > Dario,
> > I am not quite sure I under
Hi Peter, yes that would be not to include the path in the result set.
On 07.04.2011, at 07:01, "Peter Neubauer"
wrote:
> Dario,
> I am not quite sure I understand what you mean by "drop" is that not
> to include the path into the result or prune or something else? Do you
> have a concrete e
Dario,
I am not quite sure I understand what you mean by "drop" is that not
to include the path into the result or prune or something else? Do you
have a concrete example of this, maybe a simple toy graph test with
toy information?
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype p
Hello,
we are trying to construct an Evaluator that will select only one node from the
middle of a path and include it in the result. We do have a specific path we
are looking for and the endNode is stored in 'end'. Now what we would like to
do is have an Evaluator like this:
import
14 matches
Mail list logo
