Go to the documentation of this file.
6 #ifndef aglowavTree01_hh
7 #define aglowavTree01_hh
18 template<
class BiClNode>
58 #endif // aglowavTree01_hh
Abstract class for a space.
Binary tree for the cluster and agglomeration algorithm.
void destructor_(BiClNode *clst)
Private destructor for recursive calls.
BiClNode * constructor_(BiClNode *lfset)
Private constructor for recursive calls.
uint nclst_
Number of clusters.
Tree01(const concepts::Space< F > &spc, const cluster::BBall< F > &ball)
Constructor.
Abstract class to compute a bounding ball of an element (the leafs of a cluster tree).
virtual ~Tree01()
Destructor.
Abstract class for a cluster tree.
uint nlf_
Number of leafs.
Traits for the binary cluster tree algorithm.
cluster::TreeTraits< BiClNode >::F F
Type of element (Real || Cmplx)
const BiClNode * root() const
Root of the tree.
uint nleaf() const
Number of leafs.
Used for the aglowav classes for the boundary element method.
uint nclst() const
Number of clusters.
ClstBiTreeTraits< BiClNode > Traits
How a node has to behave.
BiClNode * root_
Root of the tree.