Struct ProblemSide 

pub struct ProblemSide {
    pub problem: String,
    pub variant: BTreeMap<String, String>,
    pub instance: Value,
}

One side (source or target) of a reduction.

Fields

problem: String

Problem name matching Problem::NAME (e.g., "MaximumIndependentSet").

variant: BTreeMap<String, String>

Variant attributes (e.g., {"graph": "SimpleGraph", "weight": "One"}).

instance: Value

Problem-specific instance data (edges, matrix, clauses, etc.).

Implementations

impl ProblemSide

pub fn from_problem<P>(problem: &P) -> Self

where P: Problem + Serialize,

Build a serializable problem side from a typed problem.

pub fn problem_ref(&self) -> ProblemRef

Extract the structural identity of this problem side.

Trait Implementations

impl Clone for ProblemSide

fn clone(&self) -> ProblemSide

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ProblemSide

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for ProblemSide

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for ProblemSide

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

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for ProblemSide