AStarSearch(long minCacheSize, long maxTreeSize, P parameterSet) | AStarSearch< N, P, U > | [inline] |
backtraceNode(unsigned int indexOfBestNode, U &pathLength) | AStarSearch< N, P, U > | [inline, private] |
draw(unsigned int indexOfBestNode) | AStarSearch< N, P, U > | [inline, private] |
expandedNodes | AStarSearch< N, P, U > | [private] |
findIndexOfNextNode() | AStarSearch< N, P, U > | [inline, private] |
maxTreeSize | AStarSearch< N, P, U > | [private] |
parameterSet | AStarSearch< N, P, U > | [private] |
search(const N &start, const N &goal, const P ¶meterSet, U &pathLength) | AStarSearch< N, P, U > | [inline] |
searchTree | AStarSearch< N, P, U > | [private] |
testNewNodesAgainstGoal(unsigned int firstNode, unsigned int lastNode, const N &goal) | AStarSearch< N, P, U > | [inline, private] |