1 /***************************************************************************
2 * Copyright (C) 2006 by Michael Andreen *
3 * andreen@student.chalmers.se *
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. *
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. *
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 ***************************************************************************/
21 #ifndef __COMPONENTTREE_H__
22 #define __COMPONENTTREE_H__
30 Node(Node* parent, Component comp);
35 std::vector<Node*> _children;
39 * Creates a component tree from a list of components.
41 ComponentTree(const std::vector<Component>& components);
46 * Transforms the tree into the minimal tree containing all unoriented componentes.
47 * \todo come up with a better name
49 void makeUnoriented();
54 //Disable these, at least for now.
55 void operator=(const ComponentTree&){};
56 ComponentTree(const ComponentTree&): _root(0){};
58 void removeOriented(Node* n);
59 size_t countLeaves(Node* n);
63 friend class ComponentTreeTest;