Go to the source code of this file.
|
template<typename Index , typename IndexVector > |
Index | Eigen::internal::etree_find (Index i, IndexVector &pp) |
| Find the root of the tree/set containing the vertex i : Use Path halving. More...
|
|
template<typename MatrixType , typename IndexVector > |
int | Eigen::internal::coletree (const MatrixType &mat, IndexVector &parent, IndexVector &firstRowElt, typename MatrixType::StorageIndex *perm=0) |
| Compute the column elimination tree of a sparse matrix. More...
|
|
template<typename IndexVector > |
void | Eigen::internal::nr_etdfs (typename IndexVector::Scalar n, IndexVector &parent, IndexVector &first_kid, IndexVector &next_kid, IndexVector &post, typename IndexVector::Scalar postnum) |
| Depth-first search from vertex n. More...
|
|
template<typename IndexVector > |
void | Eigen::internal::treePostorder (typename IndexVector::Scalar n, IndexVector &parent, IndexVector &post) |
| Post order a tree. More...
|
|