Struct StackerCrane 

pub struct StackerCrane { /* private fields */ }

The Stacker Crane problem.

A configuration is a permutation of the required arc indices. The walk traverses those arcs in the chosen order, connecting the head of each arc to the tail of the next arc by a shortest path in the mixed graph induced by the required directed arcs together with the undirected edges. The objective is to minimize the total walk length.

Implementations

impl StackerCrane

pub fn new( num_vertices: usize, arcs: Vec<(usize, usize)>, edges: Vec<(usize, usize)>, arc_lengths: Vec<i32>, edge_lengths: Vec<i32>, ) -> Self

Create a new Stacker Crane instance.

Panics

Panics if the instance data are inconsistent or contain negative lengths.

pub fn try_new( num_vertices: usize, arcs: Vec<(usize, usize)>, edges: Vec<(usize, usize)>, arc_lengths: Vec<i32>, edge_lengths: Vec<i32>, ) -> Result<Self, String>

Create a new Stacker Crane instance, returning validation errors.

pub fn num_vertices(&self) -> usize

Get the number of vertices in the mixed graph.

pub fn arcs(&self) -> &[(usize, usize)]

Get the required directed arcs.

pub fn edges(&self) -> &[(usize, usize)]

Get the available undirected edges.

pub fn arc_lengths(&self) -> &[i32]

Get the required arc lengths.

pub fn edge_lengths(&self) -> &[i32]

Get the undirected edge lengths.

pub fn num_arcs(&self) -> usize

Get the number of required arcs.

pub fn num_edges(&self) -> usize

Get the number of undirected edges.

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

Compute the total closed-walk length induced by a configuration.

Returns None for invalid permutations, unreachable connector paths, or arithmetic overflow.

Trait Implementations

impl Clone for StackerCrane

fn clone(&self) -> StackerCrane

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for StackerCrane

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for StackerCrane

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Problem for StackerCrane

const NAME: &'static str = "StackerCrane"

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

type Value = Min<i32>

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<i32>

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 StackerCrane

type Result = ReductionSCToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<StackerCrane> for HamiltonianCircuit<SimpleGraph>

type Result = ReductionHamiltonianCircuitToStackerCrane

The reduction result type.

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

Reduce this problem to the target problem type.

impl Serialize for StackerCrane

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 StackerCrane