Struct ShortestWeightConstrainedPath 

pub struct ShortestWeightConstrainedPath<G, N: WeightElement> { /* private fields */ }

The Shortest Weight-Constrained Path problem.

Given a graph G = (V, E) with positive edge lengths l(e) and edge weights w(e), designated vertices s and t, and a weight bound W, find a simple path from s to t that minimizes total length subject to total weight at most W.

Representation

Each edge is assigned a binary variable:

• 0: edge is not in the selected path
• 1: edge is in the selected path

A valid configuration must:

• form a single simple path from source_vertex to target_vertex
• use only edges present in the graph
• satisfy the weight bound

The objective value is the total length of the path (Min<N::Sum>).

Type Parameters

• G - The graph type (e.g., SimpleGraph)
• N - The edge length / weight type (e.g., i32, f64)

Implementations

impl<G: Graph, N: WeightElement> ShortestWeightConstrainedPath<G, N>

pub fn new( graph: G, edge_lengths: Vec<N>, edge_weights: Vec<N>, source_vertex: usize, target_vertex: usize, weight_bound: N::Sum, ) -> Self

Create a new ShortestWeightConstrainedPath instance.

Panics

Panics if either edge vector length does not match the graph’s edge count, or if the source / target vertices are out of bounds.

pub fn graph(&self) -> &G

Get a reference to the underlying graph.

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

Get the edge lengths.

pub fn edge_weights(&self) -> &[N]

Get the edge weights.

pub fn set_lengths(&mut self, edge_lengths: Vec<N>)

Set new edge lengths.

pub fn set_weights(&mut self, edge_weights: Vec<N>)

Set new edge weights.

pub fn source_vertex(&self) -> usize

Get the source vertex.

pub fn target_vertex(&self) -> usize

Get the target vertex.

pub fn weight_bound(&self) -> &N::Sum

Get the weight bound.

pub fn is_weighted(&self) -> bool

Check whether this problem uses a non-unit weight type.

pub fn num_vertices(&self) -> usize

Get the number of vertices in the graph.

pub fn num_edges(&self) -> usize

Get the number of edges in the graph.

pub fn is_valid_solution(&self, config: &[usize]) -> Option<N::Sum>

Check if a configuration is a valid weight-constrained s-t path.

Returns Some(total_length) for a valid simple s-t path whose total weight is within the weight bound, or None otherwise.

Trait Implementations

impl<G: Clone, N: Clone + WeightElement> Clone for ShortestWeightConstrainedPath<G, N>

where N::Sum: Clone,

fn clone(&self) -> ShortestWeightConstrainedPath<G, N>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<G: Debug, N: Debug + WeightElement> Debug for ShortestWeightConstrainedPath<G, N>

where N::Sum: Debug,

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

Formats the value using the given formatter.

impl<'de, G, N> Deserialize<'de> for ShortestWeightConstrainedPath<G, N>

where G: Deserialize<'de>, N: Deserialize<'de> + WeightElement, N::Sum: Deserialize<'de>,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<G, N> Problem for ShortestWeightConstrainedPath<G, N>

where G: Graph + VariantParam, N: WeightElement + VariantParam,

const NAME: &'static str = "ShortestWeightConstrainedPath"

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

type Value = Min<<N as WeightElement>::Sum>

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<N::Sum>

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<i32>> for ShortestWeightConstrainedPath<SimpleGraph, i32>

type Result = ReductionSWCPToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl<G, N> Serialize for ShortestWeightConstrainedPath<G, N>

where G: Serialize, N: Serialize + WeightElement, N::Sum: Serialize,

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 ShortestWeightConstrainedPath<SimpleGraph, i32>