I learned from book that using dijkstra can get all shortest path between a given node and others. But I found I just get shortest path between two node using neo4j dijkstra. For example, I want to get shortest path between node A and node B, node A and node C, node A and ... at once.
-- 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.
