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> > There is a tentative new traversal API included in Neo4j that features this > functionality: > > org.neo4j.kernel.Traversal.description().expand( > org.neo4j.kernel.Traversal.expanderForAllTypes( Direction.OUTGOING ) ); > > You can read more about it here: > http://wiki.neo4j.org/content/Traversal_Framework > > Cheers, > Tobias > > On Wed, May 11, 2011 at 9:08 AM, Jean-Pierre Bergamin > <jpberga...@gmail.com>wrote: > > > Hello neo4j users > > > > I'm just diving into neo4j and playing around with graph algorithms and > > traversers. > > As a start, I just wanted to traverse the whole graph with all > relationship > > types in the OUTGOING direction. The traverse() method always expects a > > RelationshipType. > > Is there a simpler way to traverse all RelationshipTypes then building up > > an > > array that contains all types and the outgoing direction (as described > here > > http://sujitpal.blogspot.com/2009/06/custom-traverser-for-neo4j.html)? > > > > > > Thanks for the help, > > James > > _______________________________________________ > > Neo4j mailing list > > User@lists.neo4j.org > > https://lists.neo4j.org/mailman/listinfo/user > > > > > > -- > Tobias Ivarsson <tobias.ivars...@neotechnology.com> > Hacker, Neo Technology > www.neotechnology.com > Cellphone: +46 706 534857 > _______________________________________________ > Neo4j mailing list > User@lists.neo4j.org > https://lists.neo4j.org/mailman/listinfo/user > _______________________________________________ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
