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
|
/* 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: François Godi, Vincent Rouvreau
*
* Copyright (C) 2018 INRIA
*
* Modification(s):
* - YYYY/MM Author: Description of the modification
*/
#include <iostream>
#include <vector>
#include <gudhi/Lazy_toplex_map.h>
#define BOOST_TEST_DYN_LINK
#define BOOST_TEST_MODULE "lazy toplex map"
#include <boost/test/unit_test.hpp>
BOOST_AUTO_TEST_CASE(toplex_map) {
using Vertex = Gudhi::Lazy_toplex_map::Vertex;
Gudhi::Lazy_toplex_map tm;
std::cout << "insert_simplex {1, 2, 3, 4}" << std::endl;
std::vector<Vertex> sigma1 = {1, 2, 3, 4};
tm.insert_simplex(sigma1);
std::cout << "insert_simplex {5, 2, 3, 6}" << std::endl;
std::vector<Vertex> sigma2 = {5, 2, 3, 6};
tm.insert_simplex(sigma2);
std::cout << "insert_simplex {5}" << std::endl;
std::vector<Vertex> sigma3 = {5};
tm.insert_simplex(sigma3);
std::cout << "insert_simplex {4, 5, 3}" << std::endl;
std::vector<Vertex> sigma6 = {4, 5, 3};
tm.insert_simplex(sigma6);
std::cout << "insert_simplex {4, 5, 9}" << std::endl;
std::vector<Vertex> sigma7 = {4, 5, 9};
tm.insert_simplex(sigma7);
std::cout << "num_maximal_simplices = " << tm.num_maximal_simplices() << std::endl;
BOOST_CHECK(tm.num_maximal_simplices() == 5);
std::vector<Vertex> sigma4 = {5, 2, 3};
std::vector<Vertex> sigma5 = {5, 2, 7};
BOOST_CHECK(tm.membership(sigma4));
BOOST_CHECK(!tm.membership(sigma5));
std::cout << "insert_simplex {5, 2, 7}" << std::endl;
tm.insert_simplex(sigma5);
std::cout << "num_maximal_simplices = " << tm.num_maximal_simplices() << std::endl;
BOOST_CHECK(tm.num_maximal_simplices() == 6);
BOOST_CHECK(tm.membership(sigma5));
std::cout << "contraction(4,5)" << std::endl;
auto r = tm.contraction(4, 5);
std::cout << "r=" << r << std::endl;
BOOST_CHECK(r == 5);
std::cout << "num_maximal_simplices = " << tm.num_maximal_simplices() << std::endl;
BOOST_CHECK(tm.num_maximal_simplices() == 6);
std::vector<Vertex> sigma8 = {1, 2, 3};
std::vector<Vertex> sigma9 = {2, 7};
sigma8.emplace_back(r);
sigma9.emplace_back(r);
BOOST_CHECK(!tm.membership(sigma6));
BOOST_CHECK(tm.membership(sigma8));
BOOST_CHECK(tm.membership(sigma9));
std::cout << "remove_simplex({2, 7, r = 5})" << std::endl;
tm.remove_simplex(sigma9);
BOOST_CHECK(!tm.membership(sigma9));
std::cout << "num_maximal_simplices = " << tm.num_maximal_simplices() << std::endl;
BOOST_CHECK(tm.num_maximal_simplices() == 8);
// {2, 7, 5} is removed, but verify its edges are still there
std::vector<Vertex> edge = {2, 7};
BOOST_CHECK(tm.membership(edge));
edge = {2, 5};
BOOST_CHECK(tm.membership(edge));
edge = {7, 5};
BOOST_CHECK(tm.membership(edge));
}
BOOST_AUTO_TEST_CASE(toplex_map_empty_toplex) {
using Vertex = Gudhi::Lazy_toplex_map::Vertex;
Gudhi::Lazy_toplex_map tm;
std::cout << "num_maximal_simplices = " << tm.num_maximal_simplices() << std::endl;
BOOST_CHECK(tm.num_maximal_simplices() == 0);
std::cout << "num_vertices = " << tm.num_vertices() << std::endl;
BOOST_CHECK(tm.num_vertices() == 0);
std::cout << "Check an empty simplex is a member." << std::endl;
std::vector<Vertex> empty_sigma = {};
BOOST_CHECK(tm.membership(empty_sigma));
std::cout << "Check the edge 2,7 is not a member." << std::endl;
std::vector<Vertex> edge = {2, 7};
BOOST_CHECK(!tm.membership(edge));
std::cout << "Insert an empty simplex." << std::endl;
tm.insert_simplex(empty_sigma);
std::cout << "num_maximal_simplices = " << tm.num_maximal_simplices() << std::endl;
BOOST_CHECK(tm.num_maximal_simplices() == 0);
std::cout << "num_vertices = " << tm.num_vertices() << std::endl;
BOOST_CHECK(tm.num_vertices() == 0);
std::cout << "Check an empty simplex is a member." << std::endl;
BOOST_CHECK(tm.membership(empty_sigma));
std::cout << "Check the edge 2,7 is not a member." << std::endl;
BOOST_CHECK(!tm.membership(edge));
std::cout << "Insert edge 2,7." << std::endl;
tm.insert_simplex(edge);
std::cout << "num_maximal_simplices = " << tm.num_maximal_simplices() << std::endl;
BOOST_CHECK(tm.num_maximal_simplices() == 1);
std::cout << "num_vertices = " << tm.num_vertices() << std::endl;
BOOST_CHECK(tm.num_vertices() == 2);
std::cout << "Check an empty simplex is a member." << std::endl;
BOOST_CHECK(tm.membership(empty_sigma));
std::cout << "Check the edge 2,7 is a member." << std::endl;
BOOST_CHECK(tm.membership(edge));
std::cout << "contraction(2,7)" << std::endl;
auto r = tm.contraction(2, 7);
std::cout << "r=" << r << std::endl;
BOOST_CHECK(r == 7);
std::cout << "num_maximal_simplices = " << tm.num_maximal_simplices() << std::endl;
BOOST_CHECK(tm.num_maximal_simplices() == 1);
std::cout << "num_vertices = " << tm.num_vertices() << std::endl;
BOOST_CHECK(tm.num_vertices() == 1);
std::cout << "Check an empty simplex is a member." << std::endl;
BOOST_CHECK(tm.membership(empty_sigma));
std::cout << "Check the edge 2,7 is not a member." << std::endl;
BOOST_CHECK(!tm.membership(edge));
std::cout << "Remove the vertex 7." << std::endl;
std::vector<Vertex> vertex = {7};
tm.remove_simplex(vertex);
std::cout << "num_maximal_simplices = " << tm.num_maximal_simplices() << std::endl;
BOOST_CHECK(tm.num_maximal_simplices() == 0);
std::cout << "num_vertices = " << tm.num_vertices() << std::endl;
BOOST_CHECK(tm.num_vertices() == 0);
std::cout << "Check an empty simplex is a member." << std::endl;
BOOST_CHECK(tm.membership(empty_sigma));
std::cout << "Check the edge 2,7 is not a member." << std::endl;
BOOST_CHECK(!tm.membership(edge));
}
|
