| addCache(int nodeId, int f, int g, int iteration) | PathFind::IDAStar | [inline, private] |
| Caching enum name | PathFind::IDAStar | |
| checkCache(int nodeId, int f, int g, int iteration, int &f_min) | PathFind::IDAStar | [private] |
| createStatistics() | PathFind::IDAStar | [virtual] |
| F_CACHING enum value | PathFind::IDAStar | |
| f_CACHING enum value | PathFind::IDAStar | |
| findPath(const Environment &env, int start, int target) | PathFind::IDAStar | [virtual] |
| findPathIdaStar(int start) | PathFind::IDAStar | [private] |
| getNodesLimit() const | PathFind::Search | [inline] |
| getPath() const | PathFind::IDAStar | [inline, virtual] |
| getStatistics() const | PathFind::IDAStar | [virtual] |
| getVisitedNodes() const | PathFind::IDAStar | [inline, virtual] |
| IDAStar(Caching caching=NO_CACHING) | PathFind::IDAStar | |
| m_abortSearch | PathFind::IDAStar | [private] |
| m_branchingFactor | PathFind::IDAStar | [private] |
| m_cache | PathFind::IDAStar | [private] |
| m_caching | PathFind::IDAStar | [private] |
| m_env | PathFind::IDAStar | [private] |
| m_fLimit | PathFind::IDAStar | [private] |
| m_nodesExpanded | PathFind::IDAStar | [private] |
| m_nodesLimit | PathFind::Search | |
| m_nodesVisited | PathFind::IDAStar | [private] |
| m_path | PathFind::IDAStar | [private] |
| m_statistics | PathFind::IDAStar | [private] |
| m_successorStack | PathFind::IDAStar | [private] |
| m_target | PathFind::IDAStar | [private] |
| m_visitedNodes | PathFind::IDAStar | [private] |
| markVisitedNode(int nodeId, int iteration) | PathFind::IDAStar | [private] |
| NO_CACHING enum value | PathFind::IDAStar | |
| Search() | PathFind::Search | |
| searchPathIdaStar(int iteration, int node, int lastNode, int depth, int g, int &f_min) | PathFind::IDAStar | [private] |
| setNodesLimit(long long int nodesLimit) | PathFind::Search | [inline] |
| ~Search() | PathFind::Search | [virtual] |