Hi, I have a graph with 3M nodes and 10M edges. I tried running Dijkstra to get all shortest path but it gets stuck indefinitely. I wrote a plugin to cut short Dijkstra for getting a single path upto a certain depth and that gave me an average response time of 40 seconds for depth 10.
AllShortestPath however returns in average 4 seconds, sometimes returning >100 different paths. Is there anything I am missing because the performance difference seems significant. -- 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.
