Struct ProblemInfo 

pub struct ProblemInfo {
    pub name: &'static str,
    pub aliases: &'static [&'static str],
    pub description: &'static str,
    pub complexity_class: ComplexityClass,
    pub decision_version: bool,
    pub optimization_version: bool,
    pub canonical_reduction_from: Option<&'static str>,
    pub reference_url: Option<&'static str>,
}

Metadata about a problem type.

Contains static information about a problem definition, including its name, description, complexity class, and relationships to other problems. Use the builder methods to construct instances.

Example

use problemreductions::registry::{ProblemInfo, ComplexityClass};

let info = ProblemInfo::new("Vertex Cover", "Find minimum vertices covering all edges")
    .with_aliases(&["VC", "Minimum Vertex Cover"])
    .with_complexity(ComplexityClass::NpComplete)
    .with_reduction_from("Independent Set")
    .with_reference("https://en.wikipedia.org/wiki/Vertex_cover");

println!("{}", info);  // "Vertex Cover (NP-complete)"

Builder Pattern

All builder methods are const fn and can be used in const contexts:

use problemreductions::registry::{ProblemInfo, ComplexityClass};

const MY_PROBLEM_INFO: ProblemInfo = ProblemInfo::new("My Problem", "Description")
    .with_complexity(ComplexityClass::NpComplete);

Fields

name: &'static str

The canonical name of the problem.

aliases: &'static [&'static str]

Alternative names for the problem.

description: &'static str

A brief description of the problem.

complexity_class: ComplexityClass

The computational complexity class.

decision_version: bool

Whether this has a decision version (yes/no answer).

optimization_version: bool

Whether this has an optimization version.

canonical_reduction_from: Option<&'static str>

The canonical problem this reduces from (for NP-completeness proof).

reference_url: Option<&'static str>

Wikipedia or reference URL.

Implementations

impl ProblemInfo

pub const fn new(name: &'static str, description: &'static str) -> Self

Create a new ProblemInfo with minimal required fields.

pub const fn with_aliases(self, aliases: &'static [&'static str]) -> Self

Builder method to add aliases.

pub const fn with_complexity(self, class: ComplexityClass) -> Self

Builder method to set complexity class.

pub const fn with_decision(self, has_decision: bool) -> Self

Builder method to set decision version availability.

pub const fn with_optimization(self, has_optimization: bool) -> Self

Builder method to set optimization version availability.

pub const fn with_reduction_from(self, source: &'static str) -> Self

Builder method to set the canonical reduction source.

pub const fn with_reference(self, url: &'static str) -> Self

Builder method to set reference URL.

pub fn is_np_complete(&self) -> bool

Check if this problem is NP-complete.

pub fn all_names(&self) -> Vec<&'static str>

Get all names (canonical + aliases).

Trait Implementations

impl Clone for ProblemInfo

fn clone(&self) -> ProblemInfo

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ProblemInfo

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

Formats the value using the given formatter.

impl Display for ProblemInfo

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

Formats the value using the given formatter.

impl PartialEq for ProblemInfo

fn eq(&self, other: &ProblemInfo) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for ProblemInfo

impl StructuralPartialEq for ProblemInfo