Struct Colamd 

pub struct Colamd {
    pub dense_row: Option<f64>,
    pub dense_col: Option<f64>,
}

Column approximate minimum degree (Davis, Gilbert, Larimore & Ng 2004), Algorithm C: the AMD idea applied to the pattern of SᵀS without forming it, for an LU with row pivoting. Our own implementation (D10).

Fields

dense_row: Option<f64>

Rows with more than max(16, dense_row · √n) entries are ignored (None: COLAMD’s default 10; negative: none is).

dense_col: Option<f64>

Columns with more than max(16, dense_col · √min(m, n)) entries are ordered last (None: COLAMD’s default 10; negative: none is).

Trait Implementations

impl Clone for Colamd

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Colamd

impl Debug for Colamd

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

Formats the value using the given formatter.

impl Default for Colamd

fn default() -> Self

Returns the “default value” for a type.

impl Ordering for Colamd

fn order( &self, pattern: &Pattern, target: OrderingTarget, ) -> Result<Perm, SparseError>

A permutation of the columns of pattern (for Symmetric, of its rows and columns alike).

fn name(&self) -> &'static str

A short name for logs and tables.

impl PartialEq for Colamd

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Colamd