Trait Problem 

pub trait Problem: Clone {
    type Metric: Clone;

    const NAME: &'static str;

    // Required methods
    fn dims(&self) -> Vec<usize>;
    fn evaluate(&self, config: &[usize]) -> Self::Metric;
    fn variant() -> Vec<(&'static str, &'static str)>;

    // Provided method
    fn num_variables(&self) -> usize { ... }
}

Minimal problem trait — a problem is a function from configuration to metric.

This trait defines the interface for computational problems that can be solved by enumeration or reduction to other problems.

Required Associated Constants

const NAME: &'static str

Base name of this problem type (e.g., “MaximumIndependentSet”).

Required Associated Types

type Metric: Clone

The evaluation metric type.

Required Methods

fn dims(&self) -> Vec<usize>

Configuration space dimensions. Each entry is the cardinality of that variable.

fn evaluate(&self, config: &[usize]) -> Self::Metric

Evaluate the problem on a configuration.

fn variant() -> Vec<(&'static str, &'static str)>

Returns variant attributes derived from type parameters.

Used for generating variant IDs in the reduction graph schema. Returns pairs like [("graph", "SimpleGraph"), ("weight", "i32")].

Provided Methods

fn num_variables(&self) -> usize

Number of variables (derived from dims).

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementors

impl Problem for BMF

const NAME: &'static str = "BMF"

type Metric = SolutionSize<i32>

impl Problem for CircuitSAT

const NAME: &'static str = "CircuitSAT"

type Metric = bool

impl Problem for Satisfiability

const NAME: &'static str = "Satisfiability"

type Metric = bool

impl Problem for BicliqueCover

const NAME: &'static str = "BicliqueCover"

type Metric = SolutionSize<i32>

impl Problem for Factoring

const NAME: &'static str = "Factoring"

type Metric = SolutionSize<i32>

impl Problem for Knapsack

const NAME: &'static str = "Knapsack"

type Metric = SolutionSize<i64>

impl Problem for PaintShop

const NAME: &'static str = "PaintShop"

type Metric = SolutionSize<i32>

impl Problem for SubsetSum

const NAME: &'static str = "SubsetSum"

type Metric = bool

impl<G> Problem for GraphPartitioning<G>

where G: Graph + VariantParam,

const NAME: &'static str = "GraphPartitioning"

type Metric = SolutionSize<i32>

impl<G, W> Problem for MaxCut<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "MaxCut"

type Metric = SolutionSize<<W as WeightElement>::Sum>

impl<G, W> Problem for MaximalIS<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "MaximalIS"

type Metric = SolutionSize<<W as WeightElement>::Sum>

impl<G, W> Problem for MaximumClique<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "MaximumClique"

type Metric = SolutionSize<<W as WeightElement>::Sum>

impl<G, W> Problem for MaximumIndependentSet<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "MaximumIndependentSet"

type Metric = SolutionSize<<W as WeightElement>::Sum>

impl<G, W> Problem for MaximumMatching<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "MaximumMatching"

type Metric = SolutionSize<<W as WeightElement>::Sum>

impl<G, W> Problem for MinimumDominatingSet<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "MinimumDominatingSet"

type Metric = SolutionSize<<W as WeightElement>::Sum>

impl<G, W> Problem for MinimumVertexCover<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "MinimumVertexCover"

type Metric = SolutionSize<<W as WeightElement>::Sum>

impl<G, W> Problem for SpinGlass<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam + PartialOrd + Num + Zero + Bounded + AddAssign + Mul<Output = W> + From<i32>,

const NAME: &'static str = "SpinGlass"

type Metric = SolutionSize<<W as WeightElement>::Sum>

impl<G, W> Problem for TravelingSalesman<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "TravelingSalesman"

type Metric = SolutionSize<<W as WeightElement>::Sum>

impl<K: KValue> Problem for KSatisfiability<K>

const NAME: &'static str = "KSatisfiability"

type Metric = bool

impl<K: KValue, G> Problem for KColoring<K, G>

where G: Graph + VariantParam,

const NAME: &'static str = "KColoring"

type Metric = bool

impl<T> Problem for ClosestVectorProblem<T>

where T: Clone + Into<f64> + VariantParam + Serialize + for<'de> Deserialize<'de> + Debug + 'static,

const NAME: &'static str = "ClosestVectorProblem"

type Metric = SolutionSize<f64>

impl<V: VariableDomain> Problem for ILP<V>

const NAME: &'static str = "ILP"

type Metric = SolutionSize<f64>

impl<W> Problem for QUBO<W>

where W: WeightElement + VariantParam + PartialOrd + Num + Zero + Bounded + AddAssign + Mul<Output = W>,

const NAME: &'static str = "QUBO"

type Metric = SolutionSize<<W as WeightElement>::Sum>

impl<W> Problem for MinimumFeedbackVertexSet<W>

where W: WeightElement + VariantParam,

const NAME: &'static str = "MinimumFeedbackVertexSet"

type Metric = SolutionSize<<W as WeightElement>::Sum>

impl<W> Problem for BinPacking<W>

where W: WeightElement + VariantParam, W::Sum: PartialOrd,

const NAME: &'static str = "BinPacking"

type Metric = SolutionSize<i32>

impl<W> Problem for MaximumSetPacking<W>

where W: WeightElement + VariantParam,

const NAME: &'static str = "MaximumSetPacking"

type Metric = SolutionSize<<W as WeightElement>::Sum>

impl<W> Problem for MinimumSetCovering<W>

where W: WeightElement + VariantParam,

const NAME: &'static str = "MinimumSetCovering"

type Metric = SolutionSize<<W as WeightElement>::Sum>