summaryrefslogtreecommitdiff
path: root/src/cython/test/test_tangential_complex.py
diff options
context:
space:
mode:
Diffstat (limited to 'src/cython/test/test_tangential_complex.py')
-rwxr-xr-xsrc/cython/test/test_tangential_complex.py42
1 files changed, 18 insertions, 24 deletions
diff --git a/src/cython/test/test_tangential_complex.py b/src/cython/test/test_tangential_complex.py
index 5c62f278..0f828d8e 100755
--- a/src/cython/test/test_tangential_complex.py
+++ b/src/cython/test/test_tangential_complex.py
@@ -1,35 +1,23 @@
from gudhi import TangentialComplex, 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.
+""" 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(s): Vincent Rouvreau
- Author(s): Vincent Rouvreau
+ Copyright (C) 2016 Inria
- 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/>.
+ Modification(s):
+ - YYYY/MM Author: Description of the modification
"""
__author__ = "Vincent Rouvreau"
__copyright__ = "Copyright (C) 2016 Inria"
-__license__ = "GPL v3"
+__license__ = "MIT"
def test_tangential():
point_list = [[0.0, 0.0], [1.0, 0.0], [0.0, 1.0], [1.0, 1.0]]
- tc = TangentialComplex(intrisic_dim = 1, points=point_list)
+ tc = TangentialComplex(intrisic_dim=1, points=point_list)
assert tc.__is_defined() == True
assert tc.num_vertices() == 4
assert tc.num_simplices() == 0
@@ -48,11 +36,17 @@ def test_tangential():
assert st.num_simplices() == 6
assert st.num_vertices() == 4
-
- assert st.get_filtration() == \
- [([0], 0.0), ([1], 0.0), ([2], 0.0), ([0, 2], 0.0), ([3], 0.0), ([1, 3], 0.0)]
+
+ assert st.get_filtration() == [
+ ([0], 0.0),
+ ([1], 0.0),
+ ([2], 0.0),
+ ([0, 2], 0.0),
+ ([3], 0.0),
+ ([1, 3], 0.0),
+ ]
assert st.get_cofaces([0], 1) == [([0, 2], 0.0)]
-
+
assert point_list[0] == tc.get_point(0)
assert point_list[1] == tc.get_point(1)
assert point_list[2] == tc.get_point(2)