tree02.hh

Go to the documentation of this file.
1 
6 #ifndef aglowavTree02_hh
7 #define aglowavTree02_hh
8 
9 #include "basics/exceptions.hh"
10 #include "cluster/tree03.hh"
11 #include "aglowav/tree.hh"
12 
13 namespace aglowav {
14 
15  // **************************************************************** Tree02 **
16 
20  template<class BiClNode>
21  class Tree02 : public BiTree<BiClNode>, public cluster::Tree<BiClNode> {
22 
23  public:
26  typedef typename Traits::F F;
27 
32  Tree02(const concepts::Space<F>& spc, const cluster::BBall<F>& ball);
33 
36 
38  inline uint nclst() const {return nclst_;}
40  inline uint nleaf() const {return nlf_;}
42  inline const BiClNode* root() const {return root_;}
43 
44  private:
46  BiClNode* constructor_(BiClNode* lfset,
49  void destructor_(BiClNode* nd);
50 
52  uint nlf_;
54  uint nclst_;
56  BiClNode* root_;
57  };
58 
59 } // namespace aglowav
60 
61 #endif // aglowavTree02_hh
Binary tree.
Definition: tree.hh:88
Abstract class for a space.
uint nclst() const
Number of clusters.
Definition: tree02.hh:38
BiClNode * constructor_(BiClNode *lfset, cluster::CebyCenter< BiClNode > &cby)
Private constructor for recursive calls.
const BiClNode * root() const
Root of the tree.
Definition: tree02.hh:42
Binary tree for the cluster and agglomeration algorithm.
Definition: tree02.hh:21
uint nlf_
Number of leafs.
Definition: tree02.hh:52
Abstract class to compute a bounding ball of an element (the leafs of a cluster tree).
Definition: tree.hh:36
Class to compute the Cebysev ball of a point set, i.e., the smallest ball containing all points.
Definition: tree03.hh:44
Abstract class for a cluster tree.
Definition: tree.hh:274
uint nleaf() const
Number of leafs.
Definition: tree02.hh:40
Traits for the binary cluster tree algorithm.
Definition: tree.hh:103
cluster::TreeTraits< BiClNode >::F F
Type of element (Real || Cmplx)
Definition: tree.hh:106
void destructor_(BiClNode *nd)
Private destructor for recursive calls.
BiClNode * root_
Root of the tree.
Definition: tree02.hh:56
Tree02(const concepts::Space< F > &spc, const cluster::BBall< F > &ball)
Constructor.
~Tree02()
Destructor.
Definition: tree02.hh:35
Used for the aglowav classes for the boundary element method.
Definition: element.hh:21
ClstBiTreeTraits< BiClNode > Traits
How a node has to behave.
Definition: tree02.hh:25
Traits::F F
Definition: tree02.hh:26
uint nclst_
Number of clusters.
Definition: tree02.hh:54
Page URL: http://wiki.math.ethz.ch/bin/view/Concepts/WebHome
21 August 2020
© 2020 Eidgenössische Technische Hochschule Zürich