1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
|
/**
*
* This file is part of Tulip (https://tulip.labri.fr)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux
*
* Tulip is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License
* as published by the Free Software Foundation, either version 3
* of the License, or (at your option) any later version.
*
* Tulip is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
* See the GNU General Public License for more details.
*
*/
#include <list>
#include <tulip/TulipPluginHeaders.h>
using namespace std;
using namespace tlp;
static const char *paramHelp[] = {
// depth
"Depth of the tree.",
// degree
"The tree's degree.",
// tree layout
"If true, the generated tree is drawn with the 'Tree Leaf' layout algorithm."};
/** \addtogroup import */
/// Complete Tree - Import of a complete tree
/** This plugin enables to create a complete tree
*
* User can specify the depth and the degree of the tree.
*/
class CompleteTree : public ImportModule {
public:
PLUGININFORMATION("Complete Tree", "Auber", "08/09/2002", "Imports a new complete tree.", "1.1",
"Graph")
CompleteTree(tlp::PluginContext *context) : ImportModule(context) {
addInParameter<unsigned int>("depth", paramHelp[0], "5");
addInParameter<unsigned int>("degree", paramHelp[1], "2");
addInParameter<bool>("tree layout", paramHelp[2], "false");
addDependency("Tree Leaf", "1.1");
}
~CompleteTree() override {}
bool importGraph() override {
unsigned int degree = 2;
unsigned int depth = 5;
bool needLayout = false;
if (dataSet != nullptr) {
dataSet->get("depth", depth);
dataSet->get("degree", degree);
dataSet->get("tree layout", needLayout);
}
// reserve enough memory for nodes/edges to add
unsigned int total = 0, previous = 1;
for (unsigned int i = 0; i < depth; ++i) {
previous *= degree;
total += previous;
}
graph->reserveEdges(total);
vector<node> nodes;
graph->addNodes(total + 1, nodes);
unsigned int current = 0;
unsigned int nextChild = 1;
while (total) {
node n = nodes[current];
for (unsigned int i = 0; i < degree; ++i, ++nextChild, --total) {
graph->addEdge(n, nodes[nextChild]);
}
++current;
}
if (needLayout) {
// apply Tree Leaf
string errMsg;
LayoutProperty *layout = graph->getProperty<LayoutProperty>("viewLayout");
return graph->applyPropertyAlgorithm("Tree Leaf", layout, errMsg, nullptr, pluginProgress);
}
return true;
}
};
PLUGIN(CompleteTree)
|
