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
|
/**
*
* This file is part of Tulip (www.tulip-software.org)
*
* 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 _TreeReingoldAndTilfordExtended_H
#define _TreeReingoldAndTilfordExtended_H
#include <string>
#include <math.h>
#include <tulip/tuliphash.h>
#include <tulip/TulipPluginHeaders.h>
struct LR {
double L;
double R;
int size;
};
/** \addtogroup layout */
/** This plugin is an implementation of the hierarchical tree layout
* algorithm first published as:
*
* E.M. Reingold and J.S. Tilford, \n
* "Tidier Drawings of Trees", \n
* "IEEE Transactions on Software Engineering" \n
* pages "223--228" \n
* 1981 \n
*
* \note This algorithm only works on trees; so if the graph is not a tree
* it will be applied on a spanning tree.\n
* Let n be the number of nodes, the algorithm complexity is in O(n).\n
* It extends the original Reingold and Tilford by providing managment
* of different node size and different edge length. \n \n
* The algorithm use the (Size)"viewSize" property for element size and the
* (int)"treeEdgeLength" for the edge length.
*
*/
class TreeReingoldAndTilfordExtended:public tlp::LayoutAlgorithm {
public:
PLUGININFORMATION("Hierarchical Tree (R-T Extended)","David Auber and Romain Bourqui","24/09/2010","Beta","1.1","Tree")
TreeReingoldAndTilfordExtended(const tlp::PluginContext* context);
~TreeReingoldAndTilfordExtended();
bool run();
private:
void calcLayout(tlp::node, TLP_HASH_MAP<tlp::node,double> *,double, double, int ,std::map<int,double> &);
double calcDecal(const std::list<LR>& , const std::list<LR>&);
std::list<LR>* mergeLRList(std::list<LR>*,std::list<LR>*,double decal);
std::list<LR>* TreePlace(tlp::node, TLP_HASH_MAP<tlp::node,double>*);
void TreeLevelSizing(tlp::node ,std::map<int,double> &,int , std::map<tlp::node,int> &levels);
tlp::Graph *tree;
tlp::SizeProperty *sizes;
tlp::IntegerProperty *lengthMetric;
bool ortho;
bool useLength;
std::string orientation;
float spacing;
float nodeSpacing;
bool compactLayout;
};
#endif
|
