Dear all,
could somebody point me to more documentation on the new traversal
framework (besides http://wiki.neo4j.org/content/Traversal_Framework)?
Also the new Evaluator and how to use it?
If we have a graph described in the pipes Co-Developers example
(https://github.com/tinkerpop/pipes/wiki
Hi all,
Hopefully most of you are familiar with the traversal framework that was
introduced in 1.1. It's powerful and provides for reusable traversal
descriptions. It has some flaws though, and I would like to discuss one of
them here.
The traversal framework has this concept of pruning, which
Hi all,
I would like to detect all cycles in a traversal.
I know the traversal framework has cycle avoidance built-in, but there
doesn't seem to be an API for cycle detection!
Has anyone already implemented a cycle detector for traversals?
Thanks in advance,
Wouter
, Direction.INCOMING).traverse(startNode);
i.e. add more relationship types by just calling the relationships method
multiple times.
2011/3/14 Massimo Lusetti mluse...@gmail.com
I'm using the Traversal framework
(http://wiki.neo4j.org/content/Traversal_Framework) and I would like
to know if I'm
I'm using the Traversal framework
(http://wiki.neo4j.org/content/Traversal_Framework) and I would like
to know if I'm using it the way it has thought to be.
I need to deeply traverse the graph going down through different
RelationshipTypes so I do a first TraversalDescription and while
iterating
(startNode);
for(Relationship relB : nodeA.getRelationships(B)) {
Node nodeB = relB.getOtherNode(nodeA);
// nodeB will be the node (3) from the above example
}
}
One question before I dive into this... Do the Traversal framework
involve performance improvements over
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
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
(and the regular evaluators that go with it).
Now the big downer to this all:
I still have to write the traversal framework, which will actually follow
the Standard Neo4j framework, but will certainly make traversals composable.
Every Vertex is not just a Vertex, but it is also a bunch of paths
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
am
missing something. So how can make my expander use the path info?
Thanks and best regards,
Georg
On 19.05.2010 09:46, Tobias Ivarsson wrote:
Since the traversal framework is still a work in progress we are still
tinkering with the API around SourceSelectors and RelationshipExpander
On Mon, Mar 14, 2011 at 3:13 PM, Mattias Persson
matt...@neotechnology.com wrote:
Would you like to do a traversal where relationships of different types can
be traversed? That can/should be done with one traversal, one
TraversalDescription:
Traversal.description()
.relationships
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
Montag david.mon...@neotechnology.com
wrote:
Hi all,
Hopefully most of you are familiar with the traversal framework that was
introduced in 1.1. It's powerful and provides for reusable traversal
descriptions. It has some flaws though, and I would like to discuss one of
them here
is needed to be returned, you just add another enum and don't have to
change all the existing values..
Hope this makes sense.
--- Yaniv
On Fri, Nov 5, 2010 at 8:56 PM, David Montag david.mon...@neotechnology.com
wrote:
Hi all,
Hopefully most of you are familiar with the traversal framework
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
Respected,
I would to know that is there any method to count the number of nodes and
relationships traversed by the traversal framework.
Like path.length() --- which gives the depth of the tree. So as like that
method is there any direct one?
For example,
If a tree consist of several nodes
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
http
Hello,
We are trying to use neo4j graph database in one of our applications.
I think we hit a roadblock with traversal framework. It could be due to our
limited knowledge of neo4j framework.
Here is what we are trying to accomplish:
We need to get a path(from the graph below) from the nodes
On Sun, Feb 20, 2011 at 10:48 AM, Alfredas Chmieliauskas
al.fre...@gmail.com wrote:
Dear all,
could somebody point me to more documentation on the new traversal
framework (besides http://wiki.neo4j.org/content/Traversal_Framework)?
Also the new Evaluator and how to use it?
That page
I like the pipes idea. What I would like to see is nested traversers. The
pipe example below seems to imply single hops at each step, but it would be
nicer to allow each step to traverse until it reached a certain criteria, at
which point a different traversal would take over.
In the old
Hi,
Just to be picky:
The easiest way to do that in this case is by adding:
.uniqueness(Uniqueness.NODE_PATH)
A co-creator's co-creator can be you. Thus, marko's co-creator's co-creator is
marko (amongst other people). In this case, unique on a path would not fail,
no? Can you do something
Hi,
I setup a traversal description with Uniqueness.NODE_PATH and the side
effect is duplicated nodes output.
How to filter the duplicated output in nodes and relationship under
your Transversal Framework?
Also, this link isn't working
http://components.neo4j.org/neo4j-kernel/apidocs/org/neo4j
to
change all the existing values..
Hope this makes sense.
--- Yaniv
On Fri, Nov 5, 2010 at 8:56 PM, David Montag
david.mon...@neotechnology.com
wrote:
Hi all,
Hopefully most of you are familiar with the traversal framework that was
introduced in 1.1. It's powerful and provides
enum and don't have
to
change all the existing values..
Hope this makes sense.
--- Yaniv
On Fri, Nov 5, 2010 at 8:56 PM, David Montag
david.mon...@neotechnology.com
wrote:
Hi all,
Hopefully most of you are familiar with the traversal framework that was
introduced in 1.1. It's
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
interested at
looking at your API (if I may) to see if there is some ideas that can be
used to improve the traversal API of Neo4j. Or if you just have suggestions
on what you think the traverser framework should be enhanced with I will
gladly accept those as well.
I hope this shines at least
of this new API.
I started using this framework from day 1 since I'm new and I don't
have background from Node.traverse(). If I understand correctly this
will be THE traversal framework right?
It's experimental but you use this from within Node.traverse so it's
not that experimental I guess
the traversal:
1. traverser framework
2. nested loops
Both do have their pros and cons, I think.
Any suggestions for improvements on the code?
Wich one would you choose?!
/anders
___
Neo mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman
I don't think the python bindings (or any other binding) has caught up
to the new traversal framework. Uniqueness is all about when to visit
a node and when not to. If the uniqueness would be NODE_GLOBAL a node
wouldn't be visited more than once in a traversal. NODE_PATH means
that a node won't
On 2 June 2010 16:21, Mattias Persson matt...@neotechnology.com wrote:
I don't think the python bindings (or any other binding) has caught up
to the new traversal framework. Uniqueness is all about when to visit
a node and when not to. If the uniqueness would be NODE_GLOBAL a node
wouldn't
On Tue, Mar 30, 2010 at 4:20 PM, Marko Rodriguez okramma...@gmail.comwrote:
Hi guys,
For what its worth
I have yet to use the Neo4j traversal framework because it is simply is not
expressive enough. The traverser framework is like a single-relational
traverser on a multi-relational
Hi Ido,
You make excellent points. The traversal API that you're referring
to (Node.traverse) is however considered a legacy, stable API. What you are
looking for is probably the newer, unstable API of the new traversal
framework. You can read more about it here:
http://wiki.neo4j.org/content
Thanks.
On Sun, Feb 20, 2011 at 2:24 PM, Tobias Ivarsson
tobias.ivars...@neotechnology.com wrote:
On Sun, Feb 20, 2011 at 10:48 AM, Alfredas Chmieliauskas
al.fre...@gmail.com wrote:
Dear all,
could somebody point me to more documentation on the new traversal
framework (besides http
All,
(I am new to this list)
Looking at the Trarversal framework[1], I assumed that the
TraversalDescription.filter[2] worked similarly to
TraversalDescription.prune[3]. If any prune rejects a path, it is
rejected - similarly I expected, that if any filter excluded a path,
the path was excluded
criteria,
at
which point a different traversal would take over.
In the old and current API's it seems to do this you need to create a
traversal, iterate over it, and create a new traversal inside the loop.
We created a Ruby DSL for nested traversals a year or so ago that looks a
bit like
The DB would do it in memory too, wouldn't it? In the case of a complex
traversal, indexes don't really apply, since the ordering and the traversal
order are unrelated, so you'd generally need to sort in memory anyway. Whether
you do it as you add elements to the traversed list of stuff or do
Hi,
Traversal.description()
.depthFirst()
.relationships(RelationshipTypes.CREATED, Direction.BOTH)
.traverse(developer).nodes()
To be clear, a co-creator is someone is who has created the same things as you
and who is not you. Thus, you need to go outgoing CREATED, then incoming
CREATED,
Hi,
I would like to fetch a ending portion of a path where the timestamp
of the relationship match. for example:
(Node 1)---2pm(Node 3)---3PM---(Node 4)4PM---(Node 64)
from the above , I only want the subpath starting from Node 4 onward
for the timestamp greater than 3:30PM
How could
traversal framework is
that it returns nodes. The new framework returns paths leading from
the start node up to that node. You still make include/exclude
decisions based on the current position of the traversal, just that in
the new framework you've got the full path in addition to the current
node
Hi,
We looking into the options for sharding Neo4j. Using Gizzard (which is a
sharding framework from Twitter) seemed to be one of the possibilities. I
posting here so that everyone can evaluate this possibility and offer
suggestions. Did anyone else try sharding of Neo4j?
I have the following
)
-prune(PruneEvaluator)
-filter(PredicatePath)
Also I've added lots of useful evaluators in an Evaluators class, but
maybe those should reside in Traversal class instead, however I think
Traversal class is a little bloated as it is now.
There's the decision whether or not this thing
SKIP_AND_STOP
class TraversalDescription
+evaluator(Evaluator)
-prune(PruneEvaluator)
-filter(PredicatePath)
Also I've added lots of useful evaluators in an Evaluators class, but
maybe those should reside in Traversal class instead, however I think
Traversal class
getSingle() to retrieve a single matching node.
See also:
http://wiki.neo4j.org/content/Index_Framework
Other ways of accessing nodes in the db are getById() or traversal using the
traversal framework
or manual traversal starting from the reference node (gDB.getReferenceNode())
that you should
Hi,
Now that looks interesting! But why limit it to a pipe and not merge
it with the Graph Matching component, so we can find non-linear
subgraphs with the same API? Or did I misunderstand the concept?
Graph matching can be seen as a subset of graph traversal. Meaning,
any graph match
the combination of
relationship types(without regard to order) and relationship properties to
return the desired path.
Can it be achievable in the current traversal framework?
REL1 REL2REL8
A - X - Y --- Z
REL1REL2 REL3
Hi Rick,
On 15 July 2011 17:24, Rick Bullotta rick.bullo...@thingworx.com wrote:
But you couldn't easy do a complex traversal with an RDBMS. ;-)
Yeah, so you are on me, from neo4j I could only expect to deal really good
with traversals, when you need some simple thing like ordering nodes, you
1 since I'm new and I don't
have background from Node.traverse(). If I understand correctly this
will be THE traversal framework right?
It's experimental but you use this from within Node.traverse so it's
not that experimental I guess? ... Did you suggest to use this or the
old API?
Plus the page
Hi Joshi,
the problem may be that your traversal description will traverse from
actor to director (in both directions) and also from director to
actors (also in both directions).
Your manual traverser traverses actors to directors in both
directions and then only incoming relationships from
Im enjoying Neo4J so far. The new Traversal framework has a lot of
potential. However, Id like to propose an extension to the
RelationshipExpander interface or have someone tell me of another way
to accomplish a task.
Here is an outline of the basics of my network:
Producer
in a lot of settings. At least for you and me ;)
Regards,
Stephan
On Wed, Apr 13, 2011 at 11:23, bhargav gunda bhargav@gmail.com
wrote:
Respected,
I would to know that is there any method to count the number of nodes and
relationships traversed by the traversal framework.
Like
Hi Tim!
Maybe you can use the new traversal framework, this interface comes to mind:
http://components.neo4j.org/neo4j-kernel/apidocs/org/neo4j/graphdb/traversal/SourceSelector.html
Regarding the number of relationships, it could be a good idea to store
it as a property on the node.
/anders
cycles.
Something like this you're looking for?
2011/3/25 Wouter De Borger w.debor...@gmail.com
Hi all,
I would like to detect all cycles in a traversal.
I know the traversal framework has cycle avoidance built-in, but there
doesn't seem to be an API for cycle detection!
Has anyone already
performance: if you need to do such a query very often, at least
I would do some indexing to make it possible to start the traversal as
close as possible. In general: find this kind of chronological,
timestamped data series better to be stored in MySQL or similar for
queries. Ok, Peter other guys from Neo
. We're unable to
find the equivalent functionality with the new Traversal framework.
Thanks
Stephan
On Thu, Apr 7, 2011 at 09:35, Mattias Persson matt...@neotechnology.comwrote:
Sory, I meant
INCLUDE_AND_PRUNE
the path will be included in the result set, but the traversal
won't go further
for such a scenario, to
boost things up ?
Ideally, the Traversal framework could use automatic/declerative indexing on
Node Relationship types and/or direction to perform such traversals quicker.
Regards
___
Neo4j mailing list
User@lists.neo4j.org
https
(and hopefully you can do the mapping to the core Neo4j
traverser framework),
results = []
g.v(1).out('friend').out('likes') results // what my friends like
results.sort{a,b - a.name = b.name} // sort resultant vertices by
name
In short, once you have the result of your traversal, you can
...@neotechnology.comwrote:
You might also try to use cypher for your traversal which is able to order
(also in memory of course).
See the screencast I did:
http://neo4j.vidcaster.com/U2Y/introduction-to-cypher/
It's even the same domain.
Cheers
Michael
Am 15.07.2011 um 17:24 schrieb Rick Bullotta
in Berlin!
On 15 July 2011 19:37, Michael Hunger michael.hun...@neotechnology.comwrote:
You might also try to use cypher for your traversal which is able to order
(also in memory of course).
See the screencast I did:
http://neo4j.vidcaster.com/U2Y/introduction-to-cypher/
It's even
know you really want
to promote your language, xD!
- purbon
PD: See you next graphdb meetup in Berlin!
On 15 July 2011 19:37, Michael Hunger michael.hun...@neotechnology.comwrote:
You might also try to use cypher for your traversal which is able to order
(also in memory of course
for this in the issue tracking system:
https://trac.neo4j.org/ticket/260
Cheers,
Tobias
On Mon, Sep 13, 2010 at 10:58 AM, Morten Barklund mor...@barklund.dkwrote:
All,
(I am new to this list)
Looking at the Trarversal framework[1], I assumed that the
TraversalDescription.filter[2] worked similarly
step, but it
would
be
nicer to allow each step to traverse until it reached a certain
criteria,
at
which point a different traversal would take over.
In the old and current API's it seems to do this you need to create a
traversal, iterate over it, and create a new traversal inside
I would think that the graph structure definitely matters, in that there may be
optimizations that can be achieved via indexing/querying vs traversal and
sorting (or a hybrid of the two) depending on the specifics.
-Original Message-
From: user-boun...@lists.neo4j.org [mailto:user-boun
Well, the thing is that the database can easy deal with that, as the
relational system do.
/ purbon
On 15 July 2011 17:08, Rick Bullotta rick.bullo...@thingworx.com wrote:
The DB would do it in memory too, wouldn't it? In the case of a complex
traversal, indexes don't really apply, since
of directors (for the given Actor1). The traversal
description I wrote looks like :
Actor1 -- Director1 -- Actor2
Actor1 -- Director2 --Actor2
Actor1 -- Director3 -- Actor2
Actor1 -- Director4 -- Actor3
... and so on
for(Node otherActorNode : Traversal.description().relationships
the traversal framework has cycle avoidance built-in, but there
doesn't seem to be an API for cycle detection!
Has anyone already implemented a cycle detector for traversals?
Thanks in advance,
Wouter
___
Neo4j mailing list
User
.
Is there any way to use Indexing on relationships for such a scenario, to
boost things up ?
Ideally, the Traversal framework could use automatic/declerative indexing on
Node Relationship types and/or direction to perform such traversals quicker.
Regards
Hi Pere,
To sort you need to have all your results.
Thus, in Gremlin (and hopefully you can do the mapping to the core Neo4j
traverser framework),
results = []
g.v(1).out('friend').out('likes') results // what my friends like
results.sort{a,b - a.name = b.name} // sort resultant vertices
to the core Neo4j
traverser framework),
results = []
g.v(1).out('friend').out('likes') results // what my friends like
results.sort{a,b - a.name = b.name} // sort resultant vertices by name
In short, once you have the result of your traversal, you can then apply a
comparator
, but
maybe those should reside in Traversal class instead, however I think
Traversal class is a little bloated as it is now.
There's the decision whether or not this thing could go into 1.2 or
not...
For one thing it breaks the API, but then again the
PruneEvaluator/PredicatePath (filter) can
?
Ideally, the Traversal framework could use automatic/declerative indexing on
Node Relationship types and/or direction to perform such traversals quicker.
Regards
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman
directional
traversal
* It stops on the depth it finds the first hit on
Shortest path algo is implemented from scratch to be optimized for just
that, but allSimplePaths uses traversal framework which doesn't support
bidirectional traversals yet, although there have been some experiments
On Sun, Feb 20, 2011 at 7:04 PM, Marko Rodriguez okramma...@gmail.comwrote:
Hi,
Traversal.description()
.depthFirst()
.relationships(RelationshipTypes.CREATED, Direction.BOTH)
.traverse(developer).nodes()
To be clear, a co-creator is someone is who has created the same things as
you
On Tue, Mar 15, 2011 at 9:11 AM, Mattias Persson
matt...@neotechnology.com wrote:
I'm positive that some nice API will enter the kernel at some point, f.ex.
I'm experimenting with an API like this:
for(Node node :
Hi folks,
just commited some example code to show the use of
Uniqueness.NODE_PATH in the Neo4j traversal framework in order to
return paths that share nodes.
http://docs.neo4j.org/chunked/snapshot/examples-uniqueness-of-paths-in-traversals.html
Enjoy!
Cheers,
/peter neubauer
GTalk
to the core
Neo4j
traverser framework),
results = []
g.v(1).out('friend').out('likes') results // what my friends like
results.sort{a,b - a.name = b.name} // sort resultant vertices by
name
In short, once you have the result of your traversal, you can then
apply
framework is
that it returns nodes. The new framework returns paths leading from
the start node up to that node. You still make include/exclude
decisions based on the current position of the traversal, just that in
the new framework you've got the full path in addition to the current
node (the end
2011/4/13 Peter Neubauer neubauer.pe...@gmail.com:
Of course,
You can have a count outside your traversal description that for instance
and Evaluator is updating since it is called for all traversed nodes. This
is not thread safe but I think it will give you the data you want?
Traversals
of settings. At least for you and me ;)
Regards,
Stephan
On Wed, Apr 13, 2011 at 11:23, bhargav gunda bhargav@gmail.com
wrote:
Respected,
I would to know that is there any method to count the number of nodes
and
relationships traversed by the traversal framework.
Like
for you and me ;)
Regards,
Stephan
On Wed, Apr 13, 2011 at 11:23, bhargav gunda bhargav@gmail.com wrote:
Respected,
I would to know that is there any method to count the number of nodes and
relationships traversed by the traversal framework.
Like path.length() --- which gives the depth
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 pd_aficion
to
return the desired path.
Can it be achievable in the current traversal framework?
REL1 REL2REL8
A - X - Y --- Z
REL1REL2 REL3REL4
A - B - C --- D - E
REL1REL3
: relProp= abc in REL3
I was not able to define an evaluator which takes the combination of
relationship types(without regard to order) and relationship properties
to
return the desired path.
Can it be achievable in the current traversal framework?
REL1 REL2REL8
a
lot to us in this matter.
The refactorings in the graph-algo component will to a large extent build on
the new traversal framework. Some algorithms will be possible to implement
using the new framework that were not possible to implement using the old
framework. This will greatly simplify
...@gmail.com
Hi all,
I would like to detect all cycles in a traversal.
I know the traversal framework has cycle avoidance built-in, but there
doesn't seem to be an API for cycle detection!
Has anyone already implemented a cycle detector for traversals?
Thanks in advance,
Wouter
://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.
On Wed, May 11, 2011 at 12:41 AM, Jean-Pierre Bergamin jpberga...@gmail.com
wrote:
Thank you Tobias. This new traversal framework looks much more powerful
and fluent then the traverser I have been playing with so far
...@gmail.com
wrote:
Thank you Tobias. This new traversal framework looks much more powerful
and fluent then the traverser I have been playing with so far. The
getting
started guide should definitively point to it.
Best regards,
James
2011/5/11 Tobias Ivarsson tobias.ivars
the computation by the db.
/ purbon
On 15 July 2011 16:10, Marko Rodriguez okramma...@gmail.com wrote:
Hi Pere,
To sort you need to have all your results.
Thus, in Gremlin (and hopefully you can do the mapping to the core Neo4j
traverser framework),
results = []
g.v(1).out('friend
There's no such statistics in the traversal framework, no. But your solution
with your own counter in the Evaluator would show you how many nodes was
encountered during the traversal (for the selected uniqueness setting).
2011/4/18 bhargav gunda bhargav@gmail.com
Respected,
here
framework, so expect things to
change (and break) more. It's good that you report this though, since
examples should be updated to match the best practices. The new traversal
API is after all not stable yet (since 1.1 has not been released), but
I apologize for the inconvenience anyhow.
Cheers
advanced. If you would like to force the traversal down a very defined
path then go with the core API, like:
for(Relationship relA : startNode.getRelationships(A)) {
Node nodeA = relA.getOtherNode(startNode);
for(Relationship relB : nodeA.getRelationships(B)) {
Node nodeB
, April 02, 2011 2:47 AM
To: user@lists.neo4j.org
Subject: [Neo4j] Looking for value from array-typed relationship property in
traversal return filters (REST API)
Hi there,
I am getting pretty excited with the power of return evaluators in
traversing framework. However, since I am using the REST
a traverser.,
but that is deprecated in the current milestone release. We're unable to
find the equivalent functionality with the new Traversal framework.
ReturnableEvaluator is like controlling the INCLUDE/EXCLUDE part of an
evaluation
StopEvaluator is like controlling the CONTINUE/PRUNE part
Thank you Tobias. This new traversal framework looks much more powerful
and fluent then the traverser I have been playing with so far. The getting
started guide should definitively point to it.
Best regards,
James
2011/5/11 Tobias Ivarsson tobias.ivars...@neotechnology.com
the first
version of the Traversal framework, where there is not only a
StopEvaluator, but even a ReturnEvaluator that determines what to return.
Alternatively, have a look at Cypher (
http://docs.neo4j.org/chunked/snapshot/tutorials-cypher-java.html from
Java) with the LIMIT keyword, see
http
on relationships for such a scenario, to
boost things up ?
Ideally, the Traversal framework could use automatic/declerative indexing
on
Node Relationship types and/or direction to perform such traversals
quicker.
Regards
___
Neo4j mailing
that the deeper
the traversal goes the more it gains compared to a single directional
traversal
* It stops on the depth it finds the first hit on
Shortest path algo is implemented from scratch to be optimized for just
that, but allSimplePaths uses traversal framework which doesn't support
on the depth it finds the first hit on
Shortest path algo is implemented from scratch to be optimized for just
that, but allSimplePaths uses traversal framework which doesn't support
bidirectional traversals yet, although there have been some experiments
with that too so perhaps soon!
2011/11
graphdb meetup in Berlin!
On 15 July 2011 19:37, Michael Hunger
michael.hun...@neotechnology.comwrote:
You might also try to use cypher for your traversal which is able to order
(also in memory of course).
See the screencast I did:
http://neo4j.vidcaster.com/U2Y/introduction-to-cypher
1 - 100 of 242 matches
Mail list logo
