Struct SetPacking 

pub struct SetPacking<W = i32> { /* private fields */ }

The Set Packing problem.

Given a collection S of sets, each with a weight, find a maximum weight subcollection of pairwise disjoint sets.

Example

use problemreductions::models::set::SetPacking;
use problemreductions::{Problem, Solver, BruteForce};

// Sets: S0={0,1}, S1={1,2}, S2={2,3}, S3={3,4}
// S0 and S1 overlap, S2 and S3 are disjoint from S0
let problem = SetPacking::<i32>::new(vec![
    vec![0, 1],
    vec![1, 2],
    vec![2, 3],
    vec![3, 4],
]);

let solver = BruteForce::new();
let solutions = solver.find_best(&problem);

// Verify solutions are pairwise disjoint
for sol in solutions {
    assert!(problem.solution_size(&sol).is_valid);
}

Implementations

impl<W: Clone + Default> SetPacking<W>

pub fn new(sets: Vec<Vec<usize>>) -> Self

where W: From<i32>,

Create a new Set Packing problem with unit weights.

pub fn with_weights(sets: Vec<Vec<usize>>, weights: Vec<W>) -> Self

Create a new Set Packing problem with custom weights.

pub fn num_sets(&self) -> usize

Get the number of sets.

pub fn sets(&self) -> &[Vec<usize>]

Get the sets.

pub fn get_set(&self, index: usize) -> Option<&Vec<usize>>

Get a specific set.

pub fn sets_overlap(&self, i: usize, j: usize) -> bool

Check if two sets overlap.

pub fn overlapping_pairs(&self) -> Vec<(usize, usize)>

Get all pairs of overlapping sets.

pub fn weights_ref(&self) -> &Vec<W>

Get a reference to the weights vector.

Trait Implementations

impl<W: Clone> Clone for SetPacking<W>

fn clone(&self) -> SetPacking<W>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<W> ConstraintSatisfactionProblem for SetPacking<W>

where W: Clone + Default + PartialOrd + Num + Zero + AddAssign + 'static,

fn constraints(&self) -> Vec<LocalConstraint>

Returns the hard constraints that must be satisfied.

fn objectives(&self) -> Vec<LocalSolutionSize<Self::Size>>

Returns the local objectives that contribute to solution size.

fn weights(&self) -> Vec<Self::Size>

Returns the weights for the problem (e.g., vertex weights).

fn set_weights(&mut self, weights: Vec<Self::Size>)

Set new weights for the problem.

fn is_weighted(&self) -> bool

Returns whether the problem has non-uniform weights.

fn is_satisfied(&self, config: &[usize]) -> bool

Check if all constraints are satisfied by a configuration.

fn compute_objective(&self, config: &[usize]) -> Self::Size

Compute the total objective value from all local objectives.

impl<W: Debug> Debug for SetPacking<W>

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

Formats the value using the given formatter.

impl<'de, W> Deserialize<'de> for SetPacking<W>

where W: Deserialize<'de>,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<W> Problem for SetPacking<W>

where W: Clone + Default + PartialOrd + Num + Zero + AddAssign + 'static,

const NAME: &'static str = "SetPacking"

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

type GraphType = SimpleGraph

The graph type this problem operates on.

type Weight = W

The weight type for this problem.

type Size = W

The type used for objective/size values.

fn num_variables(&self) -> usize

Returns the number of variables in the problem.

fn num_flavors(&self) -> usize

Returns the number of possible values (flavors) for each variable. For binary problems, this is 2.

fn problem_size(&self) -> ProblemSize

Returns metadata about the problem size.

fn energy_mode(&self) -> EnergyMode

Returns whether larger or smaller objective values are better.

fn solution_size(&self, config: &[usize]) -> SolutionSize<Self::Size>

Evaluate the solution size for a given configuration.

fn variables(&self) -> Range<usize>

Returns the range of variable indices.

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

Returns the possible flavors as a vector.

fn is_valid_config(&self, config: &[usize]) -> bool

Check if a configuration is valid for this problem.

fn solution_size_multiple( &self, configs: &[Vec<usize>], ) -> Vec<SolutionSize<Self::Size>>

Evaluate multiple configurations at once (batch evaluation).

impl<W> ReduceTo<IndependentSet<W>> for SetPacking<W>

where W: Clone + Default + PartialOrd + Num + Zero + AddAssign + From<i32> + 'static,

type Result = ReductionSPToIS<W>

The reduction result type.

fn reduce_to(&self) -> Self::Result

Reduce this problem to the target problem type.

impl<W> ReduceTo<SetPacking<W>> for IndependentSet<W>

where W: Clone + Default + PartialOrd + Num + Zero + AddAssign + From<i32> + 'static,

type Result = ReductionISToSP<W>

The reduction result type.

fn reduce_to(&self) -> Self::Result

Reduce this problem to the target problem type.

impl<W> ReduceTo<SetPacking<W>> for Matching<W>

where W: Clone + Default + PartialOrd + Num + Zero + AddAssign + From<i32> + 'static,

type Result = ReductionMatchingToSP<W>

The reduction result type.

fn reduce_to(&self) -> Self::Result

Reduce this problem to the target problem type.

impl<W> Serialize for SetPacking<W>

where W: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.