Date: Tue, 2 Aug 2011 23:05:17 +0200
From: matt...@neotechnology.com
To: user@lists.neo4j.org
Subject: Re: [Neo4j] Composable traversals
Cool. To not mess around with interfaces too much I'm thinking of having:
TraversalDescription#traverse( Node startNode, Node
Subject: Re: [Neo4j] Composable traversals
Yes, FYI that's the exact thing we've been discussing :)
2011/7/29 Niels Hoogeveen pd_aficion...@hotmail.com
Great, I would much rather see this become part of the core API than
have
this as part of the Enhanced API.
To make things
Subject: Re: [Neo4j] Composable traversals
Cool. To not mess around with interfaces too much I'm thinking of having:
TraversalDescription#traverse( Node startNode, Node...
additionalStartNodes );
TraversalDescription#traverse( Path startPath, Path...
additionalStartPaths
are just special cases
where IterablePath consists of 1 path, with just 1 element.
Niels
Date: Fri, 29 Jul 2011 18:36:28 +0200
From: matt...@neotechnology.com
To: user@lists.neo4j.org
Subject: Re: [Neo4j] Composable traversals
There have been thoughts a long while to make something like
Subject: Re: [Neo4j] Composable traversals
Hey Niels,
As they are composable, is java going to keep track of things, like if
recursive, in stack ? or in array/variables ? or the graph could keep track
of what's beep parsed so far, in-graph ? (I mean, this question applies for
non-composable too
There have been thoughts a long while to make something like this with the
traversal framework, but time has never been allocated to evolve it. I'm
adding stuff to the framework in a side track and will surely add some
aspect of composable traversers also.
2011/7/29 Niels Hoogeveen
:36:28 +0200
From: matt...@neotechnology.com
To: user@lists.neo4j.org
Subject: Re: [Neo4j] Composable traversals
There have been thoughts a long while to make something like this with the
traversal framework, but time has never been allocated to evolve it. I'm
adding stuff to the framework
I'd like to take a stab at implementing traversals in the Enhanced API. One of
the things I'd like to do, is to make traversals composable.
Right now a Traverser is created by either calling the traverse method on Node,
or to call the traverse(Node) method on TraversalDescription.
This
Hey Niels,
As they are composable, is java going to keep track of things, like if
recursive, in stack ? or in array/variables ? or the graph could keep track
of what's beep parsed so far, in-graph ? (I mean, this question applies for
non-composable too; personally i like the idea of in-graph
9 matches
Mail list logo