/* 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): Pawel Dlotko
*
* Copyright (C) 2015 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
using namespace Gudhi;
using namespace Gudhi::Persistence_representations;
int main( int argc , char** argv )
{
if ( argc != 2 )
{
std::cout << "To run this program, please provide the name of a file with persistence diagram \n";
return 1;
}
Persistence_intervals p( argv[1] );
std::pair min_max_ = p.get_x_range();
std::cout << "Birth-death range : " << min_max_.first << " " << min_max_.second << std::endl;
std::vector dominant_ten_intervals_length = p.length_of_dominant_intervals(10);
std::cout << "Lendth of ten dominant intervals : " < > ten_dominant_intervals = p.dominant_intervals( 10 );
std::cout << "Here are the dominant intervals : " < histogram = p.histogram_of_lengths( 10 );
std::cout << "Here is the histogram of barcode's length : " < cumulative_histogram = p.cumulative_histogram_of_lengths( 10 );
std::cout<< "Cumuative histogram : " < char_funct_diag = p.characteristic_function_of_diagram( min_max_.first , min_max_.second );
std::cout << "Characteristic function of diagram : " < cumul_char_funct_diag = p.cumulative_characteristic_function_of_diagram( min_max_.first , min_max_.second );
std::cout << "Cumulative characteristic function of diagram : " < > pbns = p.compute_persistent_betti_numbers();
for ( size_t i = 0 ; i != pbns.size() ; ++i )
{
std::cout << pbns[i].first << " " << pbns[i].second <