Package sc.fiji.snt.tracing.heuristic
Class Dijkstra
java.lang.Object
sc.fiji.snt.tracing.heuristic.Dijkstra
- All Implemented Interfaces:
Heuristic
A
Heuristic that always returns zero, reducing A* search to Dijkstra's algorithm.- Author:
- Cameron Arshadi
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptiondoubleestimateCostToGoal(int current_x, int current_y, int current_z, int goal_x, int goal_y, int goal_z) Since Dijkstra's algorithm is equivalent to an A* search where the heuristic function h(x) = 0, return 0.
-
Constructor Details
-
Dijkstra
public Dijkstra()
-
-
Method Details
-
estimateCostToGoal
public double estimateCostToGoal(int current_x, int current_y, int current_z, int goal_x, int goal_y, int goal_z) Since Dijkstra's algorithm is equivalent to an A* search where the heuristic function h(x) = 0, return 0.- Specified by:
estimateCostToGoalin interfaceHeuristic- Returns:
- 0
-