AStar() | PathFind::AStar< MARKER, CLOSED > | |
createStatistics() | PathFind::AStar< MARKER, CLOSED > | [virtual] |
findNode(int nodeId) | PathFind::AStar< MARKER, CLOSED > | [private] |
findPath(const Environment &env, int start, int target) | PathFind::AStar< MARKER, CLOSED > | [virtual] |
findPathAStar(int start) | PathFind::AStar< MARKER, CLOSED > | [private] |
finishSearch(int start, const AStarNode &node) | PathFind::AStar< MARKER, CLOSED > | [private] |
getBestNodeFromOpen() | PathFind::AStar< MARKER, CLOSED > | [private] |
getNodesLimit() const | PathFind::Search | [inline] |
getPath() const | PathFind::AStar< MARKER, CLOSED > | [inline, virtual] |
getPathCost() const | PathFind::AStar< MARKER, CLOSED > | [inline] |
getStatistics() const | PathFind::AStar< MARKER, CLOSED > | [virtual] |
getVisitedNodes() const | PathFind::AStar< MARKER, CLOSED > | [inline, virtual] |
m_branchingFactor | PathFind::AStar< MARKER, CLOSED > | [private] |
m_closed | PathFind::AStar< MARKER, CLOSED > | [private] |
m_env | PathFind::AStar< MARKER, CLOSED > | [private] |
m_nodesExpanded | PathFind::AStar< MARKER, CLOSED > | [private] |
m_nodesLimit | PathFind::Search | |
m_nodesVisited | PathFind::AStar< MARKER, CLOSED > | [private] |
m_open | PathFind::AStar< MARKER, CLOSED > | [private] |
m_path | PathFind::AStar< MARKER, CLOSED > | [private] |
m_pathCost | PathFind::AStar< MARKER, CLOSED > | [private] |
m_statistics | PathFind::AStar< MARKER, CLOSED > | [private] |
m_target | PathFind::AStar< MARKER, CLOSED > | [private] |
m_visitedNodes | PathFind::AStar< MARKER, CLOSED > | [private] |
Search() | PathFind::Search | |
setNodesLimit(long long int nodesLimit) | PathFind::AStar< MARKER, CLOSED > | [inline] |
~Search() | PathFind::Search | [virtual] |