Struct MinimumHittingSet 

pub struct MinimumHittingSet { /* private fields */ }

The Minimum Hitting Set problem.

Given a universe U and a collection of subsets of U, find a minimum-size subset H ⊆ U such that H intersects every set in the collection.

Implementations

impl MinimumHittingSet

pub fn new(universe_size: usize, sets: Vec<Vec<usize>>) -> Self

Create a new Minimum Hitting Set instance.

Panics

Panics if any set contains an element outside 0..universe_size.

pub fn universe_size(&self) -> usize

Get the universe size.

pub fn num_sets(&self) -> usize

Get the number of sets.

pub fn sets(&self) -> &[Vec<usize>]

Get the sets.

pub fn get_set(&self, index: usize) -> Option<&Vec<usize>>

Get a specific set.

pub fn selected_elements(&self, config: &[usize]) -> Option<Vec<usize>>

Decode the selected universe elements from a binary configuration.

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

Check whether a configuration hits every set in the collection.

Trait Implementations

impl Clone for MinimumHittingSet

fn clone(&self) -> MinimumHittingSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MinimumHittingSet

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for MinimumHittingSet

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Problem for MinimumHittingSet

const NAME: &'static str = "MinimumHittingSet"

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

type Value = Min<usize>

The evaluation value type.

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

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

fn evaluate(&self, config: &[usize]) -> Min<usize>

Evaluate the problem on a configuration.

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

Returns variant attributes derived from type parameters.

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 MinimumHittingSet

type Result = ReductionHSToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<MinimumHittingSet> for MinimumVertexCover<SimpleGraph, One>

type Result = ReductionVCToHS

The reduction result type.

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

Reduce this problem to the target problem type.

impl Serialize for MinimumHittingSet

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 MinimumHittingSet