Hi Javier, I think the simplest thing is to write a traverser that reaches every node on the graph through every relationship.
Jim On 12 Jul 2011, at 12:18, Javier de la Rosa wrote: > Hi all, > > I know that I could do this using indices, but it's not for me the > most natural way to do it. I'm just wondering if there're another way > to return all the relationships and all the nodes in the database > using the same mechanism for paginating the results that traversals > does. > > Best regards. > > -- > Javier de la Rosa > http://versae.es > _______________________________________________ > Neo4j mailing list > [email protected] > https://lists.neo4j.org/mailman/listinfo/user _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
