src/componenttree.h

   1 /***************************************************************************
   2  *   Copyright (C) 2006 by Michael Andreen                                 *
   3  *   andreen@student.chalmers.se                                           *
   4  *                                                                         *
   5  *   This program is free software; you can redistribute it and/or modify  *
   6  *   it under the terms of the GNU General Public License as published by  *
   7  *   the Free Software Foundation; either version 2 of the License, or     *
   8  *   (at your option) any later version.                                   *
   9  *                                                                         *
  10  *   This program is distributed in the hope that it will be useful,       *
  11  *   but WITHOUT ANY WARRANTY; without even the implied warranty of        *
  12  *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *
  13  *   GNU General Public License for more details.                          *
  14  *                                                                         *
  15  *   You should have received a copy of the GNU General Public License     *
  16  *   along with this program; if not, write to the                         *
  17  *   Free Software Foundation, Inc.,                                       *
  18  *   51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA          *
  19  ***************************************************************************/
  20
  21 #ifndef __COMPONENTTREE_H__
  22 #define __COMPONENTTREE_H__
  23
  24 #include <vector>
  25 #include <map>
  26 #include "misc.h"
  27
  28 class ComponentTree {
  29         public:
  30                 struct Node {
  31                         Node(Node* parent, Component comp);
  32                         ~Node();
  33
  34                         Node* _parent;
  35                         Component _comp;
  36                         std::vector<Node*> _children;
  37                 };
  38
  39                 /**
  40                  * Creates a component tree from a list of components.
  41                  */
  42                 ComponentTree(const std::vector<Component>& components);
  43
  44                 ~ComponentTree();
  45
  46                 /**
  47                  * Transforms the tree into the minimal tree containing all unoriented componentes.
  48                  * \todo come up with a better name
  49                  */
  50                 void makeUnoriented();
  51
  52                 size_t countLeaves();
  53
  54                 size_t shortBranches();
  55
  56         private:
  57                 //Disable these, at least for now.
  58                 void operator=(const ComponentTree&){};
  59                 ComponentTree(const ComponentTree&): _root(0){};
  60
  61                 void removeOriented(Node* n);
  62                 size_t countLeaves(Node* n);
  63                 void branches (Node* n, std::map<Node*,size_t> & b);
  64
  65                 Node* _root;
  66
  67         friend class ComponentTreeTest;
  68 };
  69
  70 #endif