Hi, I was wondering whether, when I calculate the shortest path between two nodes in a "Neo4j" graph (*), if the whole graph is loaded into memory? How does it work? Is there any literature about the way "Neo4j" handles such problems?
Thanks for your insight. Best regards, -- Lmhelp (*) using the "GraphAlgoFactory.shortestPath()" method _______________________________________________ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
