Struct BottleneckTravelingSalesman 

pub struct BottleneckTravelingSalesman { /* private fields */ }

The Bottleneck Traveling Salesman problem on a simple weighted graph.

Implementations

impl BottleneckTravelingSalesman

pub fn new(graph: SimpleGraph, edge_weights: Vec<i32>) -> Self

Create a BottleneckTravelingSalesman problem from a graph with edge weights.

pub fn graph(&self) -> &SimpleGraph

Get a reference to the underlying graph.

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

Get the weights for the problem.

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

Set new weights for the problem.

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

Get all edges with their weights.

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.

pub fn is_weighted(&self) -> bool

This model is always weighted.

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

Check if a configuration is a valid Hamiltonian cycle.

Trait Implementations

impl Clone for BottleneckTravelingSalesman

fn clone(&self) -> BottleneckTravelingSalesman

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BottleneckTravelingSalesman

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for BottleneckTravelingSalesman

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Problem for BottleneckTravelingSalesman

const NAME: &'static str = "BottleneckTravelingSalesman"

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<BottleneckTravelingSalesman> for HamiltonianCircuit<SimpleGraph>

type Result = ReductionHamiltonianCircuitToBottleneckTravelingSalesman

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for BottleneckTravelingSalesman

type Result = ReductionBTSPToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl Serialize for BottleneckTravelingSalesman

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 BottleneckTravelingSalesman