|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Classes | |
| struct | Move |
Public Types | |
| using | State = GraphState |
| using | State_Key = size_t |
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 |
Definition at line 77 of file backtracking_cyclic_graph_example.cc.
Definition at line 85 of file backtracking_cyclic_graph_example.cc.
| using CyclicGraphDomain::State_Key = size_t |
Definition at line 86 of file backtracking_cyclic_graph_example.cc.
Definition at line 98 of file backtracking_cyclic_graph_example.cc.
References m.
Definition at line 109 of file backtracking_cyclic_graph_example.cc.
References Aleph::divide_and_conquer_partition_dp(), and GraphState::node.
Definition at line 93 of file backtracking_cyclic_graph_example.cc.
Definition at line 88 of file backtracking_cyclic_graph_example.cc.
Definition at line 103 of file backtracking_cyclic_graph_example.cc.
References m.