23 #ifndef INCLUDE_BOTTLENECK_DISTANCE_INTERFACE_H_ 24 #define INCLUDE_BOTTLENECK_DISTANCE_INTERFACE_H_ 26 #include <gudhi/Bottleneck.h> 34 namespace persistence_diagram {
37 double bottleneck(
const std::vector<std::pair<double, double>>& diag1,
38 const std::vector<std::pair<double, double>>& diag2,
43 double bottleneck(
const std::vector<std::pair<double, double>>& diag1,
44 const std::vector<std::pair<double, double>>& diag2) {
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:103