Struct EliminationTree 

pub struct EliminationTree { /* private fields */ }

Elimination tree of a sparse matrix.

The elimination tree captures the parent-child relationships among columns during Cholesky or LU factorization. It is the foundation for supernodal and multifrontal methods.

Implementations

impl EliminationTree

pub fn from_csr(row_offsets: &[usize], col_indices: &[usize], n: usize) -> Self

Compute the elimination tree from CSR structure (lower triangle).

Uses union-find with path compression for O(n * alpha(n)) complexity.

pub fn postorder_traversal(&self) -> &[usize]

Returns nodes in postorder (leaves before parents).

pub fn subtree_size(&self, node: usize) -> usize

Size of the subtree rooted at node (including the node itself).

pub fn size(&self) -> usize

Number of nodes.

pub fn parent_of(&self, node: usize) -> Option<usize>

Parent of a node.

pub fn children_of(&self, node: usize) -> &[usize]

Children of a node.

Trait Implementations

impl Clone for EliminationTree

fn clone(&self) -> EliminationTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for EliminationTree

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

Formats the value using the given formatter.