From e778857da09c25ed351b5e77dcba319ce44fdb7f Mon Sep 17 00:00:00 2001 From: mcarrier Date: Thu, 10 May 2018 05:52:21 +0000 Subject: added betti sequences git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/kernels@3431 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: 4680471ce781468c247c40fb5e6eb699dce890c8 --- .../example/betti_sequence.cpp | 49 ++++++++++++++++++++++ 1 file changed, 49 insertions(+) create mode 100644 src/Persistence_representations/example/betti_sequence.cpp (limited to 'src/Persistence_representations/example/betti_sequence.cpp') diff --git a/src/Persistence_representations/example/betti_sequence.cpp b/src/Persistence_representations/example/betti_sequence.cpp new file mode 100644 index 00000000..a422a822 --- /dev/null +++ b/src/Persistence_representations/example/betti_sequence.cpp @@ -0,0 +1,49 @@ +/* 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): Mathieu Carriere + * + * Copyright (C) 2018 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 . + */ + +#include + +#include +#include +#include + +using Persistence_diagram = Gudhi::Persistence_representations::Persistence_diagram; +using BS = Gudhi::Persistence_representations::Betti_sequence; + +int main(int argc, char** argv) { + + Persistence_diagram persistence; + + persistence.push_back(std::make_pair(1, 2)); + persistence.push_back(std::make_pair(6, 8)); + persistence.push_back(std::make_pair(0, 4)); + persistence.push_back(std::make_pair(3, 8)); + + double min_x = 0; double max_x = 8; int res_x = 1000; + + BS bs(persistence, min_x, max_x, res_x); + std::vector B = bs.vectorize(); + + for(int i = 0; i < res_x; i++) std::cout << B[i] << ", "; + + return 0; +} -- cgit v1.2.3