http://docs.neo4j.org/chunked/stable/rest-api-graph-algos.html
On Monday, August 25, 2014 2:12:57 PM UTC-4, Leo B wrote: > > Being a newbie with graphs, I'm looking whether it's possible to use Neo4j > to calculate an optimal route which passes through all entered waypoints > (distances are weights of the edges). > > I'm familiar with ability to use A* and Dijkstra to find shortest/cheapest > paths, but haven't found an easy way to do this. Since the number of nodes > for each calculation will be relatively small (< 30), I'm primarily hoping > for ease of implementation with Neo4j (if possible) compared to coding the > solution from scratch in Node.js, since I guess performance won't be a > problem at this scale. > > Thank you for your time! > -- 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.
