[Neo4j] finding all shortest paths between one node and all other nodes in a large scale databse

2011-05-11 Thread
Hi, I'm trying to use Neo4j graph database to store a large social network(more than 5,000,000 nodes) for academic research. I need to compute the separation degree(path length) between any two nodes in the graph then get the average degree of whole database. The solution I'm using use now is

Re: [Neo4j] finding all shortest paths between one node and all other nodes in a large scale databse

2011-05-12 Thread
- Scandinavia's coolest Bring-a-Thing party. On Wed, May 11, 2011 at 12:47 AM, 翁瑞廷 wshir...@gmail.com wrote: Hi, I'm trying to use Neo4j graph database to store a large social network(more than 5,000,000 nodes) for academic research. I need to compute the separation degree(path length