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
102
103
104
105
106
107
108
109
110
111
112
113
114
|
/**
*
* 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.
*
*/
#include <ogdf/misclayout/BertaultLayout.h>
#include "tulip2ogdf/OGDFLayoutPluginBase.h"
// comments below have been extracted from OGDF/src/misclayout/BertaultLayout.cpp
/**
* Computes a force directed layout (Bertault Layout) for preserving the planar embedding in the graph.
* The algorithm is based on the paper
* "A force-directed algorithm that preserves
* edge-crossing properties" by Francois Bertault
*
* \author Smit Sanghavi;
*
* \par License:
* This file is part of the Open Graph Drawing Framework (OGDF).
*
* \par
* Copyright (C)<br>
* See README.txt in the root directory of the OGDF installation for details.
*
* \par
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* Version 2 or 3 as published by the Free Software Foundation;
* see the file LICENSE.txt included in the packaging of this file
* for details.
*
* \par
* This program 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.
*
* \par
* You should have received a copy of the GNU General Public
* License along with this program; if not, write to the Free
* Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
* \see http://www.gnu.org/copyleft/gpl.html
***************************************************************/
class OGDFBertaultLayout : public OGDFLayoutPluginBase {
public:
PLUGININFORMATION("Bertault (OGDF)","Smit Sanghavi","29/05/2015","Computes a force directed layout (Bertault Layout) for preserving the planar embedding in the graph.","1.0","Force Directed")
OGDFBertaultLayout(const tlp::PluginContext* context) :OGDFLayoutPluginBase(context, new ogdf::BertaultLayout()) {
addInParameter<bool> ("impred",
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "boolean" )
HTML_HELP_BODY()
"Sets impred option."
HTML_HELP_CLOSE(),
"false", false);
addInParameter<int> ("iterno",
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "integer" )
HTML_HELP_BODY()
"The number of iterations. If 0, the number of iterations will be set as 10 times the number of nodes."
HTML_HELP_CLOSE(),
"0", false);
addInParameter<double> ("reqlength",
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "double" )
HTML_HELP_BODY()
"The required edge length."
HTML_HELP_CLOSE(),
"0.0", false);
}
~OGDFBertaultLayout() {}
void beforeCall() {
ogdf::BertaultLayout *bertault = static_cast<ogdf::BertaultLayout*>(ogdfLayoutAlgo);
if (dataSet != NULL) {
bool bval = false;
int ival = 0;
double val = 0;
if (dataSet->get("impred", bval))
bertault->setImpred(bval);
if (dataSet->get("iterno", ival))
bertault->iterno(ival);
if (dataSet->get("reqlength", val))
bertault->reqlength(val);
}
}
};
PLUGIN(OGDFBertaultLayout)
|
