Will the new traversal framework help with implementing some new graph algorithms? I'm most interested in Bellman-Ford and Ford-Fulkerson. It seems like the new control over relationship selection in traversal should help a lot.
There's a lot of fast versions of Bellman-Ford discussed in http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.139.4171&rep=rep1&type=pdf , and I can see how I'd implement some of them if I had the graph entirely in memory(as in networkx for Python). I'm not sure how different neo4j would be for implementing these. The instance sizes I'm interested in running these on would probably be small enough to fit entirely in memory, but I'm really excited about neo4j's support for persistence and transactions. Thanks for any input you have on this. Best, JP _______________________________________________ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
