Bottleneck_distance_interface.h
1 /* This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
2  * See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
3  * Author(s): Vincent Rouvreau
4  *
5  * Copyright (C) 2016 Inria
6  *
7  * Modification(s):
8  * - YYYY/MM Author: Description of the modification
9  */
10 
11 #ifndef INCLUDE_BOTTLENECK_DISTANCE_INTERFACE_H_
12 #define INCLUDE_BOTTLENECK_DISTANCE_INTERFACE_H_
13 
14 #include <gudhi/Bottleneck.h>
15 
16 #include <iostream>
17 #include <vector>
18 #include <utility> // for std::pair
19 
20 namespace Gudhi {
21 
22 namespace persistence_diagram {
23 
24  // bottleneck_distance function renamed for the python function can be called bottleneck_dstance
25  double bottleneck(const std::vector<std::pair<double, double>>& diag1,
26  const std::vector<std::pair<double, double>>& diag2,
27  double e) {
28  return bottleneck_distance(diag1, diag2, e);
29  }
30 
31  double bottleneck(const std::vector<std::pair<double, double>>& diag1,
32  const std::vector<std::pair<double, double>>& diag2) {
33  return bottleneck_distance(diag1, diag2);
34  }
35 
36 } // namespace persistence_diagram
37 
38 } // namespace Gudhi
39 
40 
41 #endif // INCLUDE_BOTTLENECK_DISTANCE_INTERFACE_H_
double bottleneck_distance(const Persistence_diagram1 &diag1, const Persistence_diagram2 &diag2, double e=(std::numeric_limits< double >::min)())
Function to compute the Bottleneck distance between two persistence diagrams.
Definition: Bottleneck.h:116
GUDHIdev  Version 3.5.0  - C++ library for Topological Data Analysis (TDA) and Higher Dimensional Geometry Understanding.  - Copyright : MIT Generated on Wed Apr 6 2022 19:26:28 for GUDHIdev by Doxygen 1.9.1