diff options
Diffstat (limited to 'cython/test/test_alpha_complex.py')
-rwxr-xr-x | cython/test/test_alpha_complex.py | 86 |
1 files changed, 0 insertions, 86 deletions
diff --git a/cython/test/test_alpha_complex.py b/cython/test/test_alpha_complex.py deleted file mode 100755 index e97f2530..00000000 --- a/cython/test/test_alpha_complex.py +++ /dev/null @@ -1,86 +0,0 @@ -from gudhi import AlphaComplex, SimplexTree - -"""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" - - -def test_empty_alpha(): - alpha_complex = AlphaComplex(points=[[0,0]]) - assert alpha_complex.__is_defined() == True - -def test_infinite_alpha(): - point_list = [[0, 0], [1, 0], [0, 1], [1, 1]] - alpha_complex = AlphaComplex(points=point_list) - assert alpha_complex.__is_defined() == True - - simplex_tree = alpha_complex.create_simplex_tree() - assert simplex_tree.__is_persistence_defined() == False - - assert simplex_tree.num_simplices() == 11 - assert simplex_tree.num_vertices() == 4 - - assert simplex_tree.get_filtration() == \ - [([0], 0.0), ([1], 0.0), ([2], 0.0), ([3], 0.0), - ([0, 1], 0.25), ([0, 2], 0.25), ([1, 3], 0.25), - ([2, 3], 0.25), ([1, 2], 0.5), ([0, 1, 2], 0.5), - ([1, 2, 3], 0.5)] - assert simplex_tree.get_star([0]) == \ - [([0], 0.0), ([0, 1], 0.25), ([0, 1, 2], 0.5), - ([0, 2], 0.25)] - assert simplex_tree.get_cofaces([0], 1) == \ - [([0, 1], 0.25), ([0, 2], 0.25)] - - assert point_list[0] == alpha_complex.get_point(0) - assert point_list[1] == alpha_complex.get_point(1) - assert point_list[2] == alpha_complex.get_point(2) - assert point_list[3] == alpha_complex.get_point(3) - assert alpha_complex.get_point(4) == [] - assert alpha_complex.get_point(125) == [] - -def test_filtered_alpha(): - point_list = [[0, 0], [1, 0], [0, 1], [1, 1]] - filtered_alpha = AlphaComplex(points=point_list) - - simplex_tree = filtered_alpha.create_simplex_tree(max_alpha_square=0.25) - - assert simplex_tree.num_simplices() == 8 - assert simplex_tree.num_vertices() == 4 - - assert point_list[0] == filtered_alpha.get_point(0) - assert point_list[1] == filtered_alpha.get_point(1) - assert point_list[2] == filtered_alpha.get_point(2) - assert point_list[3] == filtered_alpha.get_point(3) - assert filtered_alpha.get_point(4) == [] - assert filtered_alpha.get_point(125) == [] - - assert simplex_tree.get_filtration() == \ - [([0], 0.0), ([1], 0.0), ([2], 0.0), ([3], 0.0), - ([0, 1], 0.25), ([0, 2], 0.25), ([1, 3], 0.25), - ([2, 3], 0.25)] - assert simplex_tree.get_star([0]) == \ - [([0], 0.0), ([0, 1], 0.25), ([0, 2], 0.25)] - assert simplex_tree.get_cofaces([0], 1) == \ - [([0, 1], 0.25), ([0, 2], 0.25)] |