Package ruscz.game.gameOfProd.AStar
Class AStar
- java.lang.Object
-
- ruscz.game.gameOfProd.AStar.AStar
-
public class AStar extends java.lang.ObjectA Star Algorithm
-
-
Field Summary
Fields Modifier and Type Field Description private java.util.Set<Node>closedSetprivate static intDEFAULT_DIAGONAL_COSTprivate static intDEFAULT_HV_COSTprivate intdiagonalCostprivate NodefinalNodeprivate inthvCostprivate NodeinitialNodeprivate java.util.PriorityQueue<Node>openListprivate Node[][]searchArea
-
Method Summary
Modifier and Type Method Description private voidaddAdjacentLowerRow(Node currentNode)private voidaddAdjacentMiddleRow(Node currentNode)private voidaddAdjacentNodes(Node currentNode)private voidaddAdjacentUpperRow(Node currentNode)java.util.List<Node>findPath()java.util.Set<Node>getClosedSet()private intgetDiagonalCost()NodegetFinalNode()intgetHvCost()NodegetInitialNode()java.util.PriorityQueue<Node>getOpenList()private java.util.List<Node>getPath(Node currentNode)Node[][]getSearchArea()private voidcheckNode(Node currentNode, int col, int row, int cost)private booleanisEmpty(java.util.PriorityQueue<Node> openList)private booleanisFinalNode(Node currentNode)voidsetBlock(int row, int col)voidsetBlocks(int[][] blocksArray)voidsetClosedSet(java.util.Set<Node> closedSet)private voidsetDiagonalCost(int diagonalCost)voidsetFinalNode(Node finalNode)voidsetHvCost(int hvCost)voidsetInitialNode(Node initialNode)private voidsetNodes()voidsetOpenList(java.util.PriorityQueue<Node> openList)voidsetSearchArea(Node[][] searchArea)
-
-
-
Field Detail
-
DEFAULT_HV_COST
private static final int DEFAULT_HV_COST
- See Also:
- Constant Field Values
-
DEFAULT_DIAGONAL_COST
private static final int DEFAULT_DIAGONAL_COST
- See Also:
- Constant Field Values
-
hvCost
private int hvCost
-
diagonalCost
private int diagonalCost
-
searchArea
private Node[][] searchArea
-
openList
private java.util.PriorityQueue<Node> openList
-
closedSet
private java.util.Set<Node> closedSet
-
initialNode
private Node initialNode
-
finalNode
private Node finalNode
-
-
Method Detail
-
setNodes
private void setNodes()
-
setBlocks
public void setBlocks(int[][] blocksArray)
-
findPath
public java.util.List<Node> findPath()
-
addAdjacentNodes
private void addAdjacentNodes(Node currentNode)
-
addAdjacentLowerRow
private void addAdjacentLowerRow(Node currentNode)
-
addAdjacentMiddleRow
private void addAdjacentMiddleRow(Node currentNode)
-
addAdjacentUpperRow
private void addAdjacentUpperRow(Node currentNode)
-
checkNode
private void checkNode(Node currentNode, int col, int row, int cost)
-
isFinalNode
private boolean isFinalNode(Node currentNode)
-
isEmpty
private boolean isEmpty(java.util.PriorityQueue<Node> openList)
-
setBlock
public void setBlock(int row, int col)
-
getInitialNode
public Node getInitialNode()
-
setInitialNode
public void setInitialNode(Node initialNode)
-
getFinalNode
public Node getFinalNode()
-
setFinalNode
public void setFinalNode(Node finalNode)
-
getSearchArea
public Node[][] getSearchArea()
-
setSearchArea
public void setSearchArea(Node[][] searchArea)
-
getOpenList
public java.util.PriorityQueue<Node> getOpenList()
-
setOpenList
public void setOpenList(java.util.PriorityQueue<Node> openList)
-
getClosedSet
public java.util.Set<Node> getClosedSet()
-
setClosedSet
public void setClosedSet(java.util.Set<Node> closedSet)
-
getHvCost
public int getHvCost()
-
setHvCost
public void setHvCost(int hvCost)
-
getDiagonalCost
private int getDiagonalCost()
-
setDiagonalCost
private void setDiagonalCost(int diagonalCost)
-
-