Struct MaximumCoKPlex 

pub struct MaximumCoKPlex<G, W, K: KValue> { /* private fields */ }

The Maximum Co-k-Plex problem.

Given a graph G = (V, E), vertex weights w_v, and an integer k >= 1, find S ⊆ V maximizing Σ_{v ∈ S} w_v subject to deg_{G[S]}(v) <= k - 1 for every v ∈ S (equivalently, the induced subgraph has maximum degree at most k - 1).

Type Parameters

• G - Graph type (e.g., SimpleGraph).
• W - Weight type (e.g., One, i32).
• K - Compile-time KValue tag. KN stores k at runtime; fixed variants (K1, K2, …) can be added later by registering more declare_variants! entries.

Example

use problemreductions::models::graph::MaximumCoKPlex;
use problemreductions::topology::SimpleGraph;
use problemreductions::types::One;
use problemreductions::variant::KN;
use problemreductions::{BruteForce, Problem, Solver};

// 5-cycle C_5 with k = 2 (induced degree <= 1).
let graph = SimpleGraph::new(5, vec![(0, 1), (1, 2), (2, 3), (3, 4), (4, 0)]);
let problem =
    MaximumCoKPlex::<_, One, KN>::with_k(graph, vec![One; 5], 2);
assert_eq!(problem.bound_k(), 2);

Implementations

impl<G: Graph, W: Clone + Default, K: KValue> MaximumCoKPlex<G, W, K>

pub fn with_k(graph: G, weights: Vec<W>, bound_k: usize) -> Self

Create an instance with an explicit runtime k.

Panics

Panics if weights.len() does not match graph.num_vertices(), if bound_k == 0, or if K declares a fixed value that disagrees with bound_k.

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

Create a new instance using the compile-time K.

Panics

Panics if K is KN (use MaximumCoKPlex::with_k instead) or if weights.len() does not match graph.num_vertices().

pub fn graph(&self) -> &G

Get a reference to the underlying graph.

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

Get a reference to the vertex weights.

pub fn bound_k(&self) -> usize

Co-k-plex parameter k.

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 satisfies the co-k-plex constraint.

impl<G: Graph, W: WeightElement, K: KValue> MaximumCoKPlex<G, W, K>

pub fn num_vertices(&self) -> usize

Number of vertices in the underlying graph.

pub fn num_edges(&self) -> usize

Number of edges in the underlying graph.

Trait Implementations

impl<G: Clone, W: Clone, K: Clone + KValue> Clone for MaximumCoKPlex<G, W, K>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<G: Debug, W: Debug, K: Debug + KValue> Debug for MaximumCoKPlex<G, W, K>

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

Formats the value using the given formatter.

impl<'de, G, W, K: KValue> Deserialize<'de> for MaximumCoKPlex<G, W, K>

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, K> Problem for MaximumCoKPlex<G, W, K>

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

const NAME: &'static str = "MaximumCoKPlex"

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

type Value = Max<<W as WeightElement>::Sum>

The evaluation value 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]) -> Max<W::Sum>

Evaluate the problem on a configuration.

fn num_variables(&self) -> usize

Number of variables (derived from dims).

fn problem_type() -> ProblemType

Look up this problem’s catalog entry.

impl ReduceTo<ILP> for MaximumCoKPlex<SimpleGraph, One, KN>

type Result = ReductionCoKPlexToILP<One>

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for MaximumCoKPlex<SimpleGraph, i32, KN>

type Result = ReductionCoKPlexToILP<i32>

The reduction result type.

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

Reduce this problem to the target problem type.

impl<G, W, K: KValue> Serialize for MaximumCoKPlex<G, W, K>

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 MaximumCoKPlex<SimpleGraph, One, KN>

impl DeclaredVariant for MaximumCoKPlex<SimpleGraph, i32, KN>