pub fn col_etree<'out, I>(
A: SymbolicSparseColMatRef<'_, I>,
col_perm: Option<PermRef<'_, I>>,
etree: &'out mut [I],
stack: PodStack<'_>,
) -> EliminationTreeRef<'out, I>where
I: Index,
Expand description
Computes the column elimination tree of $A$, which is the same as the elimination tree of $A^H A$.
etree
has length A.ncols()