On Wed, Nov 30, 2011 at 9:13 AM, Michael Hunger < michael.hun...@neotechnology.com> wrote:
> what about > > start c=node(1) > match path = c<-[*]->n > return NODES(path) > Ouch... This is probably a rather slow query. It starts from 'c' and goes all the way out to the end of the graph for, for every path connected from c. And that could be a LOT of paths. I don't think this is what dnagir was looking for :) Andrés _______________________________________________ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
