Hi Tobias and everyone,
finally found some time to catch up on my traversal and the
RelationshipExpander looks simple and suitable enough. However, which
relationships to return depends on the path traversed so far and in the
RelationshipExpander I only have access to the current node unless I
Since the traversal framework is still a work in progress we are still
tinkering with the API around SourceSelectors and RelationshipExpander.
Mattias Persson and myself are working on creating examples and
documentation as well.
The purpose of the SourceSelector is mainly to determine the order
Yes, one of the goals of the new traversal framework has been to make it
possible to implement algorithms on top of it. You are welcome to help in
that process.
Mattias Persson and myself have started implementing a number of graph
algorithms on top of the traversal framework.
We have discussed
will get many valid
post-order labelings.
Is this possible in the current traversal API or in the Improved framework?
Thanks,
p.s. : This email is indeed a reply to Tobias' A new and improved
Traversal framework message.
[Neo] A new and improved Traversal framework
Tobias Ivarsson
Tue, 30
the children in random order. By this way I will get many valid
post-order labelings.
Is this possible in the current traversal API or in the Improved
framework?
Thanks,
p.s. : This email is indeed a reply to Tobias' A new and improved
Traversal framework message.
[Neo] A new and improved
or in the Improved
framework?
Thanks,
p.s. : This email is indeed a reply to Tobias' A new and improved
Traversal framework message.
[Neo] A new and improved Traversal framework
Tobias Ivarsson
Tue, 30 Mar 2010 06:48:46 -0700
It seems a lot of projects have outgrown
Hi,
I've recently been trying to do some traversal that sort of can be
described with transitions ie. if the last relationship was of type A
and direction INCOMING, the next direction to go might be type A
INCOMING or type B INCOMING; if it was type B INCOMING the next
relationship to
Will the new traversal framework help with implementing some new graph
algorithms? I'm most interested in Bellman-Ford and Ford-Fulkerson.
It seems like the new control over relationship selection in
traversal should help a lot.
There's a lot of fast versions of Bellman-Ford discussed in
that in the DFS the traverser chooses
the children in random order. By this way I will get many valid
post-order labelings.
Is this possible in the current traversal API or in the Improved framework?
Thanks,
p.s. : This email is indeed a reply to Tobias' A new and improved
Traversal framework message.
[Neo
9 matches
Mail list logo
