Struct TravelingSalesman 

pub struct TravelingSalesman<G, W> { /* private fields */ }

The Traveling Salesman problem.

Given a weighted graph G = (V, E) with edge weights w_e, find a cycle that visits every vertex exactly once and minimizes the total edge weight.

Representation

Each edge is assigned a binary variable:

• 0: edge is not in the cycle
• 1: edge is in the cycle

A valid Hamiltonian cycle requires:

• Exactly 2 selected edges incident to each vertex (degree constraint)
• Selected edges form a single connected cycle (no subtours)
• Exactly |V| edges are selected

Type Parameters

• G - The graph type (e.g., SimpleGraph, KingsSubgraph)
• W - The weight type for edges (e.g., i32, f64)

Implementations

impl<G: Graph, W: Clone + Default> TravelingSalesman<G, W>

pub fn new(graph: G, edge_weights: Vec<W>) -> Self

Create a TravelingSalesman problem from a graph with given edge weights.

pub fn unit_weights(graph: G) -> Self

where W: From<i32>,

Create a TravelingSalesman problem with unit weights.

pub fn graph(&self) -> &G

Get a reference to the underlying graph.

pub fn edges(&self) -> Vec<(usize, usize, W)>

Get all edges with their weights.

pub fn set_weights(&mut self, weights: Vec<W>)

Set new weights for the problem.

pub fn weights(&self) -> Vec<W>

Get the weights for the problem.

pub fn is_weighted(&self) -> bool

where W: WeightElement,

Check if the problem uses a non-unit weight type.

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

Check if a configuration is a valid Hamiltonian cycle.

impl<G: Graph, W: WeightElement> TravelingSalesman<G, W>

pub fn num_vertices(&self) -> usize

Get the number of vertices in the underlying graph.

pub fn num_edges(&self) -> usize

Get the number of edges in the underlying graph.

Trait Implementations

impl<G: Clone, W: Clone> Clone for TravelingSalesman<G, W>

fn clone(&self) -> TravelingSalesman<G, W>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<G: Debug, W: Debug> Debug for TravelingSalesman<G, W>

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

Formats the value using the given formatter.

impl<'de, G, W> Deserialize<'de> for TravelingSalesman<G, W>

where G: Deserialize<'de>, W: 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, W> OptimizationProblem for TravelingSalesman<G, W>

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

type Value = <W as WeightElement>::Sum

The inner objective value type (e.g., i32, f64).

fn direction(&self) -> Direction

Whether to maximize or minimize the metric.

impl<G, W> Problem for TravelingSalesman<G, W>

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

const NAME: &'static str = "TravelingSalesman"

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

type Metric = SolutionSize<<W as WeightElement>::Sum>

The evaluation metric 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]) -> SolutionSize<W::Sum>

Evaluate the problem on a configuration.

fn num_variables(&self) -> usize

Number of variables (derived from dims).

impl ReduceTo<ILP> for TravelingSalesman<SimpleGraph, i32>

type Result = ReductionTSPToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl<G, W> Serialize for TravelingSalesman<G, W>

where G: Serialize, W: 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 TravelingSalesman<SimpleGraph, i32>