Eigen::AMDOrdering< Index > Class Template Reference

#include <Ordering.h>

List of all members.

Public Types
typedef PermutationMatrix< Dynamic, Dynamic, Index >	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)

---

Detailed Description

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

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

See also:

COLAMDOrdering

Definition at line 1900 of file Ordering.h.

---

Member Typedef Documentation

template<typename Index>

typedef PermutationMatrix<Dynamic, Dynamic, Index> Eigen::AMDOrdering< Index >::PermutationType

Definition at line 1903 of file Ordering.h.

---

Member Function Documentation

template<typename Index>

template<typename SrcType, unsigned int SrcUpLo>

void Eigen::AMDOrdering< Index >::operator()	(	const SparseSelfAdjointView< SrcType, SrcUpLo > &	mat,
		PermutationType &	perm
	)			[inline]

Compute the permutation with a selfadjoint matrix

Definition at line 1922 of file Ordering.h.

template<typename Index>

template<typename MatrixType>

void Eigen::AMDOrdering< Index >::operator()	(	const MatrixType &	mat,
		PermutationType &	perm
	)			[inline]

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

Definition at line 1909 of file Ordering.h.

---

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

• Eigen/include/src/OrderingMethods/Ordering.h

---