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
|
/**
*
* This file is part of Tulip (www.tulip-software.org)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux 1 and Inria Bordeaux - Sud Ouest
*
* 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 _TREELEAFLAYOUT_H
#define _TREELEAFLAYOUT_H
#include <tulip/TulipPlugin.h>
class OrientableLayout;
class OrientableSizeProxy;
/** \addtogroup layout */
/*@{*/
/// An implementation of a simple tree layout.
/**
*
* This plugin is an implementation of a simple tree layout.
* All leaves are placed at a distance one (x-coordinates) and the order
* is the one of a suffix ordering. The y coordinates is the depth in the
* tree. The other nodes are placed at the center of their children
* (x-coordinates), and the y-coordinate is their depth in the tree.
*
* <b>HISTORY</b>
*
* - 01/12/99 Verson 0.0.1: Initial release
*
*
* \note Let n be the number of nodes, the algorithm complexity is in O(n).
*
*
* \author David Auber University Bordeaux I France: Email:auber@tulip-software.org
*/
class TreeLeaf:public tlp::LayoutAlgorithm {
public:
TreeLeaf(const tlp::PropertyContext &);
~TreeLeaf();
bool run();
private:
float spacing;
float nodeSpacing;
std::vector<float> levelHeights;
float dfsPlacement(tlp::Graph* tree, tlp::node n, float x, float y, unsigned int depth,
OrientableLayout *oriLayout, OrientableSizeProxy *oriSize);
void computeLevelHeights(tlp::Graph* tree, tlp::node n, unsigned int depth,
OrientableSizeProxy *oriSize);
};
/*@}*/
#endif
|
