Module models 

Problem model implementations.

This module contains implementations of various NP-hard problems.

Problem Categories

• Satisfiability: SAT, K-SAT, CircuitSAT, Factoring
• Graph: IndependentSet, MaximalIS, VertexCovering, DominatingSet, Coloring, Matching
• Set: SetCovering, SetPacking
• Optimization: MaxCut, SpinGlass, QUBO
• Specialized: Paintshop, BicliqueCover, BMF

Re-exports

pub use graph::Coloring;

pub use graph::DominatingSet;

pub use graph::IndependentSet;

pub use graph::Matching;

pub use graph::MaxCut;

pub use graph::MaximalIS;

pub use graph::VertexCovering;

pub use optimization::SpinGlass;

pub use optimization::QUBO;

pub use satisfiability::CNFClause;

pub use satisfiability::Satisfiability;

pub use set::SetCovering;

pub use set::SetPacking;

pub use specialized::BicliqueCover;

pub use specialized::CircuitSAT;

pub use specialized::Factoring;

pub use specialized::PaintShop;

pub use specialized::BMF;

Modules

graph

Graph-based optimization problems.

optimization

Optimization problems.

satisfiability

Satisfiability problems.

set

Set-based optimization problems.

specialized

Specialized NP-hard problems.