Expand description
The search explores a tree where nodes are a couple of variables and constraints store, called a space.
The tree is constructed during the search and backtracking occurs when a node is failed (it does not lead to a solution). The exploration of the tree can be customized by different heuristics combined with search combinators implemented with SearchTreeVisitor.
Re-exports§
pub use search::space::*;pub use search::search_tree_visitor::*;
Modules§
- branch_
and_ bound - branching
- debugger
- engine
- monitor
- propagation
- recomputation
- search_
tree_ visitor - space
- statistics
- stop_
node