1 files changed, 0 insertions, 57 deletions
diff --git a/src/Gudhi_stat/example/utilities/persistence_intervals/compute_number_of_dominant_intervals.cpp b/src/Gudhi_stat/example/utilities/persistence_intervals/compute_number_of_dominant_intervals.cpp
deleted file mode 100644
index 6e6a9c88..00000000
--- a/src/Gudhi_stat/example/utilities/persistence_intervals/compute_number_of_dominant_intervals.cpp
+++ /dev/null
@@ -1,57 +0,0 @@
-/*    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 Sophia-Saclay (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>
-
-
-
-using namespace Gudhi;
-using namespace Gudhi::Gudhi_stat;
-
-using namespace std;
-
-
-int main( int argc , char** argv )
-{
-	std::cout << "This program compute the dominant intervals. A number of intervals to be displayed is a parameter of this program. \n";
-	if ( argc != 3 )
-	{
-		cout << "To run this program, please provide the name of a file with persistence diagram and number of dominant intervals you would like to get \n";
-		return 1;
-	}
-
-	Persistence_intervals p( argv[1] );
-	std::vector< std::pair<double,double> > dominant_intervals = p.dominant_intervals( atoi( argv[2] ) );
-	cout << "Here are the dominant intervals : " << endl;
-	for ( size_t i = 0 ; i != dominant_intervals.size() ; ++i )
-	{
-		cout << " " << dominant_intervals[i].first<< "," << dominant_intervals[i].second  << " "<< endl;
-	}
-	
-	return 0;
-}