I need a solution to build a query in neo4j that returns shortest path(using Floyd–Warshall or another good algo) making math operation at every algoritm iteration. I have made a little explaination:
<https://lh5.googleusercontent.com/-WEc4DMw5dCA/U0wWIjguMpI/AAAAAAAAAB0/vwYv5utzsgo/s1600/dp.png> My graph is stored in a neo4j environment and it can increase in a serious way his dimension. I use rest with everyman php neo4j libraries. What is the best way to do this? Traversal, cypher, gremilins, code a custom algorithm starting from http://components.neo4j.org/neo4j-graph-algo/1.4/xref/org/neo4j/graphalgo/impl/shortestpath/FloydWarshall.html ? Tnx 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.
