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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
|
#include <ogdf/layered/SugiyamaLayout.h>
#include <ogdf/layered/LongestPathRanking.h>
#include <ogdf/layered/OptimalRanking.h>
#include <ogdf/layered/BarycenterHeuristic.h>
#include <ogdf/layered/MedianHeuristic.h>
#include <ogdf/layered/SplitHeuristic.h>
#include <ogdf/layered/FastHierarchyLayout.h>
#include "tulip2ogdf/OGDFLayoutPluginBase.h"
namespace {
const char * paramHelp[] = { HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "int" )
HTML_HELP_BODY()
"Sets the option fails to nFails."
HTML_HELP_CLOSE(), HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "int" )
HTML_HELP_BODY()
"Sets the option runs to nRuns."
HTML_HELP_CLOSE(),
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "bool" )
HTML_HELP_BODY()
"Sets the option for transposing layout vertically ."
HTML_HELP_CLOSE(),
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "bool" )
HTML_HELP_BODY()
"Sets the options arrangeCCs."
HTML_HELP_CLOSE(),
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "double" )
HTML_HELP_BODY()
"The minimal distance between connected components."
HTML_HELP_CLOSE(),
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "double" )
HTML_HELP_BODY()
"The page ratio used for packing connected components."
HTML_HELP_CLOSE(),
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "bool" )
HTML_HELP_BODY()
"Sets the option alignBaseClasses."
HTML_HELP_CLOSE(),
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "bool" )
HTML_HELP_BODY()
"Sets the option alignSiblings."
HTML_HELP_CLOSE(),
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "StringCollection")
HTML_HELP_DEF("values", "<FONT COLOR=\"red\"> LongestPathRanking : <FONT COLOR=\"black\"> the well-known longest-path ranking algorithm. <BR> <FONT COLOR=\"red\"> OptimalRanking : <FONT COLOR=\"black\"> the LP-based algorithm for computing a node ranking with minimal edge lengths. <BR> <FONT COLOR=\"red\"> SplitHeuristic : <FONT COLOR=\"black\"> the split heuristic for 2-layer crossing minimization.")
HTML_HELP_DEF( "default", "LongestPathRanking " )
HTML_HELP_BODY()
"Sets the option for the node ranking (layer assignment)."
HTML_HELP_CLOSE(),
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "StringCollection")
HTML_HELP_DEF("values", "<FONT COLOR=\"red\"> BarycenterHeuristic : <FONT COLOR=\"black\"> the barycenter heuristic for 2-layer crossing minimization. <BR> <FONT COLOR=\"red\"> MedianHeuristic : <FONT COLOR=\"black\"> the median heuristic for 2-layer crossing minimization. <BR> <FONT COLOR=\"red\"> SplitHeuristic : <FONT COLOR=\"black\"> the split heuristic for 2-layer crossing minimization.")
HTML_HELP_DEF( "default", "BarycenterHeuristic " )
HTML_HELP_BODY()
"Sets the module option for the two-layer crossing minimization."
HTML_HELP_CLOSE()
};
}
#define ELT_RANKING "Ranking"
#define ELT_RANKINGLIST "LongestPathRanking;OptimalRanking"
#define ELT_LONGESTPATHRANKING 0
#define ELT_OPTIMALRANKING 1
#define ELT_TWOLAYERCROSS "Two-layer crossing minimization"
#define ELT_TWOLAYERCROSSLIST "BarycenterHeuristic;MedianHeuristic;SplitHeuristic"
#define ELT_BARYCENTER 0
#define ELT_MEDIAN 1
#define ELT_SPLIT 2
// comments below have been extracted from OGDF/src/layered/sugiyama.cpp
/** \addtogroup layout */
/*@{*/
/**
* Implementation of Sugiyama algorithm (classes Hierarchy,
* Level, SugiyamaLayout)
*
* \author Carsten Gutwenger
*
* \par License:
* This is part of the Open Graph Drawing Framework (OGDF).
*
* Copyright (C). All rights reserved.
* 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
* and appearing in the files LICENSE_GPL_v2.txt and
* LICENSE_GPL_v3.txt included in the packaging of this file.
*
* \par
* In addition, as a special exception, you have permission to link
* this software with the libraries of the COIN-OR Osi project
* (http://www.coin-or.org/projects/Osi.xml), all libraries required
* by Osi, and all LP-solver libraries directly supported by the
* COIN-OR Osi project, and distribute executables, as long as
* you follow the requirements of the GNU General Public License
* in regard to all of the software in the executable aside from these
* third-party libraries.
*
* \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 OGDFSugiyama : public OGDFLayoutPluginBase {
public:
OGDFSugiyama(const tlp::PropertyContext &context) :OGDFLayoutPluginBase(context, new ogdf::SugiyamaLayout()) {
addParameter<int>("fails", paramHelp[0], "4");
addParameter<int>("runs", paramHelp[1], "15");
addParameter<bool>("transpose", paramHelp[2], "false");
addParameter<bool>("arrangeCCs", paramHelp[3], "true");
addParameter<double>("minDistCC", paramHelp[4], "20");
addParameter<double>("pageRatio", paramHelp[5], "1.0");
addParameter<bool>("alignBaseClasses", paramHelp[6], "false");
addParameter<bool>("alignSiblings", paramHelp[7], "false");
addParameter<StringCollection>(ELT_RANKING, paramHelp[8], ELT_RANKINGLIST);
addParameter<StringCollection>(ELT_TWOLAYERCROSS, paramHelp[9], ELT_TWOLAYERCROSSLIST);
}
~OGDFSugiyama() {}
void beforeCall() {
ogdf::SugiyamaLayout *sugiyama = static_cast<ogdf::SugiyamaLayout*>(ogdfLayoutAlgo);
if (dataSet != 0) {
int ival = 0;
double dval = 0;
bool bval = false;
StringCollection sc;
if (dataSet->get("fails", ival))
sugiyama->fails(ival);
if (dataSet->get("runs", ival))
sugiyama->runs(ival);
if (dataSet->get("arrangeCCS", bval))
sugiyama->arrangeCCs(bval);
if (dataSet->get("minDistCC", dval))
sugiyama->minDistCC(dval);
if (dataSet->get("pageRatio", dval))
sugiyama->pageRatio(dval);
if (dataSet->get("alignBaseClasses", bval))
sugiyama->alignBaseClasses(bval);
if (dataSet->get("alignSiblings", bval))
sugiyama->alignSiblings(bval);
if (dataSet->get(ELT_RANKING, sc)) {
if (sc.getCurrent() == ELT_LONGESTPATHRANKING) {
sugiyama->setRanking(new ogdf::LongestPathRanking());
}
else {
sugiyama->setRanking(new ogdf::OptimalRanking());
}
}
if (dataSet->get(ELT_TWOLAYERCROSS, sc)) {
if (sc.getCurrent() == ELT_BARYCENTER) {
sugiyama->setCrossMin(new ogdf::BarycenterHeuristic());
}
else if (sc.getCurrent() == ELT_MEDIAN) {
sugiyama->setCrossMin(new ogdf::MedianHeuristic());
}
else {
sugiyama->setCrossMin(new ogdf::SplitHeuristic());
}
}
}
}
void afterCall() {
if (dataSet != 0) {
bool bval = false;
if (dataSet->get("transpose", bval)) {
if (bval) {
transposeLayoutVertically();
}
}
}
}
};
/*@}*/
LAYOUTPLUGINOFGROUP(OGDFSugiyama,"Sugiyama (OGDF)","Carsten Gutwenger","12/11/2007","Ok","1.4","Hierarchical");
|
