blob: 145040fed1b84de4ab0d47d3fdd2b5baf7451424 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
|
/* 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 <http://www.gnu.org/licenses/>.
*/
#include <gudhi/reader_utils.h>
#include <gudhi/persistence_representations/Persistence_intervals.h>
#include <iostream>
#include <vector>
#include <limits>
using namespace Gudhi;
using namespace Gudhi::Gudhi_stat;
int main( int argc , char** argv )
{
//std::cout << "This program compute minimum birth and the maximum death time for a collection of persistence intervals \n";
//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<double,double> min_max_ = p.min_max();
//std::cout << "Birth-death range : min: " << min_max_.first << ", max: " << min_max_.second << endl;
std::vector< const char* > filenames;
for ( int i = 1 ; i < argc ; ++i )
{
filenames.push_back( argv[i] );
}
double min_ = std::numeric_limits<double>::max();
double max_ = -std::numeric_limits<double>::max();
for ( size_t file_no = 0 ; file_no != filenames.size() ; ++file_no )
{
std::cout << "Creating diagram based on a file : " << filenames[file_no] << std::endl;
Persistence_intervals p( filenames[file_no] );
std::pair<double,double> min_max_ = p.min_max();
if ( min_max_.first < min_ )min_ = min_max_.first;
if ( min_max_.second > max_ )max_ = min_max_.second;
}
std::cout << "Birth-death range : min: " << min_ << ", max: " << max_ << std::endl;
return 0;
}
|
