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
|
/**
*
* This file is part of Tulip (https://tulip.labri.fr)
*
* 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 "BasicLayoutTest.h"
#include <tulip/Graph.h>
#include <tulip/LayoutProperty.h>
#include <tulip/SizeProperty.h>
#include <tulip/BooleanProperty.h>
#include <tulip/DoubleProperty.h>
using namespace std;
using namespace tlp;
CPPUNIT_TEST_SUITE_REGISTRATION(BasicLayoutTest);
void BasicLayoutTest::initializeGraph(const string &type) {
DataSet ds;
Graph *g = importGraph(type, ds, nullptr, graph);
CPPUNIT_ASSERT_EQUAL(g, graph);
}
//==========================================================
template <typename PropType>
bool BasicLayoutTest::computeProperty(const std::string &algorithm, const std::string &graphType,
PropType *prop) {
initializeGraph(graphType);
bool deleteProp = prop == nullptr;
if (prop == nullptr)
prop = new PropType(graph);
string errorMsg;
DataSet ds;
bool result = graph->applyPropertyAlgorithm(algorithm, prop, errorMsg);
if (deleteProp)
delete prop;
return result;
}
//==========================================================
void BasicLayoutTest::setUp() {
graph = tlp::newGraph();
}
void BasicLayoutTest::tearDown() {
delete graph;
}
void BasicLayoutTest::testBubbleTree() {
bool result = computeProperty<LayoutProperty>("Bubble Tree");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicLayoutTest::testCircular() {
bool result = computeProperty<LayoutProperty>("Circular");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicLayoutTest::testConeTreeExtended() {
bool result = computeProperty<LayoutProperty>("Cone Tree");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicLayoutTest::testConnectedComponentPacking() {
bool result = computeProperty<LayoutProperty>("Connected Components Packing");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicLayoutTest::testDendrogram() {
initializeGraph("Planar Graph");
DataSet ds;
SizeProperty size(graph);
ds.set("node size", &size);
LayoutProperty layout(graph);
string errorMsg;
bool result = graph->applyPropertyAlgorithm("Dendrogram", &layout, errorMsg, &ds);
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicLayoutTest::testGEMLayout() {
DataSet ds;
ds.set("file::filename", string("data/unconnected.tlp"));
Graph *g = importGraph("TLP Import", ds, nullptr, graph);
CPPUNIT_ASSERT(g == graph);
LayoutProperty prop(graph);
string errorMsg;
bool result = graph->applyPropertyAlgorithm("GEM (Frick)", &prop, errorMsg);
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicLayoutTest::testHierarchicalGraph() {
bool result = computeProperty<LayoutProperty>("Hierarchical Graph");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicLayoutTest::testImprovedWalker() {
bool result = computeProperty<LayoutProperty>("Improved Walker");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicLayoutTest::testMixedModel() {
initializeGraph("Planar Graph");
DataSet ds;
SizeProperty size(graph);
ds.set("node size", &size);
LayoutProperty layout(graph);
string errorMsg;
bool result = graph->applyPropertyAlgorithm("Mixed Model", &layout, errorMsg, &ds);
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicLayoutTest::testRandomLayout() {
bool result = computeProperty<LayoutProperty>("Random layout");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicLayoutTest::testSquarifiedTreeMap() {
initializeGraph("Random General Tree");
DoubleProperty metric(graph);
string errorMsg;
DataSet ds;
bool result = graph->applyPropertyAlgorithm("Degree", &metric, errorMsg);
CPPUNIT_ASSERT(result);
LayoutProperty layout(graph);
ds.set("metric", &metric);
result = graph->applyPropertyAlgorithm("Squarified Tree Map", &layout, errorMsg, &ds);
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicLayoutTest::testTreeLeaf() {
initializeGraph("Planar Graph");
DataSet ds;
SizeProperty size(graph);
ds.set("node size", &size);
LayoutProperty layout(graph);
string errorMsg;
bool result = graph->applyPropertyAlgorithm("Tree Leaf", &layout, errorMsg, &ds);
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicLayoutTest::testTreeMap() {}
//==========================================================
void BasicLayoutTest::testTreeRadial() {
bool result = computeProperty<LayoutProperty>("Tree Radial");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicLayoutTest::testTreeReingoldAndTilfordExtended() {
bool result = computeProperty<LayoutProperty>("Hierarchical Tree (R-T Extended)");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicLayoutTest::testTutte() {
bool result = computeProperty<LayoutProperty>("3-Connected (Tutte)", "Complete General Graph");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicLayoutTest::testKruskal() {
BooleanProperty selection(graph);
bool result = computeProperty<BooleanProperty>("Kruskal", "Planar Graph", &selection);
CPPUNIT_ASSERT(result);
for (auto n : graph->nodes()) {
CPPUNIT_ASSERT(selection.getNodeValue(n));
}
}
//==========================================================
void BasicLayoutTest::testFastOverlapRemoval() {
initializeGraph("Planar Graph");
DataSet ds;
LayoutProperty layout(graph);
ds.set("layout", &layout);
string errorMsg;
bool result = graph->applyPropertyAlgorithm("Fast Overlap Removal", &layout, errorMsg, &ds);
CPPUNIT_ASSERT(result);
}
|
