Hi there, What is the difference between using *org.neo4j.graphalgo.impl.path.Dijkstra *class and *org.neo4j.graphalgo.impl.shortestpath.Dijkstra<CostType>* in order to find the shortest path between startNode and endNode?
Thanks Antonio -- 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.
