Eigen::AMDOrdering< StorageIndex > Class Template Reference

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

#include <Ordering.h>

Public Types
typedef PermutationMatrix< Dynamic, Dynamic, StorageIndex >	PermutationType

Public Member Functions
template<typename MatrixType >
void	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 SrcType , unsigned int SrcUpLo>
void	operator() (const SparseSelfAdjointView< SrcType, SrcUpLo > &mat, PermutationType &perm)
	Compute the permutation with a selfadjoint matrix.

Detailed Description

template<typename StorageIndex>
class Eigen::AMDOrdering< StorageIndex >

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

Template Parameters

StorageIndex

The type of indices of the matrix

See also

COLAMDOrdering

---

The documentation for this class was generated from the following file:

• third-party-libs/eigen3/Eigen/src/OrderingMethods/Ordering.h