Hi,
I have a question regarding traverser, is there a way how I can optimize my
code to use it?
Problem is: my use case is a dense graph with a lot of relationships...
So most of the time I have one node with thousands of relationships
attached.
I have tested my code on the following Graph:
1 roo
I don't know if anyone answered this but I thought I might make a quick
comment.
Traversing the graph is like using the graph as the index. This works very
well if the graph suites the query, bit badly if it doesn't. I think your
case of so many relationships per node does not lead to great perfor
2 matches
Mail list logo
