#include <Ordering.h>
Public Types | |
typedef PermutationMatrix< Dynamic, Dynamic, StorageIndex > | PermutationType |
Public Member 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) |
Functor computing the approximate minimum degree ordering If the matrix is not structurally symmetric, an ordering of A^T+A is computed
StorageIndex | The type of indices of the matrix |
Definition at line 50 of file 3rdparty/Eigen/Eigen/src/OrderingMethods/Ordering.h.
typedef PermutationMatrix<Dynamic, Dynamic, StorageIndex> Eigen::AMDOrdering< StorageIndex >::PermutationType |
Definition at line 53 of file 3rdparty/Eigen/Eigen/src/OrderingMethods/Ordering.h.
|
inline |
Compute the permutation vector from a sparse matrix This routine is much faster if the input matrix is column-major
Definition at line 59 of file 3rdparty/Eigen/Eigen/src/OrderingMethods/Ordering.h.
|
inline |
Compute the permutation with a selfadjoint matrix
Definition at line 72 of file 3rdparty/Eigen/Eigen/src/OrderingMethods/Ordering.h.