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
|
/**
*
* 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 "BasicMetricTest.h"
#include <tulip/DoubleProperty.h>
using namespace std;
using namespace tlp;
CPPUNIT_TEST_SUITE_REGISTRATION(BasicMetricTest);
template <typename PropType>
bool BasicMetricTest::computeProperty(const std::string &algorithm, const std::string &graphType,
PropType *prop, DataSet ds) {
tlp::Graph *g = tlp::importGraph(graphType, ds, nullptr, graph);
CPPUNIT_ASSERT(g == graph);
bool deleteProp = prop == nullptr;
if (prop == nullptr)
prop = new PropType(graph);
std::string errorMsg;
bool result = graph->applyPropertyAlgorithm(algorithm, prop, errorMsg);
if (deleteProp)
delete prop;
return result;
}
void BasicMetricTest::setUp() {
graph = tlp::newGraph();
}
void BasicMetricTest::tearDown() {
delete graph;
}
void BasicMetricTest::testArityMetric() {
bool result = computeProperty<DoubleProperty>("Degree");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicMetricTest::testNeighborhood() {
DataSet ds;
ds.set("directed", true);
bool result =
computeProperty<DoubleProperty>("Unique Neighbors", "Complete General Graph", nullptr, ds);
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicMetricTest::testBetweennessCentrality() {
bool result = computeProperty<DoubleProperty>("Betweenness Centrality");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicMetricTest::testBiconnectedComponent() {
bool result = computeProperty<DoubleProperty>("Biconnected Components");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicMetricTest::testClusterMetric() {
bool result = computeProperty<DoubleProperty>("Cluster");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicMetricTest::testConnectedComponent() {
bool result = computeProperty<DoubleProperty>("Connected Components");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicMetricTest::testDagLevelMetric() {
bool result = computeProperty<DoubleProperty>("Dag Level");
CPPUNIT_ASSERT(result == false);
graph->clear();
result = computeProperty<DoubleProperty>("Dag Level", "Random General Tree");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicMetricTest::testDepthMetric() {
bool result = computeProperty<DoubleProperty>("Depth");
CPPUNIT_ASSERT(result == false);
graph->clear();
result = computeProperty<DoubleProperty>("Depth", "Random General Tree");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicMetricTest::testEccentricity() {
bool result = computeProperty<DoubleProperty>("Eccentricity");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicMetricTest::testIdMetric() {
bool result = computeProperty<DoubleProperty>("Id");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicMetricTest::testLeafMetric() {
bool result = computeProperty<DoubleProperty>("Leaf");
CPPUNIT_ASSERT(result == false);
graph->clear();
result = computeProperty<DoubleProperty>("Leaf", "Random General Tree");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicMetricTest::testNodeMetric() {
bool result = computeProperty<DoubleProperty>("Node");
CPPUNIT_ASSERT(result == false);
graph->clear();
result = computeProperty<DoubleProperty>("Node", "Random General Tree");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicMetricTest::testPathLengthMetric() {
bool result = computeProperty<DoubleProperty>("Path Length");
CPPUNIT_ASSERT(result == false);
graph->clear();
result = computeProperty<DoubleProperty>("Path Length", "Random General Tree");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicMetricTest::testRandomMetric() {
bool result = computeProperty<DoubleProperty>("Random metric");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicMetricTest::testStrahlerMetric() {
bool result = computeProperty<DoubleProperty>("Strahler");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicMetricTest::testStrengthMetric() {
bool result = computeProperty<DoubleProperty>("Strength");
CPPUNIT_ASSERT(result);
}
//==========================================================
void BasicMetricTest::testStrongComponent() {
bool result = computeProperty<DoubleProperty>("Strongly Connected Components");
CPPUNIT_ASSERT(result);
}
//==========================================================
|
