Function sprs_suitesparse_camd::try_camd

pub fn try_camd<I, Iptr>(
    mat: CsStructureViewI<'_, I, Iptr>
) -> Result<PermOwnedI<I>, LinalgError> where
    I: SpIndex,
    Iptr: SpIndex, 

Find a permutation matrix P which reduces the fill-in of the square sparse matrix mat in Cholesky factorization (ie, the number of nonzeros of the Cholesky factorization of P A P^T is less than for the Cholesky factorization of A).

If A is not symmetric, the ordering will be computed for A + A^T

Errors

This function will error if the passed matrix is not square.