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
|
/**
*
* 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.
*
*/
#ifndef DENDROGRAM_H
#define DENDROGRAM_H
#include <map>
#include <vector>
#include <tulip/TulipPluginHeaders.h>
class OrientableLayout;
class OrientableCoord;
class OrientableSizeProxy;
/** \addtogroup layout */
/** This plugin is an implementation of a dendrogram, an extended implementation
* of a "Bio representation" which includes variable orientation
* and variable node sizelayout.
*
* \note This works on tree.
* Let n be the number of nodes, the algorithm complexity is in O(n).
*
* \author Julien Testut, Antony Durand, Pascal Ollier, Yashvin Nababsing, \n
* Sebastien Leclerc, Thibault Ruchon, Eric Dauchier \n
* University Bordeaux I France
**/
class Dendrogram : public tlp::LayoutAlgorithm {
public:
PLUGININFORMATION("Dendrogram",
"Julien Testut, Antony Durand, Pascal Ollier, Yashvin Nababsing, "
"Sebastien Leclerc, Thibault Ruchon, Eric Dauchier",
"03/12/04",
"This is an implementation of a dendrogram, an extended "
"implementation of a <b>Bio representation</b> which includes "
"variable orientation and variable node sizelayout.",
"1.0", "Tree")
Dendrogram(const tlp::PluginContext *context);
~Dendrogram() override;
bool run() override;
private:
float spacing;
float nodeSpacing;
std::map<tlp::node, float> leftshift;
tlp::node root;
tlp::Graph *tree;
std::vector<float> levelHeights;
float setAllNodesCoordX(tlp::node n, float rightMargin, OrientableLayout *oriLayout,
OrientableSizeProxy *oriSize);
void setAllNodesCoordY(OrientableLayout *oriLayout, OrientableSizeProxy *oriSize);
float computeFatherXPosition(tlp::node father, OrientableLayout *oriLayout);
void shiftAllNodes(tlp::node n, float shift, OrientableLayout *oriLayout);
void setNodePosition(tlp::node n, float x, float y, float z, OrientableLayout *oriLayout);
void setCoordY(tlp::node n, float &maxYLeaf, OrientableLayout *oriLayout,
OrientableSizeProxy *oriSize);
void computeLevelHeights(tlp::Graph *tree, tlp::node n, unsigned int depth,
OrientableSizeProxy *oriSize);
};
#endif
|
