diff options
Diffstat (limited to 'src/Persistence_representations/example/persistence_vectors.cpp')
-rw-r--r-- | src/Persistence_representations/example/persistence_vectors.cpp | 79 |
1 files changed, 37 insertions, 42 deletions
diff --git a/src/Persistence_representations/example/persistence_vectors.cpp b/src/Persistence_representations/example/persistence_vectors.cpp index 028d95eb..c41d261b 100644 --- a/src/Persistence_representations/example/persistence_vectors.cpp +++ b/src/Persistence_representations/example/persistence_vectors.cpp @@ -20,12 +20,9 @@ * along with this program. If not, see <http://www.gnu.org/licenses/>. */ - - #include <gudhi/Persistence_vectors.h> #include <iostream> - #include <gudhi/reader_utils.h> #include <vector> #include <cmath> @@ -34,47 +31,45 @@ using namespace Gudhi; using namespace Gudhi::Persistence_representations; +int main(int argc, char** argv) { + // create two simple vectors with birth--death pairs: + + std::vector<std::pair<double, double> > persistence1; + std::vector<std::pair<double, double> > persistence2; + + persistence1.push_back(std::make_pair(1, 2)); + persistence1.push_back(std::make_pair(6, 8)); + persistence1.push_back(std::make_pair(0, 4)); + persistence1.push_back(std::make_pair(3, 8)); + + persistence2.push_back(std::make_pair(2, 9)); + persistence2.push_back(std::make_pair(1, 6)); + persistence2.push_back(std::make_pair(3, 5)); + persistence2.push_back(std::make_pair(6, 10)); + + // create two persistence vectors based on persistence1 and persistence2: + Vector_distances_in_diagram<Euclidean_distance> v1 = + Vector_distances_in_diagram<Euclidean_distance>(persistence1, std::numeric_limits<size_t>::max()); + Vector_distances_in_diagram<Euclidean_distance> v2 = + Vector_distances_in_diagram<Euclidean_distance>(persistence2, std::numeric_limits<size_t>::max()); + + // writing to a stream: + std::cout << "v1 : " << v1 << std::endl; + std::cout << "v2 : " << v2 << std::endl; + + // averages: + Vector_distances_in_diagram<Euclidean_distance> average; + average.compute_average({&v1, &v2}); + std::cout << "Average : " << average << std::endl; + // computations of distances: + std::cout << "l^1 distance : " << v1.distance(v2) << std::endl; + // computations of scalar product: + std::cout << "Scalar product of l1 and l2 : " << v1.compute_scalar_product(v2) << std::endl; -int main( int argc , char** argv ) -{ - //create two simple vectors with birth--death pairs: - - std::vector< std::pair< double , double > > persistence1; - std::vector< std::pair< double , double > > persistence2; - - persistence1.push_back( std::make_pair(1,2) ); - persistence1.push_back( std::make_pair(6,8) ); - persistence1.push_back( std::make_pair(0,4) ); - persistence1.push_back( std::make_pair(3,8) ); - - persistence2.push_back( std::make_pair(2,9) ); - persistence2.push_back( std::make_pair(1,6) ); - persistence2.push_back( std::make_pair(3,5) ); - persistence2.push_back( std::make_pair(6,10) ); - - //create two persistence vectors based on persistence1 and persistence2: - Vector_distances_in_diagram<Euclidean_distance > v1 = Vector_distances_in_diagram<Euclidean_distance >( persistence1 , std::numeric_limits<size_t>::max() ); - Vector_distances_in_diagram<Euclidean_distance > v2 = Vector_distances_in_diagram<Euclidean_distance >( persistence2 , std::numeric_limits<size_t>::max() ); - - //writing to a stream: - std::cout << "v1 : " << v1 << std::endl; - std::cout << "v2 : " << v2 << std::endl; - - //averages: - Vector_distances_in_diagram<Euclidean_distance > average; - average.compute_average( {&v1,&v2} ); - std::cout << "Average : " << average << std::endl; - - //computations of distances: - std::cout << "l^1 distance : " << v1.distance( v2 ) << std::endl; - - //computations of scalar product: - std::cout << "Scalar product of l1 and l2 : " << v1.compute_scalar_product( v2 ) << std::endl; - - //create a file with a gnuplot script: - v1.plot( "plot_of_vector_representation" ); + // create a file with a gnuplot script: + v1.plot("plot_of_vector_representation"); - return 0; + return 0; } |