Struct ShortestCommonSupersequence 

pub struct ShortestCommonSupersequence { /* private fields */ }

The Shortest Common Supersequence problem.

Given an alphabet of size k and a set of strings over {0, ..., k-1}, find the shortest string w such that every input string is a subsequence of w.

Representation

The configuration is a vector of length max_length, where each entry is a symbol in {0, ..., alphabet_size}. The value alphabet_size acts as a padding/end symbol. The effective supersequence is the prefix of non-padding symbols. Padding must be contiguous at the end.

Example

use problemreductions::models::misc::ShortestCommonSupersequence;
use problemreductions::{Problem, Solver, BruteForce};

// Alphabet {0, 1}, strings [0,1] and [1,0]
let problem = ShortestCommonSupersequence::new(2, vec![vec![0, 1], vec![1, 0]]);
let solver = BruteForce::new();
let solution = solver.find_witness(&problem);
assert!(solution.is_some());

Implementations

impl ShortestCommonSupersequence

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

Create a new ShortestCommonSupersequence instance.

max_length is computed automatically as the sum of all input string lengths (the worst-case supersequence with no overlap).

Panics

Panics if strings is empty, or if alphabet_size is 0 and any input string is non-empty.

pub fn alphabet_size(&self) -> usize

Returns the alphabet size.

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

Returns the input strings.

pub fn max_length(&self) -> usize

Returns the maximum possible supersequence length.

pub fn num_strings(&self) -> usize

Returns the number of input strings.

pub fn total_length(&self) -> usize

Returns the total length of all input strings.

Trait Implementations

impl Clone for ShortestCommonSupersequence

fn clone(&self) -> ShortestCommonSupersequence

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ShortestCommonSupersequence

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for ShortestCommonSupersequence

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Problem for ShortestCommonSupersequence

const NAME: &'static str = "ShortestCommonSupersequence"

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

type Value = Min<usize>

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]) -> Min<usize>

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 ShortestCommonSupersequence

type Result = ReductionSCSToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl Serialize for ShortestCommonSupersequence

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 ShortestCommonSupersequence