1 files changed, 0 insertions, 109 deletions
diff --git a/src/Gudhi_stat/example/utilities/persistence_landscapes/compute_distance_of_landscapes.cpp b/src/Gudhi_stat/example/utilities/persistence_landscapes/compute_distance_of_landscapes.cpp
deleted file mode 100644
index 12a4b3bd..00000000
--- a/src/Gudhi_stat/example/utilities/persistence_landscapes/compute_distance_of_landscapes.cpp
+++ /dev/null
@@ -1,109 +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/abstract_classes/Abs_Topological_data.h>
-#include <gudhi/concretizations/Persistence_landscape.h>
-
-
-
-using namespace Gudhi;
-using namespace Gudhi::Gudhi_stat;
-
-#include <iostream>
-#include <sstream>
-
-
-int main( int argc , char** argv )
-{
-	std::cout << "This program compute distance of persistence landscapes stored in a file (the file needs to be created beforehand). \n";	
-	std::cout << "The first parameter of a program is an interger p. The program compute L^p distance of the given landscapes. For L^infty distance choose p = -1. \n";
-	std::cout << "The remaining parameters of this programs are names of files with persistence landscapes.";
-	
-	if ( argc < 3 )
-	{
-		std::cout << "Wrong number of parameters, the program will now terminate \n";
-		return 1;
-	}
-	
-	int p = atoi( argv[1] );
-
-	std::vector< const char* > filenames;
-	for ( int i = 2 ; i < argc ; ++i )
-	{
-		filenames.push_back( argv[i] );
-	}
-	std::vector< Persistence_landscape > landscaspes;
-	landscaspes.reserve( filenames.size() );
-	for ( size_t file_no = 0 ; file_no != filenames.size() ; ++file_no )
-	{
-		std::cout << "Loading persistence landscape from a file : " << filenames[file_no] << std::endl;
-		Persistence_landscape l;
-		l.load_landscape_from_file( filenames[file_no] );
-		landscaspes.push_back( l );
-	}
-		
-	//and now we will compute the scalar product of landscapes.
-	
-	//first we prepare an array:
-	std::vector< std::vector< double > > distance( filenames.size() );
-	for ( size_t i = 0 ; i != filenames.size() ; ++i )
-	{
-		std::vector< double > v( filenames.size() , 0 );
-		distance[i] = v;
-	}
-	
-	//and now we can compute the distances:
-	for ( size_t i = 0 ; i != landscaspes.size() ; ++i )
-	{
-		for ( size_t j = i ; j != landscaspes.size() ; ++j )
-		{			
-			distance[i][j] = distance[j][i] = compute_discance_of_landscapes( landscaspes[i], landscaspes[j] , p ) ;
-			
-		}
-	}
-	
-	//and now output the result to the screen and a file:
-	ofstream out;
-	out.open( "distance" );
-	for ( size_t i = 0 ; i != distance.size() ; ++i )
-	{
-		for ( size_t j = 0 ; j != distance.size() ; ++j )
-		{
-			cout << distance[i][j] << " ";
-			out << distance[i][j] << " ";
-		}
-		cout << endl;
-		out << endl;
-	}
-	out.close();
-		
-	return 0;
-}
-
-
-
-
-
-
-