#include <Ordering.h>
Public Types | |
typedef Matrix< StorageIndex, Dynamic, 1 > | IndexVector |
typedef PermutationMatrix< Dynamic, Dynamic, StorageIndex > | PermutationType |
Public Member Functions | |
template<typename MatrixType > | |
void | operator() (const MatrixType &mat, PermutationType &perm) |
StorageIndex | The type of indices of the matrix |
Functor computing the column approximate minimum degree ordering The matrix should be in column-major and compressed format (see SparseMatrix::makeCompressed()).
Definition at line 118 of file Ordering.h.
typedef Matrix<StorageIndex, Dynamic, 1> Eigen::COLAMDOrdering< StorageIndex >::IndexVector |
Definition at line 122 of file Ordering.h.
typedef PermutationMatrix<Dynamic, Dynamic, StorageIndex> Eigen::COLAMDOrdering< StorageIndex >::PermutationType |
Definition at line 121 of file Ordering.h.
|
inline |
Compute the permutation vector perm form the sparse matrix mat
Definition at line 128 of file Ordering.h.