summaryrefslogtreecommitdiff
path: root/src/Witness_complex/example/example_witness_complex_persistence.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'src/Witness_complex/example/example_witness_complex_persistence.cpp')
-rw-r--r--src/Witness_complex/example/example_witness_complex_persistence.cpp28
1 files changed, 2 insertions, 26 deletions
diff --git a/src/Witness_complex/example/example_witness_complex_persistence.cpp b/src/Witness_complex/example/example_witness_complex_persistence.cpp
index b1b415fa..00f00aae 100644
--- a/src/Witness_complex/example/example_witness_complex_persistence.cpp
+++ b/src/Witness_complex/example/example_witness_complex_persistence.cpp
@@ -1,25 +1,3 @@
-/* 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): Siargey Kachanovich
- *
- * Copyright (C) 2016 INRIA (France)
- *
- * 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/>.
- */
-
#include <gudhi/Simplex_tree.h>
#include <gudhi/Witness_complex.h>
#include <gudhi/Persistent_cohomology.h>
@@ -81,10 +59,8 @@ int main(int argc, char * argv[]) {
Gudhi::subsampling::pick_n_random_points(witnesses, nbL, std::back_inserter(landmarks));
// Compute witness complex
- Witness_complex witness_complex(landmarks.begin(),
- landmarks.end(),
- witnesses.begin(),
- witnesses.end());
+ Witness_complex witness_complex(landmarks,
+ witnesses);
witness_complex.create_complex(simplex_tree, max_squared_alpha);