Struct EuclideanMatrix 

pub struct EuclideanMatrix { /* private fields */ }

Planar Euclidean cost matrix.

Distance is the straight-line distance between planar (x, y) coordinates, stored in Coord as lon = x, lat = y. Following the Solomon VRPTW convention, travel time equals distance (unit speed), so the same numbers drive both legs and time-window arithmetic. This is the matrix the Solomon benchmark uses — never Haversine.

Implementations

impl EuclideanMatrix

pub fn new(coords: Vec<Coord>) -> Self

Build a matrix over planar coordinates, indexed by LocationId.

pub fn from_problem(problem: &Problem) -> Self

Build a matrix matching a Problem’s location layout: depot at LocationId::DEPOT, then stops in order.

Trait Implementations

impl Clone for EuclideanMatrix

fn clone(&self) -> EuclideanMatrix

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl CostMatrix for EuclideanMatrix

fn distance(&self, a: LocationId, b: LocationId) -> f64

Great-circle / road distance between a and b, in kilometres.

fn time(&self, a: LocationId, b: LocationId) -> f64

Travel time between a and b, in hours.

impl Debug for EuclideanMatrix

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

Formats the value using the given formatter.