public class Astar
extends java.lang.Object
Modifier and Type | Field and Description |
---|---|
static boolean |
LOG_ENABLED |
protected AstarAdapter |
mAdapter |
protected boolean |
mClosedNodeRevision |
protected ObjectPool<AstarNode> |
mNodePool |
Constructor and Description |
---|
Astar(AstarAdapter adapter) |
Astar(AstarAdapter adapter,
int nodePoolSize,
boolean closedNodeRevision) |
Modifier and Type | Method and Description |
---|---|
AstarNode |
createNode(int x,
int y)
Check the pool first to either recycle or create a new node
|
AstarNode |
createNode(Point p)
Check the pool first to either recycle or create a new node
|
protected java.util.List<AstarNode> |
extractPath(AstarNode fromNode,
boolean compression) |
java.util.List<AstarNode> |
findPath(AstarNode start,
AstarNode end,
int maxCost,
boolean compressPath)
Find a path between 2 nodes
|
java.util.List<AstarNode> |
findPath(AstarNode start,
AstarNode end,
int maxCost,
boolean compressPath,
java.util.List<AstarNode> closedNodes,
java.util.List<AstarNode> openNodes)
Find a path between 2 nodes
|
AstarNodeSet |
findPosibleNodes(AstarNode start,
AstarNode end,
int maxCost,
java.util.List<AstarNode> closedNodes,
java.util.List<AstarNode> openNodes) |
void |
recycleNodes(AstarNodeSet nodes) |
void |
recycleNodes(AstarNodeSet nodes,
java.util.List<AstarNode> excludes) |
void |
recycleNodes(java.util.List<AstarNode> nodes) |
void |
setNodePoolSize(int nodePoolSize) |
public static boolean LOG_ENABLED
protected AstarAdapter mAdapter
protected ObjectPool<AstarNode> mNodePool
protected boolean mClosedNodeRevision
public Astar(AstarAdapter adapter)
public Astar(AstarAdapter adapter, int nodePoolSize, boolean closedNodeRevision)
public void setNodePoolSize(int nodePoolSize)
public java.util.List<AstarNode> findPath(AstarNode start, AstarNode end, int maxCost, boolean compressPath)
start
- end
- maxCost
- optimizePath
- public java.util.List<AstarNode> findPath(AstarNode start, AstarNode end, int maxCost, boolean compressPath, java.util.List<AstarNode> closedNodes, java.util.List<AstarNode> openNodes)
start
- end
- maxCost
- closedNodes
- openNodes
- public AstarNodeSet findPosibleNodes(AstarNode start, AstarNode end, int maxCost, java.util.List<AstarNode> closedNodes, java.util.List<AstarNode> openNodes)
protected java.util.List<AstarNode> extractPath(AstarNode fromNode, boolean compression)
public AstarNode createNode(int x, int y)
x
- y
- public AstarNode createNode(Point p)
p
- public void recycleNodes(AstarNodeSet nodes)
public void recycleNodes(AstarNodeSet nodes, java.util.List<AstarNode> excludes)
public void recycleNodes(java.util.List<AstarNode> nodes)