| addCache(int nodeId, int gValue, int iteration, int parent) | PathFind::FringeSearch< MARKER > | [private] |
| checkCache(int nodeId, int gValue, int iteration) const | PathFind::FringeSearch< MARKER > | [private] |
| constructPath(int start) | PathFind::FringeSearch< MARKER > | [private] |
| createStatistics() | PathFind::FringeSearch< MARKER > | [virtual] |
| doIteration(int iteration, int fLimit, int &fMin) | PathFind::FringeSearch< MARKER > | [private] |
| findPath(const Environment &env, int start, int target) | PathFind::FringeSearch< MARKER > | [virtual] |
| FringeSearch() | PathFind::FringeSearch< MARKER > | |
| getFromCache(int nodeId, int &gValue, int &parent) const | PathFind::FringeSearch< MARKER > | [private] |
| getNodesLimit() const | PathFind::Search | [inline] |
| getPath() const | PathFind::FringeSearch< MARKER > | [inline, virtual] |
| getStatistics() const | PathFind::FringeSearch< MARKER > | [virtual] |
| getVisitedNodes() const | PathFind::FringeSearch< MARKER > | [inline, virtual] |
| init(int numberNodes) | PathFind::FringeSearch< MARKER > | [private] |
| m_cache | PathFind::FringeSearch< MARKER > | [private] |
| m_env | PathFind::FringeSearch< MARKER > | [private] |
| m_fringe | PathFind::FringeSearch< MARKER > | [private] |
| m_isCacheValid | PathFind::FringeSearch< MARKER > | [private] |
| m_nodesExpanded | PathFind::FringeSearch< MARKER > | [private] |
| m_nodesLimit | PathFind::Search | |
| m_nodesVisited | PathFind::FringeSearch< MARKER > | [private] |
| m_path | PathFind::FringeSearch< MARKER > | [private] |
| m_statistics | PathFind::FringeSearch< MARKER > | [private] |
| m_target | PathFind::FringeSearch< MARKER > | [private] |
| m_visitedNodes | PathFind::FringeSearch< MARKER > | [private] |
| markVisitedNode(int nodeId, int iteration) | PathFind::FringeSearch< MARKER > | [private] |
| Search() | PathFind::Search | |
| setNodesLimit(long long int nodesLimit) | PathFind::Search | [inline] |
| ~Search() | PathFind::Search | [virtual] |