Re: [Neo] Problems using Traverse

2009-10-16 Thread Andrea Puddu
Hi Johan, Thanks to your kind help, I've found a solution to my problem. I used Node.getRelationships* methods and it worked fine. Thank you very much again. Regards, Andrea Il giorno 15/ott/2009, alle ore 20.36, Johan Svensson ha scritto: > Ok. > > What type of traversal/query do you need to

Re: [Neo] Problems using Traverse

2009-10-15 Thread Johan Svensson
Ok. What type of traversal/query do you need to perform (start node, nodes that should be returned etc)? Also breadth first traversal consumes more memory then depth first so maybe it is possible to change that? If you do breadth first traversal, end of graph you end up getting the distance from

Re: [Neo] Problems using Traverse

2009-10-14 Thread Andrea Puddu
Johan, My graph has only one type of relationship and it is not hierarchical. More specifically, it represent an encyclopedia where nodes are the Pages and arcs are Links from a Page to another Page. Regards, Andrea Il giorno 14/ott/2009, alle ore 17.26, Johan Svensson ha scritto: > Andrea

Re: [Neo] Problems using Traverse

2009-10-14 Thread Johan Svensson
Andrea, Depending on your graph and the traversal you need to perform there are more memory efficient ways to do it using the core API (Node.getRelationships* methods). If you could describe a bit more in detail how your graph looks (relationship types, is it hierarchical or a graph that have cyc

Re: [Neo] Problems using Traverse

2009-10-14 Thread Andrea Puddu
Hi Johan, thank you for your fast reply. The answer to your question is: Maybe all the nodes of the graph because (this is what I'm trying to understand), my graph is a great unique connected component. My traverser is something like: node.traverse( Traverser.Order.BREADH_FIRST, StopEvaluat

Re: [Neo] Problems using Traverse

2009-10-14 Thread Johan Svensson
Hi, How many nodes do you visit during the traversal? Currently the traverser implementation makes sure you will not visit the same node twice and it does this by storing the nodes visited in a set. -Johan On Wed, Oct 14, 2009 at 12:33 PM, Andrea Puddu wrote: > HI, > > This is my situation, I

[Neo] Problems using Traverse

2009-10-14 Thread Andrea Puddu
HI, This is my situation, I have a graph with about 7Millions of nodes and 50Millions of arcs. When I try to traverse the graph (that maybe have a unique connected component), I always have java heap space problems. Any suggestion about that? Thank you in advance, Andrea ___