Struct MaximalIS 

pub struct MaximalIS<G, W> { /* private fields */ }

The Maximal Independent Set problem.

Given a graph G = (V, E), find an independent set S that is maximal, meaning no vertex can be added to S while keeping it independent.

This is different from Maximum Independent Set - maximal means locally optimal (cannot extend), while maximum means globally optimal (largest).

Example

use problemreductions::models::graph::MaximalIS;
use problemreductions::topology::SimpleGraph;
use problemreductions::{Problem, Solver, BruteForce};

// Path graph 0-1-2
let graph = SimpleGraph::new(3, vec![(0, 1), (1, 2)]);
let problem = MaximalIS::new(graph, vec![1; 3]);

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

// Maximal independent sets: {0, 2} or {1}
for sol in &solutions {
    assert!(problem.evaluate(sol).is_valid());
}

Implementations

impl<G: Graph, W: Clone + Default> MaximalIS<G, W>

pub fn new(graph: G, weights: Vec<W>) -> Self

Create a Maximal Independent Set problem from a graph with given weights.

pub fn graph(&self) -> &G

Get a reference to the underlying graph.

pub fn weights(&self) -> &[W]

Get a reference to the weights.

pub fn is_weighted(&self) -> bool

where W: WeightElement,

Check if the problem uses a non-unit weight type.

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

Check if a configuration is a valid maximal independent set.

impl<G: Graph, W: WeightElement> MaximalIS<G, W>

pub fn num_vertices(&self) -> usize

Get the number of vertices in the underlying graph.

pub fn num_edges(&self) -> usize

Get the number of edges in the underlying graph.

Trait Implementations

impl<G: Clone, W: Clone> Clone for MaximalIS<G, W>

fn clone(&self) -> MaximalIS<G, W>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<G: Debug, W: Debug> Debug for MaximalIS<G, W>

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

Formats the value using the given formatter.

impl<'de, G, W> Deserialize<'de> for MaximalIS<G, W>

where G: Deserialize<'de>, 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<G, W> OptimizationProblem for MaximalIS<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

type Value = <W as WeightElement>::Sum

The inner objective value type (e.g., i32, f64).

fn direction(&self) -> Direction

Whether to maximize or minimize the metric.

impl<G, W> Problem for MaximalIS<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "MaximalIS"

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

type Metric = SolutionSize<<W as WeightElement>::Sum>

The evaluation metric type.

fn variant() -> Vec<(&'static str, &'static str)>

Returns variant attributes derived from type parameters.

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

Configuration space dimensions. Each entry is the cardinality of that variable.

fn evaluate(&self, config: &[usize]) -> SolutionSize<W::Sum>

Evaluate the problem on a configuration.

fn num_variables(&self) -> usize

Number of variables (derived from dims).

impl<G, W> Serialize for MaximalIS<G, W>

where G: Serialize, W: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl DeclaredVariant for MaximalIS<SimpleGraph, i32>