Struct ConsecutiveSets 

pub struct ConsecutiveSets { /* private fields */ }

Consecutive Sets problem.

Given an alphabet {0, 1, …, n-1}, a collection of subsets, and a bound K, determine if there exists a string w of length at most K over the alphabet such that the elements of each subset appear as a contiguous block (in any order) within w.

Solutions use bound_k positions. Some(symbol) represents an alphabet symbol and trailing None positions mark the unused suffix of a shorter string.

This problem is NP-complete and arises in physical mapping of DNA and in consecutive arrangements of hypergraph vertices.

Example

use problemreductions::models::set::ConsecutiveSets;
use problemreductions::{Problem, BruteForce};

// Alphabet: {0, 1, 2, 3, 4, 5}, subsets that must appear consecutively
let problem = ConsecutiveSets::new(
    6,
    vec![vec![0, 4], vec![2, 4], vec![2, 5], vec![1, 5], vec![1, 3]],
    6,
);

let solver = BruteForce::new();
let solution = solver.solve(&problem).unwrap();

// w = [0, 4, 2, 5, 1, 3] is a valid solution
assert!(solution.is_some());
assert!(problem.evaluate(&solution.unwrap()).unwrap());

// Shorter strings use trailing `None` positions.
let shorter = ConsecutiveSets::new(3, vec![vec![0, 1]], 4);
assert!(shorter
    .evaluate(&vec![Some(0), Some(1), None, None])
    .unwrap());
assert!(!shorter
    .evaluate(&vec![Some(0), None, Some(1), None])
    .unwrap());

Implementations

impl ConsecutiveSets

pub fn new( alphabet_size: usize, subsets: Vec<Vec<usize>>, bound_k: usize, ) -> Self

Create a new Consecutive Sets problem.

Panics

Panics if bound_k is zero, if any subset contains duplicate elements, or if any element is outside the alphabet.

pub fn alphabet_size(&self) -> usize

Get the alphabet size.

pub fn num_subsets(&self) -> usize

Get the number of subsets in the collection.

pub fn bound_k(&self) -> usize

Get the bound K.

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

Get the subsets.

Trait Implementations

impl BruteForceProblem for ConsecutiveSets

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

Cardinality of each coordinate in the brute-force search space.

fn num_variables(&self) -> usize

Number of coordinates in the brute-force search space.

impl Clone for ConsecutiveSets

fn clone(&self) -> ConsecutiveSets

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ConsecutiveSets

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

Formats the value using the given formatter.

impl DeclaredVariant for ConsecutiveSets

impl<'de> Deserialize<'de> for ConsecutiveSets

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Problem for ConsecutiveSets

const NAME: &'static str = "ConsecutiveSets"

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

type Solution = Vec<Option<usize>>

Mathematical witness type for this problem.

type Value = Or

The evaluation value type.

fn parameter_names() -> &'static [&'static str]

Canonical parameter names for this problem model.

fn parameters(&self) -> ProblemParameters

Measure the complete canonical parameters of this concrete instance.

fn evaluate(&self, config: &Self::Solution) -> Result<Or, EvaluationError>

Evaluate the problem on a solution.

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

Returns variant attributes derived from type parameters.

fn problem_type() -> ProblemType

Look up this problem’s catalog entry.

impl Serialize for ConsecutiveSets

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

where __S: Serializer,

Serialize this value into the given Serde serializer.