Class AStar<T>
java.lang.Object
com.inductiveautomation.ignition.designer.blockandconnector.routing.AStar<T>
A* algorithm implementation using the method design pattern.
-
Nested Class Summary
Nested Classes -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionFind the shortest path to a goal starting fromstart.protected DoubleTotal cost function to reach the nodetofromfrom.protected abstract DoubleCost for the operation to go totofromfrom.generateSuccessors(T node) Generate the successors for a given node.getCost()Get the cost to reach the last node in the path.intCheck how many times a node was expanded.protected abstract DoubleEstimated cost to reach a goal node.protected abstract booleanCheck if the current node is a goal for the problem.
-
Constructor Details
-
AStar
public AStar()Default c'tor.
-
-
Method Details
-
isGoal
Check if the current node is a goal for the problem.- Parameters:
node- The node to check.- Returns:
trueif it is a goal,falseotherwise.
-
g
-
h
-
generateSuccessors
-
getExpandedCounter
public int getExpandedCounter()Check how many times a node was expanded.- Returns:
- A counter of how many times a node was expanded.
-
f
-
getCost
Get the cost to reach the last node in the path.- Returns:
- The cost for the found path.
-
compute
-