template<typename StorageIndex>
Eigen::AMDOrdering class

Template parameters
StorageIndex The type of indices of the matrix

Contents

Functor computing the approximate minimum degree ordering If the matrix is not structurally symmetric, an ordering of A^T+A is computed

Public functions

template<typename MatrixType>
void operator()(const MatrixType& mat, PermutationType& perm)
template<typename SrcType, unsigned int SrcUpLo>
void operator()(const SparseSelfAdjointView<SrcType, SrcUpLo>& mat, PermutationType& perm)

Function documentation

template<typename StorageIndex> template<typename MatrixType>
void Eigen::AMDOrdering<StorageIndex>::operator()(const MatrixType& mat, PermutationType& perm)

Compute the permutation vector from a sparse matrix This routine is much faster if the input matrix is column-major

template<typename StorageIndex> template<typename SrcType, unsigned int SrcUpLo>
void Eigen::AMDOrdering<StorageIndex>::operator()(const SparseSelfAdjointView<SrcType, SrcUpLo>& mat, PermutationType& perm)

Compute the permutation with a selfadjoint matrix