1 files changed, 72 insertions, 0 deletions
diff --git a/src/Gudhi_stat/utilities/persistence_intervals/compute_birth_death_range_in_persistence_diagram.cpp b/src/Gudhi_stat/utilities/persistence_intervals/compute_birth_death_range_in_persistence_diagram.cpp
new file mode 100644
index 00000000..2c55a806
--- /dev/null
+++ b/src/Gudhi_stat/utilities/persistence_intervals/compute_birth_death_range_in_persistence_diagram.cpp
@@ -0,0 +1,72 @@
+/*    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/abstract_classes/Abs_Topological_data.h>
+#include <gudhi/concretizations/Persistence_intervals.h>
+
+#include <iostream>
+#include <vector>
+#include <limits>
+
+
+
+using namespace Gudhi;
+using namespace Gudhi::Gudhi_stat;
+
+using namespace std;
+
+
+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 )
+	//{
+	//	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();
+	//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;
+	}
+	cout << "Birth-death range : min: " <<  min_ << ", max: " << max_ << endl;
+	return 0;
+}