Struct MinimumCoveringSet

pub struct MinimumCoveringSet { /* private fields */ }

A brute-force minimum covering set-finder.

Implementations

impl MinimumCoveringSet

pub fn of(decisions: Vec<Vec<usize>>, num_choices: usize) -> MinimumCoveringSet

decisions is a vec of length N, where there are N items to be covered. Each entry in decisions is a vec containing the indices X of the choices (X < num_choices) that cover this item. In other words, at least one choice from each vec in decisions must be picked.

pub fn contains(&self, index: usize) -> bool

Returns true if index is in the minimum covering set.

pub fn into_vec(self) -> Vec<usize>

Converts the minimum covering set into a list of indices.

Trait Implementations

impl Debug for MinimumCoveringSet

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

Formats the value using the given formatter.

impl PartialEq<[usize]> for MinimumCoveringSet

fn eq(&self, other: &[usize]) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<const N: usize> PartialEq<[usize; N]> for MinimumCoveringSet

fn eq(&self, other: &[usize; N]) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.