Struct vrp_core::models::matrix::SparseMatrix

pub struct SparseMatrix {
    pub data: HashMap<usize, Vec<(usize, f64)>>,
    pub values: HashSet<i64>,
    pub size: usize,
}

A simple AdjacencyMatrix using naive sparse matrix implementation.

Fields

data: HashMap<usize, Vec<(usize, f64)>>

values: HashSet<i64>

size: usize

Methods

impl SparseMatrix

pub fn to_vvec(&self) -> Vec<Vec<f64>>

Converts SparseMatrix to vector of vectors representation.

pub fn from_vvec(matrix: &[Vec<f64>]) -> Self

Creates SparseMatrix from vector of vectors representation.

Trait Implementations

impl AdjacencyMatrix for SparseMatrix

fn new(size: usize) -> Self

Creates a new AdjacencyMatrix with size*size

fn values<'a>(&'a self) -> Box<dyn Iterator<Item = f64> + 'a>

Iterates over unique matrix values.

fn set_cell(&mut self, row: usize, col: usize, value: f64)

Sets given value to cell.

fn scan_row<F>(&self, row: usize, predicate: F) -> Option<usize> where
    F: Fn(f64) -> bool, 

Scans given row in order to find first occurrence of element for which predicate returns true.