Struct Amd 

pub struct Amd {
    pub dense: Option<f64>,
    pub aggressive: bool,
}

Approximate minimum degree (Amestoy, Davis & Duff 1996), Algorithm A: quotient graph with element absorption, approximate external degrees, mass elimination of indistinguishable nodes and dense-row detection. Our own implementation (D10); SuiteSparse AMD is the oracle in tests.

Fields

dense: Option<f64>

Nodes of degree above max(16, dense · √n) are ordered last (None: AMD’s default 10; negative: no dense detection).

aggressive: bool

Aggressive absorption of elements (AMD’s default: on).

Trait Implementations

impl Clone for Amd

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 Amd

impl Debug for Amd

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

Formats the value using the given formatter.

impl Default for Amd

fn default() -> Self

Returns the “default value” for a type.

impl Ordering for Amd

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 Amd

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Amd