Enum ComplexityClass 

pub enum ComplexityClass {
    P,
    NpComplete,
    NpHard,
    PspaceComplete,
    Unknown,
}

Computational complexity class of a problem.

Used to classify problems by their computational difficulty. Most problems in this library are NpComplete.

Example

use problemreductions::registry::ComplexityClass;

let class = ComplexityClass::NpComplete;
assert!(class.is_hard());
assert_eq!(class.name(), "NP-complete");

Variants

P

In P (polynomial time)

NpComplete

NP-complete

NpHard

NP-hard (at least as hard as NP-complete)

PspaceComplete

PSPACE-complete

Unknown

Unknown or unclassified

Implementations

impl ComplexityClass

pub fn name(&self) -> &'static str

Get the complexity class name.

pub fn is_hard(&self) -> bool

Check if this problem is at least NP-hard.

Trait Implementations

impl Clone for ComplexityClass

fn clone(&self) -> ComplexityClass

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ComplexityClass

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

Formats the value using the given formatter.

impl Display for ComplexityClass

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

Formats the value using the given formatter.

impl Hash for ComplexityClass

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for ComplexityClass

fn eq(&self, other: &ComplexityClass) -> 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 Copy for ComplexityClass

impl Eq for ComplexityClass

impl StructuralPartialEq for ComplexityClass