1 files changed, 73 insertions, 0 deletions
diff --git a/src/Gudhi_stat/utilities/persistence_vectors/average_persistence_vectors.cpp b/src/Gudhi_stat/utilities/persistence_vectors/average_persistence_vectors.cpp
new file mode 100644
index 00000000..320d1f63
--- /dev/null
+++ b/src/Gudhi_stat/utilities/persistence_vectors/average_persistence_vectors.cpp
@@ -0,0 +1,73 @@
+/*    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/Persistence_vectors.h>
+
+
+
+using namespace Gudhi;
+using namespace Gudhi::Persistence_representations;
+
+#include <iostream>
+
+
+int main( int argc , char** argv )
+{
+	std::cout << "This program computes average persistence vector of persistence vectors created based on persistence diagrams provided as an input. \n";
+	std::cout << "Please call this program with the names of files with persistence diagrams \n";
+	std::vector< const char* > filenames;
+	
+	if ( argc == 1 )
+	{
+		std::cout << "No input files given, the program will now terminate \n";
+		return 1;
+	}
+	
+	for ( int i = 1 ; i < argc ; ++i )
+	{
+		filenames.push_back( argv[i] );
+	}
+	
+	std::cout << "Reading persistence vectors...\n";
+	std::vector< Vector_distances_in_diagram< Euclidean_distance >* > lands;
+	for ( size_t i = 0 ; i != filenames.size() ; ++i )
+	{		
+		Vector_distances_in_diagram< Euclidean_distance >* l = new Vector_distances_in_diagram< Euclidean_distance >;
+		l->load_from_file( filenames[i] );
+		lands.push_back(l );
+	}
+	
+	Vector_distances_in_diagram< Euclidean_distance > av;
+	av.compute_average( lands );
+	
+	av.print_to_file( "average.vect" );
+	
+	for ( size_t i = 0 ; i != filenames.size() ; ++i )
+	{
+		delete lands[i];
+	}
+	
+	std::cout << "Done \n";
+
+	return 0;
+}