Hi, I am trying to figure out how Neo4j implement algorithms for answering Shortest Path Query. I have 2 questions that I want to answer.
1. I want to know whether it is a disk-based algorithm (disk-based algorithm means not everything is loaded into memory. Hence, a disk-base algorithm can basically support attributed graph with any size). 2. How Neo4j store attributed graph? I looked at SingleSourceShortestPathBFS.java and GraphDatabaseBuilder.java. It seems everything is loaded into memory from a file before doing shortest path search. So, is it true that 1. Neo4j does not use disk-based algorithm 2. Neo4j stores property graph in binary/text file with certain format? Can anyone offer some opinion for me or point me to suitable reference or source code? Any thought would be highly appreciated and very helpful to me. Thanks in advance :) -- You received this message because you are subscribed to the Google Groups "Neo4j" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
