Compounds | |
| class | AStar |
| A* search engine. More... | |
| class | AStarClosed |
| Closed list implementation using a list. More... | |
| class | AStarClosedLookup |
| Closed list implementation using lookup table. More... | |
| class | AStarNode |
| Node used in implementation of AStar. More... | |
| class | AStarNode::Compare |
| Function object for comparing nodes in the open queue. More... | |
| class | AStarOpen |
| Open queue for AStar. More... | |
| class | Environment |
| Interface to search environment. More... | |
| class | Environment::Successor |
| Information about a successor of a node in the environment. More... | |
| class | Error |
| Base class for exceptions. More... | |
| class | Fringe |
| Statically allocated linked list used in FringeSearch. More... | |
| class | Fringe::Node |
| Node used in Fringe. More... | |
| class | FringeSearch |
| IDA* like search keeping a list of the fringe nodes. More... | |
| class | FringeSearch::CacheElement |
| Cache element for g-value used in FringeSearch. More... | |
| class | Graph |
| Graph with generic data attached to nodes and edges. More... | |
| class | Graph::Edge |
| Edge in a graph with generic data attached. More... | |
| class | Graph::Node |
| Node in a graph with generic data attached. More... | |
| class | IDAStar |
| IDA* search algorithm. More... | |
| class | IDAStar::CacheNode |
| Information for caching f-values. More... | |
| class | LineReader |
| Wrapper class around std::istream for reading line by line. More... | |
| class | MarkerBoolVector |
| Array for marking node IDs. More... | |
| class | MarkerFastClear |
| Array for marking node IDs. More... | |
| class | ReadError |
| Exception thrown by LineReader. More... | |
| class | Search |
| Abstract search engine. More... | |
| class | SearchUtils |
| Utility operations for running searches. More... | |
| class | Statistics |
| Keeps track of the mean and variance of a variable. More... | |
| class | StatisticsCollection |
| Set of statistics variables. More... | |
| class | Tiling |
| Search environment implementing a regular grid. More... | |
| class | TilingEdgeInfo |
| Generic edge data for Tiling::TilingGraph. More... | |
| class | TilingNodeInfo |
| Generic node data for Tiling::TilingGraph. More... | |
Functions | |
| char | getVisitedNodeLabel (int iteration) |
| Get a label useful for implementations of Search::getVisitedNodes. | |
Variables | |
| const int | NO_NODE = -1 |
| const int | COST_ONE = 100 |
| const int | COST_SQRT2 = 142 |
| const char * | g_version |
| Version of the library. | |
|
|
Get a label useful for implementations of Search::getVisitedNodes. The char label is built with the iteration number and uses '0'-'9', 'a'-'z' if the iteration number is less than 37, '+' otherwise. Definition at line 53 of file util.cpp. Referenced by PathFind::IDAStar::markVisitedNode(), and PathFind::FringeSearch< MARKER >::markVisitedNode(). |
|
|
Definition at line 77 of file tiling.h. Referenced by PathFind::Tiling::createEdges(), PathFind::Tiling::getHeuristic(), PathFind::Tiling::getMaxCost(), PathFind::Tiling::getMinCost(), and PathFind::TilingEdgeInfo::TilingEdgeInfo(). |
|
|
Definition at line 79 of file tiling.h. Referenced by PathFind::Tiling::createEdges(), PathFind::Tiling::getHeuristic(), PathFind::Tiling::getMaxCost(), and PathFind::TilingEdgeInfo::TilingEdgeInfo(). |
|
|
Version of the library.
|
|
|
|