Struct IndependentSet 

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

The Independent Set problem.

Given a graph G = (V, E) and weights w_v for each vertex, find a subset S ⊆ V such that:

• No two vertices in S are adjacent (independent set constraint)
• The total weight Σ_{v ∈ S} w_v is maximized

Example

use problemreductions::models::graph::IndependentSet;
use problemreductions::{Problem, Solver, BruteForce};

// Create a triangle graph (3 vertices, 3 edges)
let problem = IndependentSet::<i32>::new(3, vec![(0, 1), (1, 2), (0, 2)]);

// Solve with brute force
let solver = BruteForce::new();
let solutions = solver.find_best(&problem);

// Maximum independent set in a triangle has size 1
assert!(solutions.iter().all(|s| s.iter().sum::<usize>() == 1));

Implementations

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

pub fn new(num_vertices: usize, edges: Vec<(usize, usize)>) -> Self

where W: From<i32>,

Create a new Independent Set problem with unit weights.

Arguments

• num_vertices - Number of vertices in the graph
• edges - List of edges as (u, v) pairs

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

Create a new Independent Set problem with custom weights.

pub fn num_vertices(&self) -> usize

Get the number of vertices.

pub fn num_edges(&self) -> usize

Get the number of edges.

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

Get the edges as a list of (u, v) pairs.

pub fn has_edge(&self, u: usize, v: usize) -> bool

Check if two vertices are adjacent.

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

Get a reference to the weights vector.

Trait Implementations

impl<W: Clone> Clone for IndependentSet<W>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<W> ConstraintSatisfactionProblem for IndependentSet<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 IndependentSet<W>

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

Formats the value using the given formatter.

impl<'de, W> Deserialize<'de> for IndependentSet<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 IndependentSet<W>

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

const NAME: &'static str = "IndependentSet"

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 Satisfiability<W>

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

type Result = ReductionSATToIS<W>

The reduction result type.

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

Reduce this problem to the target problem type.

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<IndependentSet<W>> for VertexCovering<W>

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

type Result = ReductionVCToIS<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<VertexCovering<W>> for IndependentSet<W>

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

type Result = ReductionISToVC<W>

The reduction result type.

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

Reduce this problem to the target problem type.

impl<W> Serialize for IndependentSet<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.