public class AStarResult<NODE> extends Object
Modifier and Type | Field and Description |
---|---|
Collection<NODE> |
closeList
Nodes which were examined by the algoritm.
|
HashMap<NODE,Integer> |
estimatedCost
Used and filled by A* alorithm (AStar.aStar()).
|
NODE |
goalNode
Node which was marked as a goalNode by AStarMap.
|
long |
interations
Contains the number of iterations made by A* search.
|
Collection<NODE> |
openList
List of nodes which is opened -> was touched by the algorithm and are
subjects of examination.
|
HashMap<NODE,Integer> |
pathCost
Used and filled by A* algorithm (AStar.aStar()).
|
HashMap<NODE,NODE> |
previousNode
Used by getPath() and filled by A* algorithm (AStar.aStar()).
|
NODE |
startNode
Start node of the A*.
|
boolean |
success
Whether goalNode was found during the A* run.
|
Constructor and Description |
---|
AStarResult() |
Modifier and Type | Method and Description |
---|---|
int |
getCostToNode(NODE node)
Returns cost of the path from startNode to node if the node was touched
by A* algorithm (if A* was successful, then this always contains the goalNode
and every node on the path).
|
int |
getDistanceToGoal()
If the AStar succeeded then it returns the distance to the goal.
|
int |
getEstimatedCostToNode(NODE node)
Returns estimated cost of the path from startNode to goal through node.
|
List<NODE> |
getPath()
Returns the path from startNode to goalNode.
|
NODE |
getPreviousNode(NODE node)
Used by getPath() method when creating a list of nodes (the path) from startNode
to goalNode.
|
void |
putCostToNode(NODE node,
Integer cost)
Assing cost of the path from startNode to node.
|
void |
putEstimatedCostToNode(NODE node,
Integer cost)
Assing estimated cost of the path from startNode to goalNode through node.
|
void |
putPreviousNode(NODE node,
NODE previous)
Assing 'previous' as an previous node for 'node' (the path from 'startNode' to 'node' goes across 'previous').
|
public HashMap<NODE,NODE> previousNode
public Collection<NODE> openList
public Collection<NODE> closeList
public HashMap<NODE,Integer> pathCost
public HashMap<NODE,Integer> estimatedCost
public long interations
public NODE startNode
public NODE goalNode
public boolean success
public NODE getPreviousNode(NODE node)
node
- public void putPreviousNode(NODE node, NODE previous)
node
- previous
- public int getCostToNode(NODE node)
node
- public void putCostToNode(NODE node, Integer cost)
node
- cost
- public int getEstimatedCostToNode(NODE node)
node
- public void putEstimatedCostToNode(NODE node, Integer cost)
node
- cost
- public List<NODE> getPath()
public int getDistanceToGoal()
Copyright © 2012 AMIS research group, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic. All Rights Reserved.