|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Classes | |
| struct | Move |
Public Types | |
| using | State = NodeState |
| using | State_Key = size_t |
| using | Distance = int |
Public Member Functions | |
| State_Key | state_key (const State &s) const noexcept |
| bool | is_goal (const State &s) const noexcept |
| void | apply (State &s, const Move &m) const noexcept |
| void | undo (State &s, const Move &m) const noexcept |
| template<typename Visitor > | |
| bool | for_each_successor (const State &s, Visitor visit) const |
| Distance | heuristic (const State &) const noexcept |
| Distance | cost (const State &, const Move &m) const noexcept |
Definition at line 79 of file ida_star_no_solution_example.cc.
Definition at line 90 of file ida_star_no_solution_example.cc.
Definition at line 88 of file ida_star_no_solution_example.cc.
| using UnreachableGoalDomain::State_Key = size_t |
Definition at line 89 of file ida_star_no_solution_example.cc.
Definition at line 102 of file ida_star_no_solution_example.cc.
References m.
Definition at line 128 of file ida_star_no_solution_example.cc.
References m.
Definition at line 114 of file ida_star_no_solution_example.cc.
References Aleph::divide_and_conquer_partition_dp(), and NodeState::node.
Definition at line 123 of file ida_star_no_solution_example.cc.
Definition at line 97 of file ida_star_no_solution_example.cc.
Definition at line 92 of file ida_star_no_solution_example.cc.
Definition at line 107 of file ida_star_no_solution_example.cc.
References m.