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
|
/* This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
* See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
* Author(s): Vincent Rouvreau
*
* Copyright (C) 2014 Inria
*
* Modification(s):
* - YYYY/MM Author: Description of the modification
*/
#include <iostream>
#include <fstream>
#include <string>
#include <algorithm>
#include <utility> // std::pair, std::make_pair
#include <cmath> // float comparison
#include <limits>
#include <functional> // greater
#define BOOST_TEST_DYN_LINK
#define BOOST_TEST_MODULE "simplex_tree"
#include <boost/test/unit_test.hpp>
#include <boost/mpl/list.hpp>
// ^
// /!\ Nothing else from Simplex_tree shall be included to test includes are well defined.
#include "gudhi/Simplex_tree.h"
using namespace Gudhi;
typedef boost::mpl::list<Simplex_tree<>, Simplex_tree<Simplex_tree_options_fast_persistence>> list_of_tested_variants;
bool AreAlmostTheSame(float a, float b) {
return std::fabs(a - b) < std::numeric_limits<float>::epsilon();
}
BOOST_AUTO_TEST_CASE_TEMPLATE(simplex_tree_expansion_with_blockers_3, typeST, list_of_tested_variants) {
using Simplex_handle = typename typeST::Simplex_handle;
// Construct the Simplex Tree with a 1-skeleton graph example
typeST simplex_tree;
simplex_tree.insert_simplex({0, 1}, 0.);
simplex_tree.insert_simplex({0, 2}, 1.);
simplex_tree.insert_simplex({0, 3}, 2.);
simplex_tree.insert_simplex({1, 2}, 3.);
simplex_tree.insert_simplex({1, 3}, 4.);
simplex_tree.insert_simplex({2, 3}, 5.);
simplex_tree.insert_simplex({2, 4}, 6.);
simplex_tree.insert_simplex({3, 6}, 7.);
simplex_tree.insert_simplex({4, 5}, 8.);
simplex_tree.insert_simplex({4, 6}, 9.);
simplex_tree.insert_simplex({5, 6}, 10.);
simplex_tree.insert_simplex({6}, 10.);
simplex_tree.expansion_with_blockers(3, [&](Simplex_handle sh){
bool result = false;
std::cout << "Blocker on [";
// User can loop on the vertices from the given simplex_handle i.e.
for (auto vertex : simplex_tree.simplex_vertex_range(sh)) {
// We block the expansion, if the vertex '6' is in the given list of vertices
if (vertex == 6)
result = true;
std::cout << vertex << ", ";
}
std::cout << "] ( " << simplex_tree.filtration(sh);
// User can re-assign a new filtration value directly in the blocker (default is the maximal value of boudaries)
simplex_tree.assign_filtration(sh, simplex_tree.filtration(sh) + 1.);
std::cout << " + 1. ) = " << result << std::endl;
return result;
});
std::cout << "********************************************************************\n";
std::cout << "simplex_tree_expansion_with_blockers_3\n";
std::cout << "********************************************************************\n";
std::cout << "* The complex contains " << simplex_tree.num_simplices() << " simplices";
std::cout << " - dimension " << simplex_tree.dimension() << "\n";
std::cout << "* Iterator on Simplices in the filtration, with [filtration value]:\n";
for (auto f_simplex : simplex_tree.filtration_simplex_range()) {
std::cout << " " << "[" << simplex_tree.filtration(f_simplex) << "] ";
for (auto vertex : simplex_tree.simplex_vertex_range(f_simplex))
std::cout << "(" << vertex << ")";
std::cout << std::endl;
}
BOOST_CHECK(simplex_tree.num_simplices() == 23);
BOOST_CHECK(simplex_tree.dimension() == 3);
// {4, 5, 6} shall be blocked
BOOST_CHECK(simplex_tree.find({4, 5, 6}) == simplex_tree.null_simplex());
BOOST_CHECK(AreAlmostTheSame(simplex_tree.filtration(simplex_tree.find({0,1,2})), 4.));
BOOST_CHECK(AreAlmostTheSame(simplex_tree.filtration(simplex_tree.find({0,1,3})), 5.));
BOOST_CHECK(AreAlmostTheSame(simplex_tree.filtration(simplex_tree.find({0,2,3})), 6.));
BOOST_CHECK(AreAlmostTheSame(simplex_tree.filtration(simplex_tree.find({1,2,3})), 6.));
BOOST_CHECK(AreAlmostTheSame(simplex_tree.filtration(simplex_tree.find({0,1,2,3})), 7.));
}
BOOST_AUTO_TEST_CASE_TEMPLATE(simplex_tree_expansion_with_blockers_2, typeST, list_of_tested_variants) {
using Simplex_handle = typename typeST::Simplex_handle;
// Construct the Simplex Tree with a 1-skeleton graph example
typeST simplex_tree;
simplex_tree.insert_simplex({0, 1}, 0.);
simplex_tree.insert_simplex({0, 2}, 1.);
simplex_tree.insert_simplex({0, 3}, 2.);
simplex_tree.insert_simplex({1, 2}, 3.);
simplex_tree.insert_simplex({1, 3}, 4.);
simplex_tree.insert_simplex({2, 3}, 5.);
simplex_tree.insert_simplex({2, 4}, 6.);
simplex_tree.insert_simplex({3, 6}, 7.);
simplex_tree.insert_simplex({4, 5}, 8.);
simplex_tree.insert_simplex({4, 6}, 9.);
simplex_tree.insert_simplex({5, 6}, 10.);
simplex_tree.insert_simplex({6}, 10.);
simplex_tree.expansion_with_blockers(2, [&](Simplex_handle sh){
bool result = false;
std::cout << "Blocker on [";
// User can loop on the vertices from the given simplex_handle i.e.
for (auto vertex : simplex_tree.simplex_vertex_range(sh)) {
// We block the expansion, if the vertex '6' is in the given list of vertices
if (vertex == 6)
result = true;
std::cout << vertex << ", ";
}
std::cout << "] ( " << simplex_tree.filtration(sh);
// User can re-assign a new filtration value directly in the blocker (default is the maximal value of boudaries)
simplex_tree.assign_filtration(sh, simplex_tree.filtration(sh) + 1.);
std::cout << " + 1. ) = " << result << std::endl;
return result;
});
std::cout << "********************************************************************\n";
std::cout << "simplex_tree_expansion_with_blockers_2\n";
std::cout << "********************************************************************\n";
std::cout << "* The complex contains " << simplex_tree.num_simplices() << " simplices";
std::cout << " - dimension " << simplex_tree.dimension() << "\n";
std::cout << "* Iterator on Simplices in the filtration, with [filtration value]:\n";
for (auto f_simplex : simplex_tree.filtration_simplex_range()) {
std::cout << " " << "[" << simplex_tree.filtration(f_simplex) << "] ";
for (auto vertex : simplex_tree.simplex_vertex_range(f_simplex))
std::cout << "(" << vertex << ")";
std::cout << std::endl;
}
BOOST_CHECK(simplex_tree.num_simplices() == 22);
BOOST_CHECK(simplex_tree.dimension() == 2);
// {4, 5, 6} shall be blocked
BOOST_CHECK(simplex_tree.find({4, 5, 6}) == simplex_tree.null_simplex());
BOOST_CHECK(AreAlmostTheSame(simplex_tree.filtration(simplex_tree.find({0,1,2})), 4.));
BOOST_CHECK(AreAlmostTheSame(simplex_tree.filtration(simplex_tree.find({0,1,3})), 5.));
BOOST_CHECK(AreAlmostTheSame(simplex_tree.filtration(simplex_tree.find({0,2,3})), 6.));
BOOST_CHECK(AreAlmostTheSame(simplex_tree.filtration(simplex_tree.find({1,2,3})), 6.));
BOOST_CHECK(simplex_tree.find({0,1,2,3}) == simplex_tree.null_simplex());
}
BOOST_AUTO_TEST_CASE_TEMPLATE(simplex_tree_expansion, typeST, list_of_tested_variants) {
// Construct the Simplex Tree with a 1-skeleton graph example
typeST simplex_tree;
simplex_tree.insert_simplex({0, 1}, 0.);
simplex_tree.insert_simplex({0, 2}, 1.);
simplex_tree.insert_simplex({0, 3}, 2.);
simplex_tree.insert_simplex({1, 2}, 3.);
simplex_tree.insert_simplex({1, 3}, 4.);
simplex_tree.insert_simplex({2, 3}, 5.);
simplex_tree.insert_simplex({2, 4}, 6.);
simplex_tree.insert_simplex({3, 6}, 7.);
simplex_tree.insert_simplex({4, 5}, 8.);
simplex_tree.insert_simplex({4, 6}, 9.);
simplex_tree.insert_simplex({5, 6}, 10.);
simplex_tree.insert_simplex({6}, 10.);
simplex_tree.expansion(3);
std::cout << "********************************************************************\n";
std::cout << "simplex_tree_expansion_3\n";
std::cout << "********************************************************************\n";
std::cout << "* The complex contains " << simplex_tree.num_simplices() << " simplices";
std::cout << " - dimension " << simplex_tree.dimension() << "\n";
std::cout << "* Iterator on Simplices in the filtration, with [filtration value]:\n";
for (auto f_simplex : simplex_tree.filtration_simplex_range()) {
std::cout << " " << "[" << simplex_tree.filtration(f_simplex) << "] ";
for (auto vertex : simplex_tree.simplex_vertex_range(f_simplex))
std::cout << "(" << vertex << ")";
std::cout << std::endl;
}
BOOST_CHECK(simplex_tree.num_simplices() == 24);
BOOST_CHECK(simplex_tree.dimension() == 3);
BOOST_CHECK(AreAlmostTheSame(simplex_tree.filtration(simplex_tree.find({4,5,6})), 10.));
BOOST_CHECK(AreAlmostTheSame(simplex_tree.filtration(simplex_tree.find({0,1,2})), 3.));
BOOST_CHECK(AreAlmostTheSame(simplex_tree.filtration(simplex_tree.find({0,1,3})), 4.));
BOOST_CHECK(AreAlmostTheSame(simplex_tree.filtration(simplex_tree.find({0,2,3})), 5.));
BOOST_CHECK(AreAlmostTheSame(simplex_tree.filtration(simplex_tree.find({1,2,3})), 5.));
BOOST_CHECK(AreAlmostTheSame(simplex_tree.filtration(simplex_tree.find({0,1,2,3})), 5.));
}
BOOST_AUTO_TEST_CASE_TEMPLATE(simplex_tree_expansion_2, typeST, list_of_tested_variants) {
// Construct the Simplex Tree with a 1-skeleton graph example
typeST simplex_tree;
simplex_tree.insert_simplex({0, 1}, 0.);
simplex_tree.insert_simplex({0, 2}, 1.);
simplex_tree.insert_simplex({0, 3}, 2.);
simplex_tree.insert_simplex({1, 2}, 3.);
simplex_tree.insert_simplex({1, 3}, 4.);
simplex_tree.insert_simplex({2, 3}, 5.);
simplex_tree.insert_simplex({2, 4}, 6.);
simplex_tree.insert_simplex({3, 6}, 7.);
simplex_tree.insert_simplex({4, 5}, 8.);
simplex_tree.insert_simplex({4, 6}, 9.);
simplex_tree.insert_simplex({5, 6}, 10.);
simplex_tree.insert_simplex({6}, 10.);
simplex_tree.expansion(2);
std::cout << "********************************************************************\n";
std::cout << "simplex_tree_expansion_2\n";
std::cout << "********************************************************************\n";
std::cout << "* The complex contains " << simplex_tree.num_simplices() << " simplices";
std::cout << " - dimension " << simplex_tree.dimension() << "\n";
std::cout << "* Iterator on Simplices in the filtration, with [filtration value]:\n";
for (auto f_simplex : simplex_tree.filtration_simplex_range()) {
std::cout << " " << "[" << simplex_tree.filtration(f_simplex) << "] ";
for (auto vertex : simplex_tree.simplex_vertex_range(f_simplex))
std::cout << "(" << vertex << ")";
std::cout << std::endl;
}
BOOST_CHECK(simplex_tree.num_simplices() == 23);
BOOST_CHECK(simplex_tree.dimension() == 2);
BOOST_CHECK(AreAlmostTheSame(simplex_tree.filtration(simplex_tree.find({4,5,6})), 10.));
BOOST_CHECK(AreAlmostTheSame(simplex_tree.filtration(simplex_tree.find({0,1,2})), 3.));
BOOST_CHECK(AreAlmostTheSame(simplex_tree.filtration(simplex_tree.find({0,1,3})), 4.));
BOOST_CHECK(AreAlmostTheSame(simplex_tree.filtration(simplex_tree.find({0,2,3})), 5.));
BOOST_CHECK(AreAlmostTheSame(simplex_tree.filtration(simplex_tree.find({1,2,3})), 5.));
BOOST_CHECK(simplex_tree.find({0,1,2,3}) == simplex_tree.null_simplex());
}
|
