| ClearVisited() | OptimalSubsetAStar | inlinevirtual |
| costs (defined in AI::GeneralizedAStar< pair< int, Subset >, SubsetCost >) | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | |
| fringe | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | |
| GeneralizedAStar() (defined in AI::GeneralizedAStar< pair< int, Subset >, SubsetCost >) | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | |
| GeneralizedAStar(const pair< int, Subset > &start) (defined in AI::GeneralizedAStar< pair< int, Subset >, SubsetCost >) | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | |
| goal | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | |
| GoalCost() const | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | inline |
| GoalFound() const | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | inline |
| GoalPath() const | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | inline |
| Heuristic(const pair< int, Subset > &s) (defined in AI::GeneralizedAStar< pair< int, Subset >, SubsetCost >) | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | inlinevirtual |
| IsGoal(const State &s) | OptimalSubsetAStar | inlinevirtual |
| Node typedef (defined in OptimalSubsetAStar) | OptimalSubsetAStar | |
| NumDescendents(const Node &n) const | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | |
| NumExpanded() const | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | |
| numNodes (defined in AI::GeneralizedAStar< pair< int, Subset >, SubsetCost >) | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | |
| NumNodes() const | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | |
| OnExpand(Node *n) | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | inlinevirtual |
| OptimalSubsetAStar(MCRPlanner *_planner, int _start, int _target) (defined in OptimalSubsetAStar) | OptimalSubsetAStar | inline |
| path | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | |
| planner (defined in OptimalSubsetAStar) | OptimalSubsetAStar | |
| root | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | |
| Search() | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | |
| SearchFailed() | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | |
| SearchStep() | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | |
| SetStart(const pair< int, Subset > &start) | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | |
| startNode (defined in OptimalSubsetAStar) | OptimalSubsetAStar | |
| State typedef (defined in OptimalSubsetAStar) | OptimalSubsetAStar | |
| successors | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | |
| Successors(const State &s, vector< State > &successors, vector< SubsetCost > &cost) (defined in OptimalSubsetAStar) | OptimalSubsetAStar | inlinevirtual |
| targetNode (defined in OptimalSubsetAStar) | OptimalSubsetAStar | |
| testGoalOnGeneration | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | |
| TopPriority() const | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | |
| Visit(const State &s, Node *n) (defined in OptimalSubsetAStar) | OptimalSubsetAStar | inlinevirtual |
| Visit(const pair< int, Subset > &s, Node *n) (defined in AI::GeneralizedAStar< pair< int, Subset >, SubsetCost >) | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | inlinevirtual |
| visited (defined in OptimalSubsetAStar) | OptimalSubsetAStar | |
| VisitedStateNode(const State &s) (defined in OptimalSubsetAStar) | OptimalSubsetAStar | inlinevirtual |
| zero | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | |
| ~GeneralizedAStar() (defined in AI::GeneralizedAStar< pair< int, Subset >, SubsetCost >) | AI::GeneralizedAStar< pair< int, Subset >, SubsetCost > | inlinevirtual |
