Struct IterativeCompressionVC 

pub struct IterativeCompressionVC {
    pub k: usize,
}

Iterative compression algorithm for vertex cover. Given a (k+1)-solution, compresses it to a k-solution.

Fields

k: usize

The target budget k.

Implementations

impl IterativeCompressionVC

pub fn new(k: usize) -> Self

Construct the iterative compression algorithm for budget k.

pub fn compress( &self, adj: &[Vec<usize>], over_cover: &[usize], ) -> Option<Vec<usize>>

Compress a (k+1)-size vertex cover to a k-size one (if possible). Returns Some(k_cover) or None.

Trait Implementations

impl Clone for IterativeCompressionVC

fn clone(&self) -> IterativeCompressionVC

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for IterativeCompressionVC

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

Formats the value using the given formatter.