col_etree

faer::sparse::linalg::qr

Function col_etree 

Source 
pub fn col_etree<'out, I: Index>(
    A: SymbolicSparseColMatRef<'_, I>,
    col_perm: Option<PermRef<'_, I>>,
    etree: &'out mut [I],
    stack: &mut MemStack,
) -> EliminationTreeRef<'out, I>
Expand description

computes the column elimination tree of $A$, which is the same as the elimination tree of $A^\top A$

etree has length A.ncols()