new HeuristicPolicyDijkstra()
Methods
-
static calculate(graph, source, target) → {Number}
-
This heuristic always returns 0. The AStar algorithm behaves with this heuristic exactly like Dijkstra
Parameters:
Name Type Description graph
Graph The graph.
source
Number The index of the source node.
target
Number The index of the target node.
Returns:
Number -The value 0.