csp-solver 0.1.0

Generic constraint satisfaction problem solver with backtracking, AC-3 constraint propagation, and ordering heuristics.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29

//! Solver dispatch: AC-3 propagation, forward checking, backtracking search.

pub mod ac3;
pub mod backjump;
pub mod backtrack;
pub mod gac_alldiff;
pub mod gac_alldiff_except;
pub mod local_search;
pub mod monotonic;
pub mod nogoods;
pub mod optimize;
pub mod propagate;

use crate::adjacency::Adjacency;
use crate::constraint::ConstraintEnum;
use crate::domain::Domain;
use crate::variable::Variable;
use crate::SolveStats;

/// Shared search context passed to all recursive search strategies.
/// Carries the problem definition (variables, constraints, adjacency) and the
/// mutable statistics accumulator. Extracted to tame `too_many_arguments` on
/// `backtrack_recurse`, `backjump_recurse`, and `bb_recurse`.
pub(crate) struct SearchContext<'a, D: Domain> {
    pub variables: &'a mut [Variable<D>],
    pub constraints: &'a [ConstraintEnum<D>],
    pub adjacency: &'a Adjacency,
    pub stats: &'a mut SolveStats,
}