#include <MetisSupport.h>
| Public Types | |
| typedef Matrix< Index, Dynamic, 1 > | IndexVector | 
| typedef PermutationMatrix< Dynamic, Dynamic, Index > | PermutationType | 
| Public Member Functions | |
| template<typename MatrixType > | |
| void | get_symmetrized_graph (const MatrixType &A) | 
| template<typename MatrixType > | |
| void | operator() (const MatrixType &A, PermutationType &matperm) | 
| Protected Attributes | |
| IndexVector | m_indexPtr | 
| IndexVector | m_innerIndices | 
Get the fill-reducing ordering from the METIS package
If A is the original matrix and Ap is the permuted matrix, the fill-reducing permutation is defined as follows : Row (column) i of A is the matperm(i) row (column) of Ap. WARNING: As computed by METIS, this corresponds to the vector iperm (instead of perm)
Definition at line 22 of file MetisSupport.h.
| typedef Matrix<Index,Dynamic,1> Eigen::MetisOrdering< Index >::IndexVector | 
Definition at line 26 of file MetisSupport.h.
| typedef PermutationMatrix<Dynamic,Dynamic,Index> Eigen::MetisOrdering< Index >::PermutationType | 
Definition at line 25 of file MetisSupport.h.
| 
 | inline | 
Definition at line 29 of file MetisSupport.h.
| 
 | inline | 
Definition at line 103 of file MetisSupport.h.
| 
 | protected | 
Definition at line 132 of file MetisSupport.h.
| 
 | protected | 
Definition at line 133 of file MetisSupport.h.