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
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
|
/**
*
* 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 <tulip/ForEach.h>
#include <tulip/StringCollection.h>
#include "tulip2ogdf/OGDFLayoutPluginBase.h"
#include <ogdf/energybased/FMMMLayout.h>
using namespace std;
#define ELT_PAGEFORMAT "Page Format"
#define ELT_PAGEFORMATLIST "Square;Portrait;Landscape"
#define ELT_SQUARE 0
#define ELT_PORTRAIT 1
#define ELT_LANDSCAPE 2
#define ELT_QUALITYVSSPEED "Quality vs Speed"
#define ELT_QUALITYVSSPEEDLIST "BeautifulAndFast;NiceAndIncredibleSpeed;GorgeousAndEfficient"
#define ELT_BEAUTIFULANDFAST 0
#define ELT_NICEANDINCREDIBLESPEED 1
#define ELT_GORGEOUSANDEFFICIENT 2
#define ELT_EDGELENGTHMEASUREMENT "Edge Length Measurement"
#define ELT_EDGELENGTHMEASUREMENTLIST "BoundingCircle;Midpoint"
#define ELT_BOUNDINGCIRCLE 0
#define ELT_MIDPOINT 1
#define ELT_ALLOWEDPOSITIONS "Allowed Positions"
#define ELT_ALLOWEDPOSITIONSLIST "Integer;Exponent;All"
#define ELT_INTEGER 0
#define ELT_EXPONENT 1
#define ELT_ALL 2
#define ELT_TIPOVER "Tip Over"
#define ELT_TIPOVERLIST "NoGrowingRow;Always;None"
#define ELT_NOGROWINGROW 0
#define ELT_ALWAYS 1
#define ELT_NONE 2
#define ELT_PRESORT "Pre Sort"
#define ELT_PRESORTLIST "DecreasingHeight;DecreasingWidth;None;"
#define ELT_DECREASINGHEIGHT 0
#define ELT_DECREASINGWDTH 1
#define ELT_GALAXYCHOICE "Galaxy Choice"
#define ELT_GALAXYCHOICELIST "NonUniformProbLowerMass;NonUniformProbHigherMass;UniformProb"
#define ELT_NONUNIFORMPROBLOWERMASS 0
#define ELT_NONUNIFORMPROBHIGHERMASS 1
#define ELT_UNIFORMPROB 2
#define ELT_MAXITERCHANGE "Max Iter Change"
#define ELT_MAXITERCHANGELIST "LinearlyDecreasing;RapidlyDecreasing;Constant"
#define ELT_LINEARLYDECREASING 0
#define ELT_RAPIDLYDECREASING 1
#define ELT_CONSTANT 2
#define ELT_INITIALPLACEMENTMULT "Initial Placement Mult"
#define ELT_INITIALPLACEMENTMULTLIST "Advanced;Simple"
#define ELT_ADVANCED 0
#define ELT_SIMPLE 1
#define ELT_FORCEMODEL "Force Model"
#define ELT_FORCEMODELLIST "New;FruchtermanReingold;Eades"
#define ELT_NEW 0
#define ELT_FRUCHTERMANNREINGOLD 1
#define ELT_EADES 2
#define ELT_REPULSIVEFORCEMETHOD "Repulsive Force Method"
#define ELT_REPULSIVEFORCEMETHODLIST "NMM;Exact;GridApproximation"
#define ELT_NMM 0
#define ELT_EXACT 1
#define ELT_GRIDAPPROXIMATION 2
#define ELT_INITIALPLACEMENTFORCES "Initial Placement Forces"
#define ELT_INITIALPLACEMENTFORCESLIST "RandomRandIterNr;RandomTime;UniformGrid;KeepPositions"
#define ELT_RANDOMRANDITERNR 0
#define ELT_RANDOMTIME 1
#define ELT_UNIFORMGRID 2
#define ELT_KEEPPOSITIONS 3
#define ELT_REDUCEDTREECONSTRCUCTION "Reduced Tree Construction"
#define ELT_REDUCEDTREECONSTRCUCTIONLIST "SubtreeBySubtree;PathByPath"
#define ELT_SUBTREEBYSUBTREE 0
#define ELT_PATHBYPATH 1
#define ELT_SMALLESTCELLFINDING "Smallest Cell Finding"
#define ELT_SMALLESTCELLFINDINGLIST "Iteratively;Aluru"
#define ELT_ITERATIVELY 0
#define ELT_ALURU 1
// comments below have been extracted from OGDF/src/energybased/FMMMLayout.cpp
/** \addtogroup layout */
/**
* This is an implementation of Fast Multipole Multilevel Method (FM^3).
* \author Stefan Hachul
*
* \par License:
* This is part of the Open Graph Drawing Framework (OGDF).
* Copyright (C) 2005-2007
*
* \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 OGDFFm3: public OGDFLayoutPluginBase {
tlp::StringCollection stringCollection;
public:
PLUGININFORMATION("FM^3 (OGDF)", "Stephan Hachul", "09/11/2007", "Implements the FM³ layout algorithm by Hachul and Jünger. It is a multilevel, force-directed layout algorithm that can be applied to very large graphs.", "1.2" ,"Force Directed")
OGDFFm3(const tlp::PluginContext* context);
~OGDFFm3();
void beforeCall();
void callOGDFLayoutAlgorithm(ogdf::GraphAttributes &gAttributes);
};
/*Nom de la classe, Nom du plugins, nom de l'auteur,date de
creation,informations, release, groupe*/
PLUGIN(OGDFFm3)
OGDFFm3::OGDFFm3(const tlp::PluginContext* context) :
OGDFLayoutPluginBase(context, new ogdf::FMMMLayout()) {
addInParameter<NumericProperty*> ("Edge Length Property",
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "NumericProperty" )
HTML_HELP_BODY()
"A numeric property containing unit edge length to use."
HTML_HELP_CLOSE(),
"viewMetric", false);
addInParameter<SizeProperty> ("Node Size",
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "SizeProperty" )
HTML_HELP_BODY()
"The nodes size."
HTML_HELP_CLOSE(),
"viewSize", false);
addInParameter<double> ("Unit edge length",
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "double" )
HTML_HELP_BODY()
"The unit edge length."
HTML_HELP_CLOSE(),
"10.0", false);
addInParameter<bool> ("New initial placement",
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "bool" )
HTML_HELP_BODY()
"Indicates the initial placement before running algorithm."
HTML_HELP_CLOSE(),
"true");
addInParameter<int>("Fixed iterations",
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "int" )
HTML_HELP_BODY()
"The fixed number of iterations for the stop criterion."
HTML_HELP_CLOSE(),
"30");
addInParameter<double>("Threshold",
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "double" )
HTML_HELP_BODY()
"The threshold for the stop criterion."
HTML_HELP_CLOSE(),
"0.01");
addInParameter<StringCollection> (ELT_PAGEFORMAT,
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "String Collection" )
HTML_HELP_DEF("values", "- Portrait <i>(A4 portrait page)</i><br/>"
"- Landscape <i>(A4 landscape page)</i><br>"
"- Square <i>(Square format)</i>")
HTML_HELP_DEF( "default", "Square" )
HTML_HELP_BODY()
"Possible page formats."
HTML_HELP_CLOSE(),
ELT_PAGEFORMATLIST);
addInParameter<StringCollection> (ELT_QUALITYVSSPEED,
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "String Collection" )
HTML_HELP_DEF("values", "- GorgeousAndEfficient <i>(Best quality)</i><br/>"
"- BeautifulAndFast <i>(Medium quality and speed)</i><br/>"
"- NiceAndIncredibleSpeed <i>(Best speed</i>")
HTML_HELP_DEF( "default", "BeautifulAndFast" )
HTML_HELP_BODY()
"Trade-off between run-time and quality."
HTML_HELP_CLOSE(),
ELT_QUALITYVSSPEEDLIST);
addInParameter<StringCollection> (ELT_EDGELENGTHMEASUREMENT,
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "String Collection" )
HTML_HELP_DEF("values", "- Midpoint <i>(Measure from center point of edge end points)</i><br>"
"- BoundingCircle <i>(Measure from border of circle surrounding edge end points)</i>")
HTML_HELP_DEF( "default", "BoundingCircle" )
HTML_HELP_BODY()
"Specifies how the length of an edge is measured."
HTML_HELP_CLOSE(),
ELT_EDGELENGTHMEASUREMENTLIST);
addInParameter<StringCollection> (ELT_ALLOWEDPOSITIONS,
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "String Collection" )
HTML_HELP_DEF("values", "- All<br/>- Integer<br/>"
"- Exponent")
HTML_HELP_DEF( "default", "Integer" )
HTML_HELP_BODY()
"Specifies which positions for a node are allowed."
HTML_HELP_CLOSE(),
ELT_ALLOWEDPOSITIONSLIST);
addInParameter<StringCollection> (ELT_TIPOVER,
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "String Collection" )
HTML_HELP_DEF("values", "- None<br/>- NoGrowingRow<br/>"
"- Always")
HTML_HELP_DEF( "default", "NoGrowingRow" )
HTML_HELP_BODY()
"Specifies in which case it is allowed to tip over drawings of connected components."
HTML_HELP_CLOSE(),
ELT_TIPOVERLIST);
addInParameter<StringCollection> (ELT_PRESORT,
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "String Collection" )
HTML_HELP_DEF("values", "- None <i>(Do not presort)</i><br/>"
"- DecreasingHeight <i>(Presort by decreasing height of components)</i><br/>"
"- DecreasingWidth <i>(Presort by decreasing width of components)</i>")
HTML_HELP_DEF( "default", "DecreasingHeight" )
HTML_HELP_BODY()
"Specifies how connected components are sorted before the packing algorithm is applied."
HTML_HELP_CLOSE(),
ELT_PRESORTLIST);
addInParameter<StringCollection> (ELT_GALAXYCHOICE,
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "String Collection" )
HTML_HELP_DEF("values", "-UniformProb<br>"
"- NonUniformProbLowerMass<br/>"
"- NonUniformProbHigherMass")
HTML_HELP_DEF( "default", "NonUniformProbLowerMass" )
HTML_HELP_BODY()
"Specifies how sun nodes of galaxies are selected. "
HTML_HELP_CLOSE(),
ELT_GALAXYCHOICELIST);
addInParameter<StringCollection> (ELT_MAXITERCHANGE,
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "String Collection" )
HTML_HELP_DEF("values", "- Constant<br/>"
"- LinearlyDecreasing<br/>"
"- RapidlyDecreasing")
HTML_HELP_DEF( "default", "LinearlyDecreasing" )
HTML_HELP_BODY()
"Specifies how MaxIterations is changed in subsequent multilevels. "
HTML_HELP_CLOSE(),
ELT_MAXITERCHANGELIST);
addInParameter<StringCollection> (ELT_INITIALPLACEMENTMULT,
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "String Collection" )
HTML_HELP_DEF("values", "- Simple<br/>"
"- Advanced")
HTML_HELP_DEF( "default", "Advanced" )
HTML_HELP_BODY()
"Specifies how the initial placement is generated."
HTML_HELP_CLOSE(),
ELT_INITIALPLACEMENTMULTLIST);
addInParameter<StringCollection> (ELT_FORCEMODEL,
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "String Collection" )
HTML_HELP_DEF("values", "- FruchtermanReingold <i>(The force-model by Fruchterman, Reingold)</i><br/>"
"- Eades <i>(The force-model by Eades)</i><br/>"
"- New <i>(The new force-model)</i>")
HTML_HELP_DEF( "default", "New" )
HTML_HELP_BODY()
"Specifies the force model. "
HTML_HELP_CLOSE(),
ELT_FORCEMODELLIST);
addInParameter<StringCollection> (ELT_REPULSIVEFORCEMETHOD,
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "String Collection" )
HTML_HELP_DEF("values", "- Exact <i>(Exact calculation)</i><br/>"
"- GridApproximation <i>(Grid approximation)</i><br/>"
"- NMM <i>(Calculation as for new multipole method)</i>")
HTML_HELP_DEF( "default", "NMM" )
HTML_HELP_BODY()
"Specifies how to calculate repulsive forces."
HTML_HELP_CLOSE(),
ELT_REPULSIVEFORCEMETHODLIST);
addInParameter<StringCollection> (ELT_INITIALPLACEMENTFORCES,
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "String Collection" )
HTML_HELP_DEF("values", "- UniformGrid <i>(Uniform placement on a grid)</i><br/>"
"- RandomTime <i>(Random placement, based on current time)</i><br/>"
"- RandomRandIterNr <i>(Random placement, based on randIterNr())</i><br/>"
"- KeepPositions <i>(No change in placement)</i>")
HTML_HELP_DEF( "default", "RandomRandIterNr" )
HTML_HELP_BODY()
"Specifies how the initial placement is done. "
HTML_HELP_CLOSE(),
ELT_INITIALPLACEMENTFORCESLIST);
addInParameter<StringCollection> (ELT_REDUCEDTREECONSTRCUCTION,
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "String Collection" )
HTML_HELP_DEF("values", "- PathByPath<br/>"
"- SubtreeBySubtree")
HTML_HELP_DEF( "default", "Advanced" )
HTML_HELP_BODY()
"Specifies how the reduced bucket quadtree is constructed."
HTML_HELP_CLOSE(),
ELT_REDUCEDTREECONSTRCUCTIONLIST);
addInParameter<StringCollection> (ELT_SMALLESTCELLFINDING,
HTML_HELP_OPEN()
HTML_HELP_DEF( "type", "String Collection" )
HTML_HELP_DEF("values", "- Iteratively <i>(Iteratively, in constant time)</i><br/>"
"- Aluru <i>(According to formula by Aluru et al., in constant time)</i>")
HTML_HELP_DEF( "default", "Advanced" )
HTML_HELP_BODY()
"Specifies how to calculate the smallest quadratic cell surrounding particles of a node in the reduced bucket quadtree."
HTML_HELP_CLOSE(),
ELT_SMALLESTCELLFINDINGLIST);
}
OGDFFm3::~OGDFFm3() {
}
void OGDFFm3::beforeCall() {
ogdf::FMMMLayout *fmmm = static_cast<ogdf::FMMMLayout*> (ogdfLayoutAlgo);
if (dataSet != 0) {
fmmm->useHighLevelOptions(true);
SizeProperty * size = NULL;
if (dataSet->get("Node Size", size))
tlpToOGDF->copyTlpNodeSizeToOGDF(size);
double edgeLenth = 10;
if (dataSet->get("Unit edge length", edgeLenth))
fmmm->unitEdgeLength(edgeLenth);
bool bval = false;
if (dataSet->get("New initial placement", bval)) {
fmmm->newInitialPlacement(bval);
}
int ival = 0;
if (dataSet->get("Fixed iterations", ival)) {
fmmm->fixedIterations(ival);
}
double dval = 0;
if (dataSet->get("Threshold", dval)) {
fmmm->threshold(dval);
}
if (dataSet->get(ELT_PAGEFORMAT, stringCollection)) {
if (stringCollection.getCurrent() == ELT_PORTRAIT) {
fmmm->pageFormat(ogdf::FMMMLayout::pfPortrait);
}
else if (stringCollection.getCurrent() == ELT_LANDSCAPE) {
fmmm->pageFormat(ogdf::FMMMLayout::pfLandscape);
}
else {
fmmm->pageFormat(ogdf::FMMMLayout::pfSquare);
}
}
if (dataSet->get(ELT_QUALITYVSSPEED, stringCollection)) {
if (stringCollection.getCurrent() == ELT_NICEANDINCREDIBLESPEED) {
fmmm->qualityVersusSpeed(
ogdf::FMMMLayout::qvsNiceAndIncredibleSpeed);
}
else if (stringCollection.getCurrent() == ELT_GORGEOUSANDEFFICIENT) {
fmmm->qualityVersusSpeed(ogdf::FMMMLayout::qvsGorgeousAndEfficient);
}
else {
fmmm->qualityVersusSpeed(ogdf::FMMMLayout::qvsBeautifulAndFast);
}
}
if (dataSet->get(ELT_EDGELENGTHMEASUREMENT, stringCollection)) {
if (stringCollection.getCurrent() == ELT_BOUNDINGCIRCLE) {
fmmm->edgeLengthMeasurement(ogdf::FMMMLayout::elmBoundingCircle);
}
else {
fmmm->edgeLengthMeasurement(ogdf::FMMMLayout::elmMidpoint);
}
}
if (dataSet->get(ELT_ALLOWEDPOSITIONS, stringCollection)) {
if (stringCollection.getCurrent() == ELT_INTEGER) {
fmmm->allowedPositions(ogdf::FMMMLayout::apInteger);
}
else if (stringCollection.getCurrent() == ELT_EXPONENT) {
fmmm->allowedPositions(ogdf::FMMMLayout::apExponent);
}
else {
fmmm->allowedPositions(ogdf::FMMMLayout::apAll);
}
}
if (dataSet->get(ELT_TIPOVER, stringCollection)) {
if (stringCollection.getCurrent() == ELT_NONE) {
fmmm->tipOverCCs(ogdf::FMMMLayout::toNone);
}
else if (stringCollection.getCurrent() == ELT_NOGROWINGROW) {
fmmm->tipOverCCs(ogdf::FMMMLayout::toNoGrowingRow);
}
else {
fmmm->tipOverCCs(ogdf::FMMMLayout::toAlways);
}
}
if (dataSet->get(ELT_PRESORT, stringCollection)) {
if (stringCollection.getCurrent() == ELT_NONE) {
fmmm->presortCCs(ogdf::FMMMLayout::psNone);
}
else if (stringCollection.getCurrent() == ELT_DECREASINGHEIGHT) {
fmmm->presortCCs(ogdf::FMMMLayout::psDecreasingHeight);
}
else {
fmmm->presortCCs(ogdf::FMMMLayout::psDecreasingWidth);
}
}
if (dataSet->get(ELT_GALAXYCHOICE, stringCollection)) {
if (stringCollection.getCurrent() == ELT_UNIFORMPROB) {
fmmm->galaxyChoice(ogdf::FMMMLayout::gcUniformProb);
}
else if (stringCollection.getCurrent() == ELT_NONUNIFORMPROBLOWERMASS) {
fmmm->galaxyChoice(ogdf::FMMMLayout::gcNonUniformProbLowerMass);
}
else {
fmmm->galaxyChoice(ogdf::FMMMLayout::gcNonUniformProbHigherMass);
}
}
if (dataSet->get(ELT_MAXITERCHANGE, stringCollection)) {
if (stringCollection.getCurrent() == ELT_CONSTANT) {
fmmm->maxIterChange(ogdf::FMMMLayout::micConstant);
}
else if (stringCollection.getCurrent() == ELT_LINEARLYDECREASING) {
fmmm->maxIterChange(ogdf::FMMMLayout::micLinearlyDecreasing);
}
else {
fmmm->maxIterChange(ogdf::FMMMLayout::micRapidlyDecreasing);
}
}
if (dataSet->get(ELT_INITIALPLACEMENTMULT, stringCollection)) {
if (stringCollection.getCurrent() == ELT_ADVANCED) {
fmmm->initialPlacementMult(ogdf::FMMMLayout::ipmAdvanced);
}
else {
fmmm->initialPlacementMult(ogdf::FMMMLayout::ipmSimple);
}
}
if (dataSet->get(ELT_FORCEMODEL, stringCollection)) {
if (stringCollection.getCurrent() == ELT_FRUCHTERMANNREINGOLD) {
fmmm->forceModel(ogdf::FMMMLayout::fmFruchtermanReingold);
}
else if (stringCollection.getCurrent() == ELT_EADES) {
fmmm->forceModel(ogdf::FMMMLayout::fmEades);
}
else {
fmmm->forceModel(ogdf::FMMMLayout::fmNew);
}
}
if (dataSet->get(ELT_REPULSIVEFORCEMETHOD, stringCollection)) {
if (stringCollection.getCurrent() == ELT_EXACT) {
fmmm->repulsiveForcesCalculation(ogdf::FMMMLayout::rfcExact);
}
else if (stringCollection.getCurrent() == ELT_GRIDAPPROXIMATION) {
fmmm->repulsiveForcesCalculation(
ogdf::FMMMLayout::rfcGridApproximation);
}
else {
fmmm->repulsiveForcesCalculation(ogdf::FMMMLayout::rfcNMM);
}
}
if (dataSet->get(ELT_INITIALPLACEMENTFORCES, stringCollection)) {
if (stringCollection.getCurrent() == ELT_UNIFORMGRID) {
fmmm->initialPlacementForces(ogdf::FMMMLayout::ipfUniformGrid);
}
else if (stringCollection.getCurrent() == ELT_RANDOMTIME) {
fmmm->initialPlacementForces(ogdf::FMMMLayout::ipfRandomTime);
}
else if (stringCollection.getCurrent() == ELT_RANDOMRANDITERNR) {
fmmm->initialPlacementForces(ogdf::FMMMLayout::ipfRandomRandIterNr);
}
else {
fmmm->initialPlacementForces(ogdf::FMMMLayout::ipfKeepPositions);
}
}
if (dataSet->get(ELT_REDUCEDTREECONSTRCUCTION, stringCollection)) {
if (stringCollection.getCurrent() == ELT_SUBTREEBYSUBTREE) {
fmmm->nmTreeConstruction(ogdf::FMMMLayout::rtcSubtreeBySubtree);
}
else {
fmmm->nmTreeConstruction(ogdf::FMMMLayout::rtcPathByPath);
}
}
if (dataSet->get(ELT_SMALLESTCELLFINDING, stringCollection)) {
if (stringCollection.getCurrent() == ELT_ITERATIVELY) {
fmmm->nmSmallCell(ogdf::FMMMLayout::scfIteratively);
}
else {
fmmm->nmSmallCell(ogdf::FMMMLayout::scfAluru);
}
}
}
}
void OGDFFm3::callOGDFLayoutAlgorithm(ogdf::GraphAttributes &gAttributes) {
ogdf::FMMMLayout *fmmm = static_cast<ogdf::FMMMLayout*> (ogdfLayoutAlgo);
NumericProperty *length = NULL;
if (dataSet->get("Edge Length Property", length) && length) {
EdgeArray<double> edgeLength(tlpToOGDF->getOGDFGraph());
tlp::edge e;
forEach(e, graph->getEdges()) {
edgeLength[tlpToOGDF->getOGDFGraphEdge(e.id)] =
length->getEdgeDoubleValue(e);
}
fmmm->call(gAttributes, edgeLength);
}
else {
OGDFLayoutPluginBase::callOGDFLayoutAlgorithm(gAttributes);
}
}
|
