Bottleneck_distance_interface.h
1 /* This file is part of the Gudhi Library. The Gudhi library
2  * (Geometric Understanding in Higher Dimensions) is a generic C++
3  * library for computational topology.
4  *
5  * Author(s): Vincent Rouvreau
6  *
7  * Copyright (C) 2016 Inria
8  *
9  * This program is free software: you can redistribute it and/or modify
10  * it under the terms of the GNU General Public License as published by
11  * the Free Software Foundation, either version 3 of the License, or
12  * (at your option) any later version.
13  *
14  * This program is distributed in the hope that it will be useful,
15  * but WITHOUT ANY WARRANTY; without even the implied warranty of
16  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17  * GNU General Public License for more details.
18  *
19  * You should have received a copy of the GNU General Public License
20  * along with this program. If not, see <http://www.gnu.org/licenses/>.
21  */
22 
23 #ifndef INCLUDE_BOTTLENECK_DISTANCE_INTERFACE_H_
24 #define INCLUDE_BOTTLENECK_DISTANCE_INTERFACE_H_
25 
26 #include <gudhi/Bottleneck.h>
27 
28 #include <iostream>
29 #include <vector>
30 #include <utility> // for std::pair
31 
32 namespace Gudhi {
33 
34 namespace persistence_diagram {
35 
36  // bottleneck_distance function renamed for the python function can be called bottleneck_dstance
37  double bottleneck(const std::vector<std::pair<double, double>>& diag1,
38  const std::vector<std::pair<double, double>>& diag2,
39  double e) {
40  return bottleneck_distance(diag1, diag2, e);
41  }
42 
43  double bottleneck(const std::vector<std::pair<double, double>>& diag1,
44  const std::vector<std::pair<double, double>>& diag2) {
45  return bottleneck_distance(diag1, diag2);
46  }
47 
48 } // namespace persistence_diagram
49 
50 } // namespace Gudhi
51 
52 
53 #endif // INCLUDE_BOTTLENECK_DISTANCE_INTERFACE_H_
Definition: SimplicialComplexForAlpha.h:26
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:111
GUDHI  Version 2.2.0  - C++ library for Topological Data Analysis (TDA) and Higher Dimensional Geometry Understanding.  - Copyright : GPL v3 Generated on Tue Jul 17 2018 12:56:28 for GUDHI by Doxygen 1.8.13