1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
|
/* 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): Vincent Rouvreau
*
* Copyright (C) 2016 Inria
*
* 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/>.
*/
#ifndef INCLUDE_BOTTLENECK_DISTANCE_INTERFACE_H_
#define INCLUDE_BOTTLENECK_DISTANCE_INTERFACE_H_
#include <gudhi/Bottleneck.h>
#include <iostream>
#include <vector>
#include <utility> // for std::pair
namespace Gudhi {
namespace persistence_diagram {
// bottleneck_distance function renamed for the python function can be called bottleneck_dstance
double bottleneck(const std::vector<std::pair<double, double>>& diag1,
const std::vector<std::pair<double, double>>& diag2,
double e) {
return bottleneck_distance(diag1, diag2, e);
}
double bottleneck(const std::vector<std::pair<double, double>>& diag1,
const std::vector<std::pair<double, double>>& diag2) {
return bottleneck_distance(diag1, diag2);
}
} // namespace persistence_diagram
} // namespace Gudhi
#endif // INCLUDE_BOTTLENECK_DISTANCE_INTERFACE_H_
|
