diff options
author | pdlotko <pdlotko@636b058d-ea47-450e-bf9e-a15bfbe3eedb> | 2017-05-04 09:30:04 +0000 |
---|---|---|
committer | pdlotko <pdlotko@636b058d-ea47-450e-bf9e-a15bfbe3eedb> | 2017-05-04 09:30:04 +0000 |
commit | 176bf81a5f13a748e7449d8ec47ef809d507e9a6 (patch) | |
tree | b572459dd9b250e26a8fbceaf0ee8848de08a787 | |
parent | 51cce89377cd64a1726f0b281dff8e54fd15a0e2 (diff) |
Fixing Marc's comments
git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/gudhi_stat@2394 636b058d-ea47-450e-bf9e-a15bfbe3eedb
Former-commit-id: 24336d02a44474c9aaed8e6ce244f1f6bb2aed3b
-rw-r--r-- | src/Gudhi_stat/example/persistence_vectors.cpp | 2 | ||||
-rw-r--r-- | src/Gudhi_stat/include/gudhi/Persistence_vectors.h (renamed from src/Gudhi_stat/include/gudhi/persistence_vectors.h) | 0 | ||||
-rw-r--r-- | src/Gudhi_stat/include/gudhi/read_persistence_from_file.h | 211 | ||||
-rw-r--r-- | src/Gudhi_stat/test/CMakeLists.txt | 5 | ||||
-rw-r--r-- | src/Gudhi_stat/test/persistence_lanscapes_on_grid_test.cpp | 4 | ||||
-rw-r--r-- | src/Gudhi_stat/test/persistence_lanscapes_test.cpp | 30 | ||||
-rw-r--r-- | src/Gudhi_stat/test/vector_representation_test.cpp | 6 | ||||
-rw-r--r-- | src/Gudhi_stat/utilities/persistence_vectors/average_persistence_vectors.cpp | 2 | ||||
-rw-r--r-- | src/Gudhi_stat/utilities/persistence_vectors/compute_distance_of_persistence_vectors.cpp | 2 | ||||
-rw-r--r-- | src/Gudhi_stat/utilities/persistence_vectors/compute_scalar_product_of_persistence_vectors.cpp | 2 | ||||
-rw-r--r-- | src/Gudhi_stat/utilities/persistence_vectors/create_persistence_vectors.cpp | 2 | ||||
-rw-r--r-- | src/Gudhi_stat/utilities/persistence_vectors/plot_persistence_vectors.cpp | 2 |
12 files changed, 44 insertions, 224 deletions
diff --git a/src/Gudhi_stat/example/persistence_vectors.cpp b/src/Gudhi_stat/example/persistence_vectors.cpp index 70163fec..028d95eb 100644 --- a/src/Gudhi_stat/example/persistence_vectors.cpp +++ b/src/Gudhi_stat/example/persistence_vectors.cpp @@ -22,7 +22,7 @@ -#include <gudhi/persistence_vectors.h> +#include <gudhi/Persistence_vectors.h> #include <iostream> diff --git a/src/Gudhi_stat/include/gudhi/persistence_vectors.h b/src/Gudhi_stat/include/gudhi/Persistence_vectors.h index d623dd0d..d623dd0d 100644 --- a/src/Gudhi_stat/include/gudhi/persistence_vectors.h +++ b/src/Gudhi_stat/include/gudhi/Persistence_vectors.h diff --git a/src/Gudhi_stat/include/gudhi/read_persistence_from_file.h b/src/Gudhi_stat/include/gudhi/read_persistence_from_file.h index 39b3ca7b..f869f8e2 100644 --- a/src/Gudhi_stat/include/gudhi/read_persistence_from_file.h +++ b/src/Gudhi_stat/include/gudhi/read_persistence_from_file.h @@ -38,67 +38,6 @@ namespace Persistence_representations { -/** - * This procedure reads birth-death dagta from a file. We assume that in the file, there may be one type of string 'inf' or 'Inf'. If the second parameter of the program is set to -1, - * then those vales are ignored. If the second parameter of this program is set to a positive value, then the infinite intervals will be substituted by that number. -**/ -std::vector< std::pair< double,double > > read_persistence_file_that_may_contain_inf_string( const char* filename , double what_to_substitute_for_infinite_bar = -1 ) -{ - - bool dbg = true; - - std::ifstream in(filename); - if ( !in.good() ) - { - std::cerr << "The file : " << filename << " do not exist. The program will now terminate \n"; - throw "The file from which you are trying to read do not exist. The program will now terminate \n"; - } - - std::string line; - std::vector< std::pair<double,double> > barcode; - - while (!in.eof()) - { - getline(in,line); - if ( !(line.length() == 0 || line[0] == '#') ) - { - std::stringstream lineSS(line); - double beginn, endd; - if ( (line.find("inf") != std::string::npos) || (line.find("Inf") != std::string::npos) ) - { - if ( dbg ) - { - std::cerr << "This line: " << line << " contains infinite interval. We will skip it. \n"; - } - if ( what_to_substitute_for_infinite_bar != -1 ) - { - lineSS >> beginn; - endd = what_to_substitute_for_infinite_bar; - } - else - { - continue; - } - } - else - { - lineSS >> beginn; - lineSS >> endd; - } - if ( beginn > endd ) - { - std::swap(beginn,endd); - } - if ( dbg ) - { - std::cerr << "Getting an interval : " << beginn << "," << endd << std::endl; - } - barcode.push_back( std::make_pair( beginn , endd ) ); - } - } - return barcode; -}//readFileNames - /** * This procedure reads names of files which are stored in a file. @@ -130,7 +69,7 @@ std::vector< std::string > readFileNames( const char* filenameWithFilenames ) } else { - result.push_back( line.c_str() ); + result.push_back( line ); if (dbg){std::cerr << "Line after removing white spaces : " << line << std::endl;} } } @@ -140,140 +79,6 @@ std::vector< std::string > readFileNames( const char* filenameWithFilenames ) }//readFileNames -/** - * This method reads persistence from standalone file. The format of the file is as follows: - * In every line there are two numbers which denotes birth and death of a persistence interval. The file is not supposed to contains any nonwhite characters excet from digits. In particular symbols - * like 'inf' are not allowed. - * If begin of the interval is greater than the end of the interval, those two numbers are swapped. -**/ -std::vector< std::pair< double , double > > read_standard_persistence_file( const char* filename ) -{ - bool dbg = false; - - std::ifstream in; - in.open( filename ); - if ( !in.good() ) - { - std::cerr << "The file : " << filename << " do not exist. The program will now terminate \n"; - throw "The file from which you are trying to read the persistence landscape do not exist. The program will now terminate \n"; - } - - std::string line; - std::vector< std::pair<double,double> > barcode; - - while (!in.eof()) - { - getline(in,line); - if ( !(line.length() == 0 || line[0] == '#') ) - { - std::stringstream lineSS(line); - double beginn, endd; - lineSS >> beginn; - lineSS >> endd; - if ( beginn == endd )continue; - if ( beginn > endd ) - { - std::swap(beginn,endd); - } - barcode.push_back( std::make_pair( beginn , endd ) ); - if (dbg) - { - std::cerr << beginn << " , " << endd << std::endl; - } - } - } - in.close(); - return barcode; -}//read_standard_file - - - -/** - * This procedure reads Gudhi style file. The format of a Gudhi style file is as follows: - * Each line consist of the following information: - * A prime number p indicating that the class is nontrivial over Z_p field. - * A positive numebr, being a dimension of a persistence class - * A birth and a death time of a class. - * Death time may be infitnity, in which case a string 'inf' is used. - * If begin of the interval is greater than the end of the interval, those two numbers are swapped. - * Note that this procedure reads persistence in a single dimension. The dimension of intervals that - * are to be read are determined by the second parameter of the function. -**/ -std::vector< std::pair< double , double > > read_gudhi_persistence_file_in_one_dimension( const char* filename , size_t dimension = 0 , double what_to_substitute_for_infinite_bar = -1) -{ - bool dbg = false; - std::ifstream in; - in.open( filename ); - if ( !in.good() ) - { - std::cerr << "The file : " << filename << " do not exist. The program will now terminate \n"; - throw "The file from which you are trying to read the persistence landscape do not exist. The program will now terminate \n"; - } - - - std::string line; - std::vector< std::pair<double,double> > barcode; - - while (!in.eof()) - { - getline(in,line); - if ( !(line.length() == 0 || line[0] == '#') ) - { - if ( line.find("inf") != std::string::npos ) - { - if ( dbg ) - { - std::cerr << "This line: " << line << " contains infinite interval. We will skip it. \n"; - } - if ( what_to_substitute_for_infinite_bar != -1 ) - { - double beginn, field, dim; - std::stringstream lineSS(line); - lineSS >> field; - lineSS >> dim; - lineSS >> beginn; - if ( dim == dimension ) - { - if ( beginn > what_to_substitute_for_infinite_bar ) - { - barcode.push_back( std::make_pair( what_to_substitute_for_infinite_bar , beginn ) ); - } - else - { - barcode.push_back( std::make_pair( beginn , what_to_substitute_for_infinite_bar ) ); - } - if (dbg) - { - std::cerr << beginn << " , " << what_to_substitute_for_infinite_bar << std::endl; - } - } - } - continue; - } - std::stringstream lineSS(line); - double beginn, endd, field, dim; - lineSS >> field; - lineSS >> dim; - lineSS >> beginn; - lineSS >> endd; - if ( beginn > endd ) - { - std::swap(beginn,endd); - } - if ( dim == dimension ) - { - barcode.push_back( std::make_pair( beginn , endd ) ); - if (dbg) - { - std::cerr << beginn << " , " << endd << std::endl; - } - } - } - } - in.close(); - return barcode; -}//read_gudhi_file - std::vector< std::vector< double > > read_numbers_from_file_line_by_line( const char* filename ) { @@ -315,14 +120,14 @@ std::vector< std::vector< double > > read_numbers_from_file_line_by_line( const /** * Universal procedure to read files with persistence. It ignores the lines starting from # (treat them as comments). * It reads the fist line which is not a comment and assume that there are some numerical entries over there. The program assume - * that each other line in the file, which is not a comment, have the same number of numerical entries. + * that each other line in the file, which is not a comment, have the same number of numerical entries (2, 3 or 4). * If there are two numerical entries per line, then the function assume that they are birth/death coordinates. * If there are three numerical entries per line, then the function assume that they are: dimension and birth/death coordinates. * If there are four numerical entries per line, then the function assume that they are: thc characteristic of a filed over which * persistence was computed, dimension and birth/death coordinates. * The procedure returns vector of persistence pairs. **/ -std::vector<std::pair<double,double>> read_persistence_intervals_in_one_dimension_from_file(std::string const& filename, int dimension=-1 , double what_to_substitute_for_infinite_bar = -1 ) +std::vector<std::pair<double,double> > read_persistence_intervals_in_one_dimension_from_file(std::string const& filename, int dimension=-1 , double what_to_substitute_for_infinite_bar = -1 ) { bool dbg = false; std::ifstream in; @@ -348,6 +153,7 @@ std::vector<std::pair<double,double>> read_persistence_intervals_in_one_dimensio if ( dbg )std::cerr << "Reading line : " << line << std::endl; if ( !(line.length() == 0 || line[0] == '#') ) { + //If we do not know how many entries per line we have, we check it in below. if ( number_of_entries_per_line == -1 ) { //check how many entries we have in the line. @@ -371,6 +177,7 @@ std::vector<std::pair<double,double>> read_persistence_intervals_in_one_dimensio throw "The input file you have provided have wrong number of numerical entries per line. The program will now terminate. \n"; } } + //In case there is an 'inf' string in this line, we are dealing with this situation in below. if ( line.find("inf") != std::string::npos ) { if ( dbg ) @@ -416,6 +223,7 @@ std::vector<std::pair<double,double>> read_persistence_intervals_in_one_dimensio } continue; } + //Then, we read the content of the line: std::stringstream lineSS(line); double beginn, endd, field, dim; if ( number_of_entries_per_line == 4 )lineSS >> field; @@ -441,6 +249,13 @@ std::vector<std::pair<double,double>> read_persistence_intervals_in_one_dimensio std::cerr << "This is a line that is going to the output : " << beginn << " , " << endd << std::endl; } } + else + { + if ( (number_of_entries_per_line==3) && (dimension == -1) ) + { + barcode.push_back( std::make_pair( beginn , endd ) ); + } + } } else { diff --git a/src/Gudhi_stat/test/CMakeLists.txt b/src/Gudhi_stat/test/CMakeLists.txt index 62335c77..b8e9cc48 100644 --- a/src/Gudhi_stat/test/CMakeLists.txt +++ b/src/Gudhi_stat/test/CMakeLists.txt @@ -113,3 +113,8 @@ add_test(NAME persistence_intervals_with_distances_test # XML format for Jenkins xUnit plugin --log_format=XML --log_sink=${CMAKE_SOURCE_DIR}/persistence_intervals_with_distances_test_UT.xml --log_level=test_suite --report_level=no) endif (NOT CGAL_WITH_EIGEN3_VERSION VERSION_LESS 4.8.1) + + + +#add_executable ( private_test private_test.cpp ) +#target_link_libraries(private_test ${Boost_SYSTEM_LIBRARY} ${Boost_UNIT_TEST_FRAMEWORK_LIBRARY}) diff --git a/src/Gudhi_stat/test/persistence_lanscapes_on_grid_test.cpp b/src/Gudhi_stat/test/persistence_lanscapes_on_grid_test.cpp index 971993ed..865a8280 100644 --- a/src/Gudhi_stat/test/persistence_lanscapes_on_grid_test.cpp +++ b/src/Gudhi_stat/test/persistence_lanscapes_on_grid_test.cpp @@ -229,10 +229,10 @@ BOOST_AUTO_TEST_CASE(check_computations_of_maxima_and_norms) BOOST_AUTO_TEST_CASE(check_default_parameters_of_distances ) { - std::vector< std::pair< double , double > > diag = read_standard_persistence_file( "data/file_with_diagram" ); + std::vector< std::pair< double , double > > diag = read_persistence_intervals_in_one_dimension_from_file( "data/file_with_diagram" ); Persistence_landscape_on_grid p( diag , 0. , 1. , 100 ); - std::vector< std::pair< double , double > > diag1 = read_standard_persistence_file( "data/file_with_diagram_1" ); + std::vector< std::pair< double , double > > diag1 = read_persistence_intervals_in_one_dimension_from_file( "data/file_with_diagram_1" ); Persistence_landscape_on_grid q( diag1 , 0. , 1. , 100 ); double dist_numeric_limit_max = p.distance( q,std::numeric_limits<double>::max() ); diff --git a/src/Gudhi_stat/test/persistence_lanscapes_test.cpp b/src/Gudhi_stat/test/persistence_lanscapes_test.cpp index e401e075..253b06d7 100644 --- a/src/Gudhi_stat/test/persistence_lanscapes_test.cpp +++ b/src/Gudhi_stat/test/persistence_lanscapes_test.cpp @@ -44,7 +44,7 @@ double epsilon = 0.0000005; BOOST_AUTO_TEST_CASE(check_construction_of_landscape) { - std::vector< std::pair< double , double > > diag = read_standard_persistence_file( "data/file_with_diagram" ); + std::vector< std::pair< double , double > > diag = read_persistence_intervals_in_one_dimension_from_file( "data/file_with_diagram" ); Persistence_landscape p( diag ); Persistence_landscape q; q.load_landscape_from_file( "data/file_with_landscape_from_file_with_diagram" ); @@ -64,7 +64,7 @@ BOOST_AUTO_TEST_CASE(check_construction_of_landscape_form_gudhi_style_file) BOOST_AUTO_TEST_CASE(check_computations_of_integrals) { - std::vector< std::pair< double , double > > diag = read_standard_persistence_file( "data/file_with_diagram" ); + std::vector< std::pair< double , double > > diag = read_persistence_intervals_in_one_dimension_from_file( "data/file_with_diagram" ); Persistence_landscape p( diag ); double integral = p.compute_integral_of_landscape(); //cerr << integral << " " << 2.34992 << endl; @@ -74,7 +74,7 @@ BOOST_AUTO_TEST_CASE(check_computations_of_integrals) BOOST_AUTO_TEST_CASE(check_computations_of_integrals_for_each_level_separatelly) { - std::vector< std::pair< double , double > > diag = read_standard_persistence_file( "data/file_with_diagram" ); + std::vector< std::pair< double , double > > diag = read_persistence_intervals_in_one_dimension_from_file( "data/file_with_diagram" ); Persistence_landscape p( diag ); std::vector< double > integrals_fir_different_levels; @@ -118,7 +118,7 @@ BOOST_AUTO_TEST_CASE(check_computations_of_integrals_for_each_level_separatelly) BOOST_AUTO_TEST_CASE(check_computations_of_integrals_of_powers_of_landscape) { - std::vector< std::pair< double , double > > diag = read_standard_persistence_file( "data/file_with_diagram" ); + std::vector< std::pair< double , double > > diag = read_persistence_intervals_in_one_dimension_from_file( "data/file_with_diagram" ); Persistence_landscape p( diag ); std::vector<double> integrals_fir_different_powers; @@ -137,7 +137,7 @@ BOOST_AUTO_TEST_CASE(check_computations_of_integrals_of_powers_of_landscape) BOOST_AUTO_TEST_CASE(check_computations_of_values_on_different_points) { - std::vector< std::pair< double , double > > diag = read_standard_persistence_file( "data/file_with_diagram" ); + std::vector< std::pair< double , double > > diag = read_persistence_intervals_in_one_dimension_from_file( "data/file_with_diagram" ); Persistence_landscape p( diag ); @@ -158,7 +158,7 @@ BOOST_AUTO_TEST_CASE(check_computations_of_values_on_different_points) BOOST_AUTO_TEST_CASE(check_computations_sum_differences_and_multiplications) { - std::vector< std::pair< double , double > > diag = read_standard_persistence_file( "data/file_with_diagram" ); + std::vector< std::pair< double , double > > diag = read_persistence_intervals_in_one_dimension_from_file( "data/file_with_diagram" ); Persistence_landscape p( diag ); Persistence_landscape second; second.load_landscape_from_file("data/file_with_landscape_from_file_with_diagram_1" ); @@ -186,7 +186,7 @@ BOOST_AUTO_TEST_CASE(check_computations_sum_differences_and_multiplications) BOOST_AUTO_TEST_CASE(check_computations_of_maxima_and_norms) { - std::vector< std::pair< double , double > > diag = read_standard_persistence_file( "data/file_with_diagram" ); + std::vector< std::pair< double , double > > diag = read_persistence_intervals_in_one_dimension_from_file( "data/file_with_diagram" ); Persistence_landscape p( diag ); Persistence_landscape second; second.load_landscape_from_file("data/file_with_landscape_from_file_with_diagram_1" ); @@ -204,10 +204,10 @@ BOOST_AUTO_TEST_CASE(check_computations_of_maxima_and_norms) BOOST_AUTO_TEST_CASE(check_default_parameters_of_distances ) { - std::vector< std::pair< double , double > > diag = read_standard_persistence_file( "data/file_with_diagram" ); + std::vector< std::pair< double , double > > diag = read_persistence_intervals_in_one_dimension_from_file( "data/file_with_diagram" ); Persistence_landscape p( diag ); - std::vector< std::pair< double , double > > diag1 = read_standard_persistence_file( "data/file_with_diagram_1" ); + std::vector< std::pair< double , double > > diag1 = read_persistence_intervals_in_one_dimension_from_file( "data/file_with_diagram_1" ); Persistence_landscape q( diag1 ); double dist_numeric_limit_max = p.distance( q,std::numeric_limits<double>::max() ); @@ -218,9 +218,9 @@ BOOST_AUTO_TEST_CASE(check_default_parameters_of_distances ) BOOST_AUTO_TEST_CASE(check_computations_of_averages) { - std::vector< std::pair< double , double > > diag = read_standard_persistence_file( "data/file_with_diagram" ); + std::vector< std::pair< double , double > > diag = read_persistence_intervals_in_one_dimension_from_file( "data/file_with_diagram" ); Persistence_landscape p( diag ); - std::vector< std::pair< double , double > > diag2 = read_standard_persistence_file( "data/file_with_diagram_1" ); + std::vector< std::pair< double , double > > diag2 = read_persistence_intervals_in_one_dimension_from_file( "data/file_with_diagram_1" ); Persistence_landscape q( diag2 ); Persistence_landscape av; av.compute_average( {&p,&q} ); @@ -235,9 +235,9 @@ BOOST_AUTO_TEST_CASE(check_computations_of_averages) BOOST_AUTO_TEST_CASE(check_computations_of_distances) { - std::vector< std::pair< double , double > > diag = read_standard_persistence_file( "data/file_with_diagram" ); + std::vector< std::pair< double , double > > diag = read_persistence_intervals_in_one_dimension_from_file( "data/file_with_diagram" ); Persistence_landscape p( diag ); - std::vector< std::pair< double , double > > diag2 = read_standard_persistence_file( "data/file_with_diagram_1" ); + std::vector< std::pair< double , double > > diag2 = read_persistence_intervals_in_one_dimension_from_file( "data/file_with_diagram_1" ); Persistence_landscape q( diag2 ); BOOST_CHECK( fabs( p.distance( q )- 25.5824) <= 0.00005 ); BOOST_CHECK( fabs( p.distance( q , 2) - 2.12636 ) <= 0.00001 ); @@ -247,9 +247,9 @@ BOOST_AUTO_TEST_CASE(check_computations_of_distances) BOOST_AUTO_TEST_CASE(check_computations_of_scalar_product) { - std::vector< std::pair< double , double > > diag = read_standard_persistence_file( "data/file_with_diagram" ); + std::vector< std::pair< double , double > > diag = read_persistence_intervals_in_one_dimension_from_file( "data/file_with_diagram" ); Persistence_landscape p( diag ); - std::vector< std::pair< double , double > > diag2 = read_standard_persistence_file( "data/file_with_diagram_1" ); + std::vector< std::pair< double , double > > diag2 = read_persistence_intervals_in_one_dimension_from_file( "data/file_with_diagram_1" ); Persistence_landscape q( diag2 ); BOOST_CHECK( fabs( p.compute_scalar_product( q ) - 0.754498 ) <= 0.00001 ); } diff --git a/src/Gudhi_stat/test/vector_representation_test.cpp b/src/Gudhi_stat/test/vector_representation_test.cpp index 3ef3427c..5e185445 100644 --- a/src/Gudhi_stat/test/vector_representation_test.cpp +++ b/src/Gudhi_stat/test/vector_representation_test.cpp @@ -21,7 +21,7 @@ */ -#include <gudhi/persistence_vectors.h> +#include <gudhi/Persistence_vectors.h> #include <gudhi/common_persistence_representations.h> #include <iostream> @@ -319,10 +319,10 @@ BOOST_AUTO_TEST_CASE(check_distance_computations) BOOST_AUTO_TEST_CASE(check_default_parameters_of_distances ) { - std::vector< std::pair< double , double > > diag = read_standard_persistence_file( "data/file_with_diagram" ); + std::vector< std::pair< double , double > > diag = read_persistence_intervals_in_one_dimension_from_file( "data/file_with_diagram" ); Vector_distances_in_diagram< Euclidean_distance > p( diag , 100 ); - std::vector< std::pair< double , double > > diag1 = read_standard_persistence_file( "data/file_with_diagram_1" ); + std::vector< std::pair< double , double > > diag1 = read_persistence_intervals_in_one_dimension_from_file( "data/file_with_diagram_1" ); Vector_distances_in_diagram< Euclidean_distance > q( diag1 , 100 ); double dist_numeric_limit_max = p.distance( q,std::numeric_limits<double>::max() ); diff --git a/src/Gudhi_stat/utilities/persistence_vectors/average_persistence_vectors.cpp b/src/Gudhi_stat/utilities/persistence_vectors/average_persistence_vectors.cpp index 126a0bf7..320d1f63 100644 --- a/src/Gudhi_stat/utilities/persistence_vectors/average_persistence_vectors.cpp +++ b/src/Gudhi_stat/utilities/persistence_vectors/average_persistence_vectors.cpp @@ -21,7 +21,7 @@ */ -#include <gudhi/persistence_vectors.h> +#include <gudhi/Persistence_vectors.h> diff --git a/src/Gudhi_stat/utilities/persistence_vectors/compute_distance_of_persistence_vectors.cpp b/src/Gudhi_stat/utilities/persistence_vectors/compute_distance_of_persistence_vectors.cpp index 3320defd..39e24cd7 100644 --- a/src/Gudhi_stat/utilities/persistence_vectors/compute_distance_of_persistence_vectors.cpp +++ b/src/Gudhi_stat/utilities/persistence_vectors/compute_distance_of_persistence_vectors.cpp @@ -20,7 +20,7 @@ * along with this program. If not, see <http://www.gnu.org/licenses/>. */ -#include <gudhi/persistence_vectors.h> +#include <gudhi/Persistence_vectors.h> diff --git a/src/Gudhi_stat/utilities/persistence_vectors/compute_scalar_product_of_persistence_vectors.cpp b/src/Gudhi_stat/utilities/persistence_vectors/compute_scalar_product_of_persistence_vectors.cpp index 3f6e9c6c..7a1bbaf0 100644 --- a/src/Gudhi_stat/utilities/persistence_vectors/compute_scalar_product_of_persistence_vectors.cpp +++ b/src/Gudhi_stat/utilities/persistence_vectors/compute_scalar_product_of_persistence_vectors.cpp @@ -20,7 +20,7 @@ * along with this program. If not, see <http://www.gnu.org/licenses/>. */ -#include <gudhi/persistence_vectors.h> +#include <gudhi/Persistence_vectors.h> diff --git a/src/Gudhi_stat/utilities/persistence_vectors/create_persistence_vectors.cpp b/src/Gudhi_stat/utilities/persistence_vectors/create_persistence_vectors.cpp index fd8b544c..634bcb13 100644 --- a/src/Gudhi_stat/utilities/persistence_vectors/create_persistence_vectors.cpp +++ b/src/Gudhi_stat/utilities/persistence_vectors/create_persistence_vectors.cpp @@ -20,7 +20,7 @@ * along with this program. If not, see <http://www.gnu.org/licenses/>. */ -#include <gudhi/persistence_vectors.h> +#include <gudhi/Persistence_vectors.h> diff --git a/src/Gudhi_stat/utilities/persistence_vectors/plot_persistence_vectors.cpp b/src/Gudhi_stat/utilities/persistence_vectors/plot_persistence_vectors.cpp index f52e6044..c72fc1ee 100644 --- a/src/Gudhi_stat/utilities/persistence_vectors/plot_persistence_vectors.cpp +++ b/src/Gudhi_stat/utilities/persistence_vectors/plot_persistence_vectors.cpp @@ -20,7 +20,7 @@ * along with this program. If not, see <http://www.gnu.org/licenses/>. */ -#include <gudhi/persistence_vectors.h> +#include <gudhi/Persistence_vectors.h> |