Struct SolveConfig 

pub struct SolveConfig {
    pub pruning: Pruning,
    pub ordering: Ordering,
    pub max_solutions: usize,
    pub backjumping: bool,
    pub optimization_mode: OptimizationMode,
    pub node_budget: Option<u64>,
}

Solve configuration, isomorphic to Python’s CSP constructor arguments.

Fields

pruning: Pruning

ordering: Ordering

max_solutions: usize

backjumping: bool

Whether to use conflict-directed backjumping instead of chronological backtracking.

optimization_mode: OptimizationMode

Optimization mode. Defaults to Feasibility (pure constraint satisfaction).

node_budget: Option<u64>

Maximum number of search nodes (backtrack / branch-and-bound recursions) before the solver aborts early and returns whatever solutions it has found so far. None disables the budget.

Defaults to Some(1_000_000) so an unbounded pathological search cannot hang a caller. When the budget is hit, SolveStats::budget_exceeded is set to true on the returning Csp::stats(). Callers that care about optimality should branch on this flag and either accept the best-so-far solution or fall back to a trivial per-variable pick.

Trait Implementations

impl Clone for SolveConfig

fn clone(&self) -> SolveConfig

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for SolveConfig

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for SolveConfig

fn default() -> Self

Returns the “default value” for a type.