Struct TspProblem 

pub struct TspProblem { /* private fields */ }

TSP problem definition

Implementations

impl TspProblem

pub fn new(distances: Vec<Vec<f64>>) -> OptimizeResult<Self>

Create a TSP from a distance matrix

pub fn from_coordinates(coords: &[(f64, f64)]) -> OptimizeResult<Self>

Create a TSP from 2D coordinates (Euclidean distances)

pub fn num_cities(&self) -> usize

Get number of cities

pub fn distance(&self, i: usize, j: usize) -> f64

Get distance between two cities

Trait Implementations

impl Clone for TspProblem

fn clone(&self) -> TspProblem

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl CombinatorialProblem for TspProblem

fn num_nodes(&self) -> usize

Number of nodes (cities, tasks, etc.)

fn heuristic(&self, i: usize, j: usize) -> f64

Heuristic desirability of going from node i to node j. Higher is more desirable (typically 1/distance for TSP).

fn evaluate(&self, solution: &[usize]) -> f64

Evaluate the quality (cost) of a complete solution (permutation of node indices). Lower is better.

fn is_feasible(&self, _current: usize, _next: usize, _visited: &[bool]) -> bool

Check if moving from current node to next node is feasible. Default returns true (all moves allowed).

impl Debug for TspProblem

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

Formats the value using the given formatter.