Hi all, I understand how to use java / cypher to make a traversal. However, I'm more interested in the underlining algorithm used in Neo4j, eg BFS, DFS, dijkstra. With this knowledge I would like to do some optimizations in hardware. And I'm not very familiar with code structure of Neo4j. So anyone could give me a link to specific how graph algorithm/ iterator implemented will be appreciated. Thanks a lot!
Best Wishes, Jer -- 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.
