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
|
#include <iostream>
#include <vector>
#include <gudhi/Lazy_Toplex_map.h>
#define BOOST_TEST_DYN_LINK
#define BOOST_TEST_MODULE "toplex map"
#include <boost/test/unit_test.hpp>
#include <boost/mpl/list.hpp>
using list_of_tested_variants = boost::mpl::list<Gudhi::Toplex_map, Gudhi::Lazy_Toplex_map>;
BOOST_AUTO_TEST_CASE_TEMPLATE(common_toplex_map_functionnalities, Toplex_map, list_of_tested_variants) {
using Vertex = typename Toplex_map::Vertex;
std::vector<Vertex> sigma1 = {1, 2, 3, 4};
std::vector<Vertex> sigma2 = {5, 2, 3, 6};
std::vector<Vertex> sigma3 = {5};
std::vector<Vertex> sigma4 = {5, 2, 3};
std::vector<Vertex> sigma5 = {5, 2, 7};
std::vector<Vertex> sigma6 = {4, 5, 3};
std::vector<Vertex> sigma7 = {4, 5, 9};
std::vector<Vertex> sigma8 = {1, 2, 3, 6};
Toplex_map K;
K.insert_simplex(sigma1);
K.insert_simplex(sigma2);
K.insert_simplex(sigma3);
K.insert_simplex(sigma6);
K.insert_simplex(sigma7);
std::cout << "num_maximal_simplices" << K.num_maximal_simplices() << std::endl;
BOOST_CHECK(K.membership(sigma4));
//BOOST_CHECK(!K.maximality(sigma3));
BOOST_CHECK(!K.membership(sigma5));
K.insert_simplex(sigma5);
std::cout << "num_maximal_simplices" << K.num_maximal_simplices() << std::endl;
BOOST_CHECK(K.membership(sigma5));
std::vector<Vertex> sigma9 = {1, 2, 3};
std::vector<Vertex> sigma10 = {2, 7};
auto r = K.contraction(4,5);
std::cout << "num_maximal_simplices" << K.num_maximal_simplices() << std::endl;
sigma9.emplace_back(r);
sigma10.emplace_back(r);
BOOST_CHECK(!K.membership(sigma6));
BOOST_CHECK(K.membership(sigma9));
BOOST_CHECK(K.membership(sigma10));
K.remove_simplex(sigma10);
BOOST_CHECK(!K.membership(sigma10));
}
BOOST_AUTO_TEST_CASE(toplex_map_num_maximal_simplices) {
using Vertex = Gudhi::Toplex_map::Vertex;
Gudhi::Toplex_map K;
std::vector<Vertex> sigma1 = {1, 2, 3, 4};
std::vector<Vertex> sigma2 = {5, 2, 3, 6};
std::vector<Vertex> sigma3 = {4, 5, 3};
std::vector<Vertex> sigma4 = {4, 5, 9};
K.insert_simplex(sigma1);
K.insert_simplex(sigma2);
K.insert_simplex(sigma3);
K.insert_simplex(sigma4);
std::cout << "num_maximal_simplices" << K.num_maximal_simplices() << std::endl;
BOOST_CHECK(K.num_maximal_simplices() == 4);
std::vector<Vertex> sigma5 = {5, 2, 7};
K.insert_simplex(sigma5);
std::cout << "num_maximal_simplices" << K.num_maximal_simplices() << std::endl;
BOOST_CHECK(K.num_maximal_simplices() == 5);
auto r = K.contraction(4,5);
std::cout << "r=" << r << std::endl;
BOOST_CHECK(r == 5);
std::cout << "num_maximal_simplices" << K.num_maximal_simplices() << std::endl;
BOOST_CHECK(K.num_maximal_simplices() == 4);
std::vector<Vertex> sigma6 = {2, 7};
K.remove_simplex(sigma6);
std::cout << "num_maximal_simplices" << K.num_maximal_simplices() << std::endl;
BOOST_CHECK(K.num_maximal_simplices() == 4);
K.remove_simplex(sigma2);
std::cout << "num_maximal_simplices" << K.num_maximal_simplices() << std::endl;
BOOST_CHECK(K.num_maximal_simplices() == 6);
}
BOOST_AUTO_TEST_CASE(lazy_toplex_map_num_maximal_simplices) {
using Vertex = Gudhi::Lazy_Toplex_map::Vertex;
Gudhi::Lazy_Toplex_map K;
std::vector<Vertex> sigma1 = {1, 2, 3, 4};
std::vector<Vertex> sigma2 = {5, 2, 3, 6};
std::vector<Vertex> sigma3 = {4, 5, 3};
std::vector<Vertex> sigma4 = {4, 5, 9};
K.insert_simplex(sigma1);
K.insert_simplex(sigma2);
K.insert_simplex(sigma3);
K.insert_simplex(sigma4);
std::cout << "num_maximal_simplices" << K.num_maximal_simplices() << std::endl;
BOOST_CHECK(K.num_maximal_simplices() == 4);
std::vector<Vertex> sigma5 = {5, 2, 7};
K.insert_simplex(sigma5);
std::cout << "num_maximal_simplices" << K.num_maximal_simplices() << std::endl;
BOOST_CHECK(K.num_maximal_simplices() == 5);
auto r = K.contraction(4,5);
std::cout << "r=" << r << std::endl;
BOOST_CHECK(r == 5);
std::cout << "num_maximal_simplices" << K.num_maximal_simplices() << std::endl;
BOOST_CHECK(K.num_maximal_simplices() == 5);
std::vector<Vertex> sigma6 = {2, 7};
K.remove_simplex(sigma6);
std::cout << "num_maximal_simplices" << K.num_maximal_simplices() << std::endl;
BOOST_CHECK(K.num_maximal_simplices() == 6);
K.remove_simplex(sigma2);
std::cout << "num_maximal_simplices" << K.num_maximal_simplices() << std::endl;
BOOST_CHECK(K.num_maximal_simplices() == 9);
}
BOOST_AUTO_TEST_CASE(toplex_map_maximality) {
using Vertex = Gudhi::Toplex_map::Vertex;
std::vector<Vertex> sigma1 = {1, 2, 3, 4};
std::vector<Vertex> sigma2 = {5, 2, 3, 6};
std::vector<Vertex> sigma3 = {5};
std::vector<Vertex> sigma4 = {4, 5, 3};
std::vector<Vertex> sigma5 = {4, 5, 9};
Gudhi::Toplex_map K;
K.insert_simplex(sigma1);
K.insert_simplex(sigma2);
K.insert_simplex(sigma3);
K.insert_simplex(sigma4);
K.insert_simplex(sigma5);
BOOST_CHECK(K.maximality(sigma1));
BOOST_CHECK(K.maximality(sigma2));
BOOST_CHECK(!K.maximality(sigma3));
BOOST_CHECK(K.maximality(sigma4));
BOOST_CHECK(K.maximality(sigma5));
}
|
