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
|
/*
* TestSimplifiable.cxx
*
* Created on: Feb 4, 2014
* Author: dsalinas
*/
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <fstream>
#include <sstream>
#include "gudhi/Test.h"
//#include "Skeleton_blocker/Simplex.h"
#include "gudhi/Skeleton_blocker_complex.h"
#include "gudhi/Skeleton_blocker/iterators/Skeleton_blockers_iterators.h"
#include "gudhi/Skeleton_blocker_simplifiable_complex.h"
#include "gudhi/Skeleton_blocker/Skeleton_blocker_simple_traits.h"
using namespace std;
using namespace Gudhi;
using namespace skbl;
template<typename ComplexType> class Skeleton_blocker_sub_complex;
typedef Skeleton_blocker_simplifiable_complex<Skeleton_blocker_simple_traits> Complex;
typedef Complex::Vertex_handle Vertex_handle;
typedef Complex::Root_vertex_handle Root_vertex_handle;
typedef Skeleton_blocker_simplex<Vertex_handle> Simplex_handle;
// true iff v \in complex
bool assert_vertex(Complex &complex,Vertex_handle v){
Simplex_handle simplex(v);
bool test = complex.contains(simplex);
assert(test);
return test;
}
// true iff the blocker (a,b,c) is in complex
bool assert_blocker(Complex &complex,Root_vertex_handle a,Root_vertex_handle b,Root_vertex_handle c){
return complex.contains_blocker(Simplex_handle(*complex.get_address(a),*complex.get_address(b),*complex.get_address(c)));
//return complex.contains_blocker((a),(b),(c));
}
void build_complete(int n,Complex& complex){
complex.clear();
for(int i=0;i<n;i++)
complex.add_vertex();
for(int i=0;i<n;i++)
for(int j=0;j<i;j++)
complex.add_edge(Vertex_handle(i),Vertex_handle(j));
}
bool test_contraction1(){
enum { a, b, x, y, z, n };
Complex complex(n);
build_complete(n,complex);
complex.remove_edge(Vertex_handle(b),Vertex_handle(z));
complex.add_blocker(Vertex_handle(a),Vertex_handle(x),Vertex_handle(y));
complex.add_blocker(Vertex_handle(b),Vertex_handle(x),Vertex_handle(y));
// Print result
cerr << "complex before complex"<< complex.to_string()<<endl;
cerr <<endl<<endl;
complex.contract_edge(Vertex_handle(a),Vertex_handle(b));
// Print result
cerr << "ContractEdge(0,1)\n";
PRINT(complex.to_string());
// verification
for (int i=0;i<5;i++)
if (i!=1) assert_vertex(complex,Vertex_handle(i));
bool test1 = !complex.contains_edge(Vertex_handle(a),Vertex_handle(b));
bool test2 = assert_blocker(complex,Root_vertex_handle(a),Root_vertex_handle(x),Root_vertex_handle(y));
bool test3 = complex.num_edges()==6;
bool test4 = complex.num_blockers()==1;
Simplex_handle sigma;
sigma.add_vertex(Vertex_handle(a));
sigma.add_vertex(Vertex_handle(x));
sigma.add_vertex(Vertex_handle(y));
sigma.add_vertex(Vertex_handle(z));
bool test5 = !(complex.contains(sigma));
return test1&&test2&&test3&&test4&&test5;
}
bool test_contraction2(){
enum { a, b, x, y, z, n };
Complex complex(n);
build_complete(n,complex);
complex.remove_edge(Vertex_handle(b),Vertex_handle(x));
Simplex_handle blocker;
blocker.add_vertex(Vertex_handle(a));
blocker.add_vertex(Vertex_handle(y));
blocker.add_vertex(Vertex_handle(z));
complex.add_blocker(blocker);
// Print result
cerr << "complex complex"<< complex.to_string();
cerr <<endl<<endl;
complex.contract_edge(Vertex_handle(a),Vertex_handle(b));
cerr << "complex.ContractEdge(a,b)"<< complex.to_string();
cerr <<endl<<endl;
// there should be one blocker (a,c,d,e) in the complex
bool test ;
test = complex.contains_blocker(Simplex_handle(a,x,y,z));
test = test && complex.num_blockers()==1;
return test;
}
bool test_link_condition1(){
Complex complex(0);
// Build the complexes
build_complete(4,complex);
complex.add_blocker(Vertex_handle(0),Vertex_handle(1),Vertex_handle(2));
// Print result
cerr << "complex complex"<< complex.to_string();
cerr <<endl<<endl;
bool weak_link_condition = complex.link_condition(Vertex_handle(1),Vertex_handle(2),true);
bool strong_link_condition = complex.link_condition(Vertex_handle(1),Vertex_handle(2),false);
return weak_link_condition && !strong_link_condition;
}
bool test_collapse1(){
// xxx implement remove_star(simplex) before
Complex complex(5);
build_complete(4,complex);
complex.add_vertex();
complex.add_edge(2,4);
complex.add_edge(3,4);
// Print result
cerr << "initial complex :\n"<< complex.to_string();
cerr <<endl<<endl;
Simplex_handle simplex_123(Vertex_handle(1),Vertex_handle(2),Vertex_handle(3));
complex.remove_star(simplex_123);
cerr << "complex.remove_star(1,2,3):\n"<< complex.to_string();
cerr <<endl<<endl;
// verification
bool blocker123_here = complex.contains_blocker(simplex_123);
cerr <<"----> Ocomplex \n";
return blocker123_here;
}
bool test_collapse2(){
Complex complex(5);
build_complete(4,complex);
complex.add_vertex();
complex.add_edge(Vertex_handle(1),Vertex_handle(4));
complex.add_edge(Vertex_handle(2),Vertex_handle(4));
complex.add_edge(Vertex_handle(3),Vertex_handle(4));
complex.add_blocker(Vertex_handle(1),Vertex_handle(2),Vertex_handle(3),Vertex_handle(4));
// Print result
cerr << "initial complex :\n"<< complex.to_string();
cerr <<endl<<endl;
Simplex_handle sigma(Vertex_handle(1),Vertex_handle(2),Vertex_handle(3));
complex.remove_star(sigma);
cerr << "complex.remove_star(1,2,3):\n"<< complex.to_string();
cerr <<endl<<endl;
// verification
bool blocker_removed = !complex.contains_blocker(Simplex_handle(Vertex_handle(1),Vertex_handle(2),Vertex_handle(3),Vertex_handle(4)));
bool blocker123_here = complex.contains_blocker(sigma);
return blocker_removed && blocker123_here;
}
bool test_collapse3(){
Complex complex(5);
build_complete(4,complex);
complex.add_vertex();
complex.add_edge(Vertex_handle(1),Vertex_handle(4));
complex.add_edge(Vertex_handle(2),Vertex_handle(4));
complex.add_edge(Vertex_handle(3),Vertex_handle(4));
complex.add_blocker(Vertex_handle(1),Vertex_handle(2),Vertex_handle(3),Vertex_handle(4));
// Print result
cerr << "initial complex:\n"<< complex.to_string();
cerr <<endl<<endl;
complex.remove_star(Vertex_handle(2));
cerr << "complex after remove star of 2:\n"<< complex.to_string();
bool blocker134_here = complex.contains_blocker(Simplex_handle(Vertex_handle(1),Vertex_handle(3),Vertex_handle(4)));
bool blocker1234_here = complex.contains_blocker(Simplex_handle(Vertex_handle(1),Vertex_handle(2),Vertex_handle(3),Vertex_handle(4)));
// verification
// assert_blocker(complex,1,2,3);
// assert(!complex.ContainsBlocker(new AddressSimplex(1,2,3,4)));
cerr <<"----> Ocomplex \n";
return blocker134_here && !blocker1234_here;
}
bool test_remove_popable_blockers(){
Complex complex;
build_complete(4,complex);
complex.add_vertex();
complex.add_edge(Vertex_handle(3),Vertex_handle(4));
complex.add_edge(Vertex_handle(2),Vertex_handle(4));
Simplex_handle sigma1=Simplex_handle(Vertex_handle(1),Vertex_handle(2),Vertex_handle(3));
Simplex_handle sigma2=Simplex_handle(Vertex_handle(2),Vertex_handle(3),Vertex_handle(4));
complex.add_blocker(sigma1);
complex.add_blocker(sigma2);
cerr << "complex complex"<< complex.to_string();
cerr <<endl<<endl;
cerr << "complex.RemovePopableBlockers();"<<endl;
complex.remove_popable_blockers();
cerr << "complex complex"<< complex.to_string();
cerr <<endl<<endl;
bool test1 = (complex.num_blockers()==1);
// test 2
complex.clear();
build_complete(4,complex);
complex.add_vertex();
complex.add_vertex();
complex.add_edge(Vertex_handle(3),Vertex_handle(4));
complex.add_edge(Vertex_handle(2),Vertex_handle(4));
complex.add_edge(Vertex_handle(2),Vertex_handle(5));
complex.add_edge(Vertex_handle(3),Vertex_handle(5));
complex.add_edge(Vertex_handle(4),Vertex_handle(5));
sigma1=Simplex_handle(Vertex_handle(1),Vertex_handle(2),Vertex_handle(3));
sigma2=Simplex_handle(Vertex_handle(2),Vertex_handle(3),Vertex_handle(4));
complex.add_blocker(sigma1);
complex.add_blocker(sigma2);
cerr << "complex complex"<< complex.to_string();
cerr <<endl<<endl; cerr << "complex.RemovePopableBlockers();"<<endl;
complex.remove_popable_blockers();
cerr << "complex complex"<< complex.to_string();
cerr <<endl<<endl;
bool test2 = (complex.num_blockers()==0);
return test1&&test2;
}
int main (int argc, char *argv[])
{
Tests tests_simplifiable_complex;
tests_simplifiable_complex.add("Test contraction 1",test_contraction1);
tests_simplifiable_complex.add("Test contraction 2",test_contraction2);
tests_simplifiable_complex.add("Test Link condition 1",test_link_condition1);
tests_simplifiable_complex.add("Test remove popable blockers",test_remove_popable_blockers);
tests_simplifiable_complex.add("Test collapse 1",test_collapse1);
tests_simplifiable_complex.add("Test collapse 2",test_collapse2);
tests_simplifiable_complex.add("Test collapse 3",test_collapse3);
tests_simplifiable_complex.run();
if(tests_simplifiable_complex.run())
return EXIT_SUCCESS;
else
return EXIT_FAILURE;
}
|
