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
|
/* 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>
#define BOOST_TEST_DYN_LINK
#define BOOST_TEST_MODULE "simplex_tree_remove"
#include <boost/test/unit_test.hpp>
// ^
// /!\ Nothing else from Simplex_tree shall be included to test includes are well defined.
#include "gudhi/Simplex_tree.h"
using namespace Gudhi;
struct MyOptions : Simplex_tree_options_full_featured {
// Not doing persistence, so we don't need those
static const bool store_key = false;
static const bool store_filtration = false;
// I have few vertices
typedef short Vertex_handle;
};
using Mini_stree = Simplex_tree<MyOptions>;
using Stree = Simplex_tree<>;
BOOST_AUTO_TEST_CASE(remove_maximal_simplex) {
std::clog << "********************************************************************" << std::endl;
std::clog << "REMOVE MAXIMAL SIMPLEX" << std::endl;
Mini_stree st;
st.insert_simplex_and_subfaces({0, 1, 6, 7});
st.insert_simplex_and_subfaces({3, 4, 5});
// Constructs a copy at this state for further test purpose
Mini_stree st_pruned = st;
st.insert_simplex_and_subfaces({3, 0});
st.insert_simplex_and_subfaces({2, 1, 0});
// Constructs a copy at this state for further test purpose
Mini_stree st_complete = st;
// st_complete and st:
// 1 6
// o---o
// /X\7/
// o---o---o---o
// 2 0 3\X/4
// o
// 5
// st_pruned:
// 1 6
// o---o
// \7/
// o o---o
// 0 3\X/4
// o
// 5
#ifdef GUDHI_DEBUG
std::clog << "Check exception throw in debug mode" << std::endl;
// throw excpt because sh has children
BOOST_CHECK_THROW (st.remove_maximal_simplex(st.find({0, 1, 6})), std::invalid_argument);
BOOST_CHECK_THROW (st.remove_maximal_simplex(st.find({3})), std::invalid_argument);
BOOST_CHECK(st == st_complete);
#endif
std::clog << "st.remove_maximal_simplex({0, 2})" << std::endl;
st.remove_maximal_simplex(st.find({0, 2}));
std::clog << "st.remove_maximal_simplex({0, 1, 2})" << std::endl;
st.remove_maximal_simplex(st.find({0, 1, 2}));
std::clog << "st.remove_maximal_simplex({1, 2})" << std::endl;
st.remove_maximal_simplex(st.find({1, 2}));
std::clog << "st.remove_maximal_simplex({2})" << std::endl;
st.remove_maximal_simplex(st.find({2}));
std::clog << "st.remove_maximal_simplex({3})" << std::endl;
st.remove_maximal_simplex(st.find({0, 3}));
BOOST_CHECK(st == st_pruned);
// Remove all, but as the simplex tree is not storing filtration, there is no modification
st.prune_above_filtration(0.0);
BOOST_CHECK(st == st_pruned);
Mini_stree st_wo_seven;
st_wo_seven.insert_simplex_and_subfaces({0, 1, 6});
st_wo_seven.insert_simplex_and_subfaces({3, 4, 5});
// st_wo_seven:
// 1 6
// o---o
// \X/
// o o---o
// 0 3\X/4
// o
// 5
// Remove all 7 to test the both remove_maximal_simplex cases (when _members is empty or not)
std::clog << "st.remove_maximal_simplex({0, 1, 6, 7})" << std::endl;
st.remove_maximal_simplex(st.find({0, 1, 6, 7}));
std::clog << "st.remove_maximal_simplex({0, 1, 7})" << std::endl;
st.remove_maximal_simplex(st.find({0, 1, 7}));
std::clog << "st.remove_maximal_simplex({0, 6, 7})" << std::endl;
st.remove_maximal_simplex(st.find({0, 6, 7}));
std::clog << "st.remove_maximal_simplex({0, 7})" << std::endl;
st.remove_maximal_simplex(st.find({0, 7}));
std::clog << "st.remove_maximal_simplex({1, 6, 7})" << std::endl;
st.remove_maximal_simplex(st.find({1, 6, 7}));
std::clog << "st.remove_maximal_simplex({1, 7})" << std::endl;
st.remove_maximal_simplex(st.find({1, 7}));
std::clog << "st.remove_maximal_simplex({6, 7})" << std::endl;
st.remove_maximal_simplex(st.find({6, 7}));
std::clog << "st.remove_maximal_simplex({7})" << std::endl;
st.remove_maximal_simplex(st.find({7}));
std::clog << "st.upper_bound_dimension()=" << st.upper_bound_dimension() << std::endl;
BOOST_CHECK(st.upper_bound_dimension() == 3);
// Check dimension calls lower_upper_bound_dimension to recompute dimension
BOOST_CHECK(st.dimension() == 2);
BOOST_CHECK(st.upper_bound_dimension() == 2);
std::clog << "st.upper_bound_dimension()=" << st.upper_bound_dimension()
<< " | st_wo_seven.upper_bound_dimension()=" << st_wo_seven.upper_bound_dimension() << std::endl;
std::clog << "st.dimension()=" << st.dimension() << " | st_wo_seven.dimension()=" << st_wo_seven.dimension() << std::endl;
BOOST_CHECK(st == st_wo_seven);
}
BOOST_AUTO_TEST_CASE(auto_dimension_set) {
std::clog << "********************************************************************" << std::endl;
std::clog << "DIMENSION ON REMOVE MAXIMAL SIMPLEX" << std::endl;
Mini_stree st;
st.insert_simplex_and_subfaces({0, 1, 2});
st.insert_simplex_and_subfaces({0, 1, 3});
st.insert_simplex_and_subfaces({1, 2, 3, 4});
st.insert_simplex_and_subfaces({1, 2, 3, 5});
st.insert_simplex_and_subfaces({6, 7, 8, 9});
st.insert_simplex_and_subfaces({6, 7, 8, 10});
BOOST_CHECK(st.upper_bound_dimension() == 3);
BOOST_CHECK(st.dimension() == 3);
std::clog << "st.remove_maximal_simplex({6, 7, 8, 10})" << std::endl;
st.remove_maximal_simplex(st.find({6, 7, 8, 10}));
std::clog << "st.upper_bound_dimension()=" << st.upper_bound_dimension() << std::endl;
BOOST_CHECK(st.upper_bound_dimension() == 3);
BOOST_CHECK(st.dimension() == 3);
std::clog << "st.remove_maximal_simplex({6, 7, 8, 9})" << std::endl;
st.remove_maximal_simplex(st.find({6, 7, 8, 9}));
std::clog << "st.upper_bound_dimension()=" << st.upper_bound_dimension() << std::endl;
BOOST_CHECK(st.upper_bound_dimension() == 3);
BOOST_CHECK(st.dimension() == 3);
std::clog << "st.remove_maximal_simplex({1, 2, 3, 4})" << std::endl;
st.remove_maximal_simplex(st.find({1, 2, 3, 4}));
std::clog << "st.upper_bound_dimension()=" << st.upper_bound_dimension() << std::endl;
BOOST_CHECK(st.upper_bound_dimension() == 3);
BOOST_CHECK(st.dimension() == 3);
std::clog << "st.remove_maximal_simplex({1, 2, 3, 5})" << std::endl;
st.remove_maximal_simplex(st.find({1, 2, 3, 5}));
std::clog << "st.upper_bound_dimension()=" << st.upper_bound_dimension() << std::endl;
BOOST_CHECK(st.upper_bound_dimension() == 3);
BOOST_CHECK(st.dimension() == 2);
std::clog << "st.dimension()=" << st.dimension() << std::endl;
std::clog << "st.insert_simplex_and_subfaces({1, 2, 3, 5})" << std::endl;
st.insert_simplex_and_subfaces({1, 2, 3, 5});
std::clog << "st.upper_bound_dimension()=" << st.upper_bound_dimension() << std::endl;
BOOST_CHECK(st.upper_bound_dimension() == 3);
BOOST_CHECK(st.dimension() == 3);
std::clog << "st.insert_simplex_and_subfaces({1, 2, 3, 4})" << std::endl;
st.insert_simplex_and_subfaces({1, 2, 3, 4});
std::clog << "st.upper_bound_dimension()=" << st.upper_bound_dimension() << std::endl;
BOOST_CHECK(st.upper_bound_dimension() == 3);
BOOST_CHECK(st.dimension() == 3);
std::clog << "st.remove_maximal_simplex({1, 2, 3, 5})" << std::endl;
st.remove_maximal_simplex(st.find({1, 2, 3, 5}));
std::clog << "st.upper_bound_dimension()=" << st.upper_bound_dimension() << std::endl;
BOOST_CHECK(st.upper_bound_dimension() == 3);
BOOST_CHECK(st.dimension() == 3);
std::clog << "st.remove_maximal_simplex({1, 2, 3, 4})" << std::endl;
st.remove_maximal_simplex(st.find({1, 2, 3, 4}));
std::clog << "st.upper_bound_dimension()=" << st.upper_bound_dimension() << std::endl;
BOOST_CHECK(st.upper_bound_dimension() == 3);
BOOST_CHECK(st.dimension() == 2);
std::clog << "st.dimension()=" << st.dimension() << std::endl;
std::clog << "st.insert_simplex_and_subfaces({0, 1, 3, 4})" << std::endl;
st.insert_simplex_and_subfaces({0, 1, 3, 4});
std::clog << "st.upper_bound_dimension()=" << st.upper_bound_dimension() << std::endl;
BOOST_CHECK(st.upper_bound_dimension() == 3);
BOOST_CHECK(st.dimension() == 3);
std::clog << "st.remove_maximal_simplex({0, 1, 3, 4})" << std::endl;
st.remove_maximal_simplex(st.find({0, 1, 3, 4}));
std::clog << "st.upper_bound_dimension()=" << st.upper_bound_dimension() << std::endl;
BOOST_CHECK(st.upper_bound_dimension() == 3);
BOOST_CHECK(st.dimension() == 2);
std::clog << "st.dimension()=" << st.dimension() << std::endl;
std::clog << "st.insert_simplex_and_subfaces({1, 2, 3, 5})" << std::endl;
st.insert_simplex_and_subfaces({1, 2, 3, 5});
std::clog << "st.upper_bound_dimension()=" << st.upper_bound_dimension() << std::endl;
BOOST_CHECK(st.upper_bound_dimension() == 3);
BOOST_CHECK(st.dimension() == 3);
std::clog << "st.insert_simplex_and_subfaces({1, 2, 3, 4})" << std::endl;
st.insert_simplex_and_subfaces({1, 2, 3, 4});
std::clog << "st.upper_bound_dimension()=" << st.upper_bound_dimension() << std::endl;
BOOST_CHECK(st.upper_bound_dimension() == 3);
BOOST_CHECK(st.dimension() == 3);
// Check you can override the dimension
// This is a limit test case - shall not happen
st.set_dimension(1);
std::clog << "st.upper_bound_dimension()=" << st.upper_bound_dimension() << std::endl;
BOOST_CHECK(st.upper_bound_dimension() == 1);
// check dimension() and lower_upper_bound_dimension() is not giving the right answer because dimension is too low
BOOST_CHECK(st.dimension() == 1);
// Check you can override the dimension
// This is a limit test case - shall not happen
st.set_dimension(6);
std::clog << "st.upper_bound_dimension()=" << st.upper_bound_dimension() << std::endl;
BOOST_CHECK(st.upper_bound_dimension() == 6);
// check dimension() do not launch lower_upper_bound_dimension()
BOOST_CHECK(st.dimension() == 6);
// Reset with the correct value
st.set_dimension(3);
std::clog << "st.upper_bound_dimension()=" << st.upper_bound_dimension() << std::endl;
BOOST_CHECK(st.upper_bound_dimension() == 3);
BOOST_CHECK(st.dimension() == 3);
std::clog << "st.insert_simplex_and_subfaces({0, 1, 2, 3, 4, 5, 6})" << std::endl;
st.insert_simplex_and_subfaces({0, 1, 2, 3, 4, 5, 6});
std::clog << "st.upper_bound_dimension()=" << st.upper_bound_dimension() << std::endl;
BOOST_CHECK(st.upper_bound_dimension() == 6);
BOOST_CHECK(st.dimension() == 6);
std::clog << "st.remove_maximal_simplex({0, 1, 2, 3, 4, 5, 6})" << std::endl;
st.remove_maximal_simplex(st.find({0, 1, 2, 3, 4, 5, 6}));
std::clog << "st.upper_bound_dimension()=" << st.upper_bound_dimension() << std::endl;
BOOST_CHECK(st.upper_bound_dimension() == 6);
BOOST_CHECK(st.dimension() == 5);
}
BOOST_AUTO_TEST_CASE(prune_above_filtration) {
std::clog << "********************************************************************" << std::endl;
std::clog << "PRUNE ABOVE FILTRATION" << std::endl;
Stree st;
st.insert_simplex_and_subfaces({0, 1, 6, 7}, 1.0);
st.insert_simplex_and_subfaces({3, 4, 5}, 2.0);
// Constructs a copy at this state for further test purpose
Stree st_pruned = st;
st_pruned.initialize_filtration(); // reset
st.insert_simplex_and_subfaces({3, 0}, 3.0);
st.insert_simplex_and_subfaces({2, 1, 0}, 4.0);
// Constructs a copy at this state for further test purpose
Stree st_complete = st;
// st_complete and st:
// 1 6
// o---o
// /X\7/
// o---o---o---o
// 2 0 3\X/4
// o
// 5
// st_pruned:
// 1 6
// o---o
// \7/
// o o---o
// 0 3\X/4
// o
// 5
bool simplex_is_changed = false;
// Check the no action cases
// greater than initial filtration value
simplex_is_changed = st.prune_above_filtration(10.0);
if (simplex_is_changed)
st.initialize_filtration();
BOOST_CHECK(st == st_complete);
BOOST_CHECK(!simplex_is_changed);
// equal to initial filtration value
simplex_is_changed = st.prune_above_filtration(6.0);
if (simplex_is_changed)
st.initialize_filtration();
BOOST_CHECK(st == st_complete);
BOOST_CHECK(!simplex_is_changed);
// lower than initial filtration value, but still greater than the maximum filtration value
simplex_is_changed = st.prune_above_filtration(5.0);
if (simplex_is_changed)
st.initialize_filtration();
BOOST_CHECK(st == st_complete);
BOOST_CHECK(!simplex_is_changed);
// Display the Simplex_tree
std::clog << "The complex contains " << st.num_simplices() << " simplices";
std::clog << " - dimension " << st.dimension() << std::endl;
std::clog << "Iterator on Simplices in the filtration, with [filtration value]:" << std::endl;
for (auto f_simplex : st.filtration_simplex_range()) {
std::clog << " " << "[" << st.filtration(f_simplex) << "] ";
for (auto vertex : st.simplex_vertex_range(f_simplex)) {
std::clog << (int) vertex << " ";
}
std::clog << std::endl;
}
// Check the pruned cases
simplex_is_changed = st.prune_above_filtration(2.5);
if (simplex_is_changed)
st.initialize_filtration();
BOOST_CHECK(st == st_pruned);
BOOST_CHECK(simplex_is_changed);
// Display the Simplex_tree
std::clog << "The complex pruned at 2.5 contains " << st.num_simplices() << " simplices";
std::clog << " - dimension " << st.dimension() << std::endl;
simplex_is_changed = st.prune_above_filtration(2.0);
if (simplex_is_changed)
st.initialize_filtration();
std::clog << "The complex pruned at 2.0 contains " << st.num_simplices() << " simplices";
std::clog << " - dimension " << st.dimension() << std::endl;
BOOST_CHECK(st == st_pruned);
BOOST_CHECK(!simplex_is_changed);
Stree st_empty;
simplex_is_changed = st.prune_above_filtration(0.0);
BOOST_CHECK(simplex_is_changed == true);
if (simplex_is_changed)
st.initialize_filtration();
// Display the Simplex_tree
std::clog << "The complex pruned at 0.0 contains " << st.num_simplices() << " simplices";
std::clog << " - upper_bound_dimension " << st.upper_bound_dimension() << std::endl;
BOOST_CHECK(st.upper_bound_dimension() == 3);
BOOST_CHECK(st.dimension() == -1);
std::clog << "upper_bound_dimension=" << st.upper_bound_dimension() << std::endl;
BOOST_CHECK(st.upper_bound_dimension() == -1);
BOOST_CHECK(st == st_empty);
BOOST_CHECK(simplex_is_changed);
// Test case to the limit
simplex_is_changed = st.prune_above_filtration(-1.0);
if (simplex_is_changed)
st.initialize_filtration();
BOOST_CHECK(st == st_empty);
BOOST_CHECK(!simplex_is_changed);
}
BOOST_AUTO_TEST_CASE(mini_prune_above_filtration) {
std::clog << "********************************************************************" << std::endl;
std::clog << "MINI PRUNE ABOVE FILTRATION" << std::endl;
Mini_stree st;
st.insert_simplex_and_subfaces({0, 1, 6, 7});
st.insert_simplex_and_subfaces({3, 4, 5});
st.insert_simplex_and_subfaces({3, 0});
st.insert_simplex_and_subfaces({2, 1, 0});
// st:
// 1 6
// o---o
// /X\7/
// o---o---o---o
// 2 0 3\X/4
// o
// 5
st.initialize_filtration();
// Display the Simplex_tree
std::clog << "The complex contains " << st.num_simplices() << " simplices" << std::endl;
BOOST_CHECK(st.num_simplices() == 27);
// Test case to the limit - With these options, there is no filtration, which means filtration is 0
bool simplex_is_changed = st.prune_above_filtration(1.0);
if (simplex_is_changed)
st.initialize_filtration();
// Display the Simplex_tree
std::clog << "The complex pruned at 1.0 contains " << st.num_simplices() << " simplices" << std::endl;
BOOST_CHECK(!simplex_is_changed);
BOOST_CHECK(st.num_simplices() == 27);
simplex_is_changed = st.prune_above_filtration(0.0);
if (simplex_is_changed)
st.initialize_filtration();
// Display the Simplex_tree
std::clog << "The complex pruned at 0.0 contains " << st.num_simplices() << " simplices" << std::endl;
BOOST_CHECK(!simplex_is_changed);
BOOST_CHECK(st.num_simplices() == 27);
// Test case to the limit
simplex_is_changed = st.prune_above_filtration(-1.0);
if (simplex_is_changed)
st.initialize_filtration();
// Display the Simplex_tree
std::clog << "The complex pruned at -1.0 contains " << st.num_simplices() << " simplices" << std::endl;
BOOST_CHECK(simplex_is_changed);
BOOST_CHECK(st.num_simplices() == 0);
// Display the Simplex_tree
std::clog << "The complex contains " << st.num_simplices() << " simplices" << std::endl;
}
|
