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
|
from cython cimport numeric
from libcpp.vector cimport vector
from libcpp.utility cimport pair
from libcpp.string cimport string
from libcpp cimport bool
"""This file is part of the Gudhi Library. The Gudhi library
(Geometric Understanding in Higher Dimensions) is a generic C++
library for computational topology.
Author(s): Vincent Rouvreau
Copyright (C) 2016 INRIA
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
"""
__author__ = "Vincent Rouvreau"
__copyright__ = "Copyright (C) 2016 INRIA"
__license__ = "GPL v3"
cdef extern from "Simplex_tree_interface.h" namespace "Gudhi":
cdef cppclass Simplex_tree_options_full_featured:
pass
cdef cppclass Rips_complex_interface "Gudhi::Simplex_tree_interface<Gudhi::Simplex_tree_options_full_featured>":
Simplex_tree()
double filtration()
double simplex_filtration(vector[int] simplex)
void set_filtration(double filtration)
void initialize_filtration()
int num_vertices()
int num_simplices()
void set_dimension(int dimension)
int dimension()
bint find_simplex(vector[int] simplex)
bint insert_simplex_and_subfaces(vector[int] simplex,
double filtration)
vector[pair[vector[int], double]] get_filtered_tree()
vector[pair[vector[int], double]] get_skeleton_tree(int dimension)
vector[pair[vector[int], double]] get_star_tree(vector[int] simplex)
vector[pair[vector[int], double]] get_coface_tree(vector[int] simplex,
int dimension)
void remove_maximal_simplex(vector[int] simplex)
void graph_expansion(vector[vector[double]] points, int max_dimension,
double max_edge_length)
void graph_expansion(string off_file, int max_dimension,
double max_edge_length, bool from_file)
cdef extern from "Persistent_cohomology_interface.h" namespace "Gudhi":
cdef cppclass Rips_complex_persistence_interface "Gudhi::Persistent_cohomology_interface<Gudhi::Simplex_tree<Gudhi::Simplex_tree_options_full_featured>>":
Rips_complex_persistence_interface(Rips_complex_interface * st)
vector[pair[int, pair[double, double]]] get_persistence(int homology_coeff_field, double min_persistence)
vector[int] betti_numbers()
vector[int] persistent_betti_numbers(double from_value, double to_value)
# RipsComplex python interface
cdef class RipsComplex:
"""RipsComplex is a simplicial complex constructed from a list of points.
Each point Pn is inserted as a vertex in the simplicial complex with a
null filtration value.
A N-simplex represented by the list of vertices Vi, ..., Vj is inserted in
the simplicial complex if all the points Pi, ..., Pj corresponding to the
vertices are within a distance less or equal to a given maximum edge length
value, and if N (dimension of the N-simplex) is less or equal to a given
maximum dimension.
"""
cdef Rips_complex_interface * thisptr
cdef Rips_complex_persistence_interface * pcohptr
# Fake constructor that does nothing but documenting the constructor
def __init__(self, points=[], off_file='', max_dimension=3,
max_edge_length=float('inf')):
"""RipsComplex constructor.
:param points: A list of points in d-Dimension.
:type points: list of list of double
Or
:param off_file: An OFF file style name.
:type off_file: string
:param max_dimension: Maximum dimension of the complex to be expanded.
:type max_dimension: int
:param max_edge_length: Maximum edge length value (rips radius).
:type max_edge_length: double
"""
# The real cython constructor
def __cinit__(self, points=[], off_file='', max_dimension=3,
max_edge_length=float('inf')):
self.thisptr = new Rips_complex_interface()
# Constructor from graph expansion
if off_file is not '':
if os.path.isfile(off_file):
self.thisptr.graph_expansion(off_file, max_dimension,
max_edge_length, True)
else:
print("file " + off_file + " not found.")
else:
self.thisptr.graph_expansion(points, max_dimension,
max_edge_length)
def __dealloc__(self):
if self.thisptr != NULL:
del self.thisptr
if self.pcohptr != NULL:
del self.pcohptr
def __is_defined(self):
"""Returns true if RipsComplex pointer is not NULL.
"""
return self.thisptr != NULL
def __is_persistence_defined(self):
"""Returns true if Persistence pointer is not NULL.
"""
return self.pcohptr != NULL
def get_filtration(self):
"""This function returns the main simplicial complex filtration value.
:returns: float -- the simplicial complex filtration value.
"""
return self.thisptr.filtration()
def filtration(self, simplex):
"""This function returns the simplicial complex filtration value for a
given N-simplex.
:param simplex: The N-simplex, represented by a list of vertex.
:type simplex: list of int.
:returns: float -- the simplicial complex filtration value.
"""
return self.thisptr.simplex_filtration(simplex)
def set_filtration(self, filtration):
"""This function sets the main simplicial complex filtration value.
:param filtration: The filtration value.
:type filtration: float.
"""
self.thisptr.set_filtration(<double> filtration)
def initialize_filtration(self):
"""This function initializes and sorts the simplicial complex
filtration vector.
.. note::
This function must be launched before persistence, betti_numbers,
persistent_betti_numbers or get_filtered_tree after inserting or
removing simplices.
"""
self.thisptr.initialize_filtration()
def num_vertices(self):
"""This function returns the number of vertices of the simplicial
complex.
:returns: int -- the simplicial complex number of vertices.
"""
return self.thisptr.num_vertices()
def num_simplices(self):
"""This function returns the number of simplices of the simplicial
complex.
:returns: int -- the simplicial complex number of simplices.
"""
return self.thisptr.num_simplices()
def dimension(self):
"""This function returns the dimension of the simplicial complex.
:returns: int -- the simplicial complex dimension.
"""
return self.thisptr.dimension()
def set_dimension(self, dimension):
"""This function sets the dimension of the simplicial complex.
:param dimension: The new dimension value.
:type dimension: int.
"""
self.thisptr.set_dimension(<int>dimension)
def find(self, simplex):
"""This function returns if the N-simplex was found in the simplicial
complex or not.
:param simplex: The N-simplex to find, represented by a list of vertex.
:type simplex: list of int.
:returns: bool -- true if the simplex was found, false otherwise.
"""
cdef vector[int] complex
for i in simplex:
complex.push_back(i)
return self.thisptr.find_simplex(complex)
def insert(self, simplex, filtration=0.0):
"""This function inserts the given N-simplex with the given filtration
value (default value is '0.0').
:param simplex: The N-simplex to insert, represented by a list of
vertex.
:type simplex: list of int.
:param filtration: The filtration value of the simplex.
:type filtration: float.
:returns: bool -- true if the simplex was found, false otherwise.
"""
cdef vector[int] complex
for i in simplex:
complex.push_back(i)
return self.thisptr.insert_simplex_and_subfaces(complex,
<double>filtration)
def get_filtered_tree(self):
"""This function returns the tree sorted by increasing filtration
values.
:returns: list of tuples(simplex, filtration) -- the tree sorted by
increasing filtration values.
"""
cdef vector[pair[vector[int], double]] coface_tree \
= self.thisptr.get_filtered_tree()
ct = []
for filtered_complex in coface_tree:
v = []
for vertex in filtered_complex.first:
v.append(vertex)
ct.append((v, filtered_complex.second))
return ct
def get_skeleton_tree(self, dimension):
"""This function returns the tree skeleton of a maximum given
dimension.
:param dimension: The skeleton dimension value.
:type dimension: int.
:returns: list of tuples(simplex, filtration) -- the skeleton tree
of a maximum dimension.
"""
cdef vector[pair[vector[int], double]] coface_tree \
= self.thisptr.get_skeleton_tree(<int>dimension)
ct = []
for filtered_complex in coface_tree:
v = []
for vertex in filtered_complex.first:
v.append(vertex)
ct.append((v, filtered_complex.second))
return ct
def get_star_tree(self, simplex):
"""This function returns the star tree of a given N-simplex.
:param simplex: The N-simplex, represented by a list of vertex.
:type simplex: list of int.
:returns: list of tuples(simplex, filtration) -- the star tree of a
simplex.
"""
cdef vector[int] complex
for i in simplex:
complex.push_back(i)
cdef vector[pair[vector[int], double]] coface_tree \
= self.thisptr.get_star_tree(complex)
ct = []
for filtered_complex in coface_tree:
v = []
for vertex in filtered_complex.first:
v.append(vertex)
ct.append((v, filtered_complex.second))
return ct
def get_coface_tree(self, simplex, codimension):
"""This function returns the coface tree of a given N-simplex with a
given codimension.
:param simplex: The N-simplex, represented by a list of vertex.
:type simplex: list of int.
:param codimension: The codimension. If codimension = 0, all cofaces
are returned (equivalent of get_star_tree function)
:type codimension: int.
:returns: list of tuples(simplex, filtration) -- the coface tree of a
simplex.
"""
cdef vector[int] complex
for i in simplex:
complex.push_back(i)
cdef vector[pair[vector[int], double]] coface_tree \
= self.thisptr.get_coface_tree(complex, <int>codimension)
ct = []
for filtered_complex in coface_tree:
v = []
for vertex in filtered_complex.first:
v.append(vertex)
ct.append((v, filtered_complex.second))
return ct
def remove_maximal_simplex(self, simplex):
"""This function removes a given maximal N-simplex from the simplicial
complex.
:param simplex: The N-simplex, represented by a list of vertex.
:type simplex: list of int.
"""
self.thisptr.remove_maximal_simplex(simplex)
def persistence(self, homology_coeff_field=11, min_persistence=0):
"""This function returns the persistence of the simplicial complex.
:param homology_coeff_field: The homology coefficient field. Must be a
prime number
:type homology_coeff_field: int.
:param min_persistence: The minimum persistence value to take into
account (strictly greater than min_persistence). Default value is
0.0.
Sets min_persistence to -1.0 to see all values.
:type min_persistence: float.
:note: list of pairs(dimension, pair(birth, death)) -- the
persistence of the simplicial complex.
"""
if self.pcohptr != NULL:
del self.pcohptr
self.pcohptr = new Rips_complex_persistence_interface(self.thisptr)
cdef vector[pair[int, pair[double, double]]] persistence_result
if self.pcohptr != NULL:
persistence_result = self.pcohptr.get_persistence(homology_coeff_field, min_persistence)
return persistence_result
def betti_numbers(self):
"""This function returns the Betti numbers of the simplicial complex.
:returns: list of int -- The Betti numbers ([B0, B1, ..., Bn]).
:note: betti_numbers function requires persistence function to be
launched first.
"""
cdef vector[int] bn_result
if self.pcohptr != NULL:
bn_result = self.pcohptr.betti_numbers()
else:
print("betti_numbers function requires persistence function"
" to be launched first.")
return bn_result
def persistent_betti_numbers(self, from_value, to_value):
"""This function returns the persistent Betti numbers of the
simplicial complex.
:param from_value: The persistence birth limit to be added in the
numbers (persistent birth <= from_value).
:type from_value: float.
:param to_value: The persistence death limit to be added in the
numbers (persistent death > to_value).
:type to_value: float.
:returns: list of int -- The persistent Betti numbers ([B0, B1, ...,
Bn]).
:note: persistent_betti_numbers function requires persistence
function to be launched first.
"""
cdef vector[int] pbn_result
if self.pcohptr != NULL:
pbn_result = self.pcohptr.persistent_betti_numbers(<double>from_value, <double>to_value)
else:
print("persistent_betti_numbers function requires persistence function"
" to be launched first.")
return pbn_result
|