HLIBpro
3.0
|
Represents a cluster tree with permutation of index sets.
#include <TClusterTree.hh>
Public Member Functions | |
TClusterTree (TCluster *rootcl, const TPermutation *perme2i, const TPermutation *permi2e) | |
virtual | ~TClusterTree () |
deconstruct cluster tree and permutation objects | |
TCluster * | root () |
return root of cluster tree | |
const TCluster * | root () const |
return root of cluster tree | |
const TPermutation * | perm_e2i () const |
return external to internal permutation | |
const TPermutation * | perm_i2e () const |
return internal to external permutation | |
virtual uint | nnodes () const |
return no of nodes | |
virtual uint | depth () const |
depth of tree | |
virtual void | collect_leaves (std::list< TCluster * > &leaves, const int adepth=-1, const int level=0) const |
collect leaves or nodes with depth adepth in list | |
virtual void | flatten () |
flatten hierarchy of cluster tree | |
virtual size_t | byte_size () const |
return size in bytes used by this object | |
|
inline |
construct cluster tree with root as rootcl and permutations perme2i and permi2e