11#ifndef INCLUDE_BOTTLENECK_DISTANCE_INTERFACE_H_
12#define INCLUDE_BOTTLENECK_DISTANCE_INTERFACE_H_
14#include <gudhi/Bottleneck.h>
22namespace persistence_diagram {
25 double bottleneck(
const std::vector<std::pair<double, double>>& diag1,
26 const std::vector<std::pair<double, double>>& diag2,
31 double bottleneck(
const std::vector<std::pair<double, double>>& diag1,
32 const std::vector<std::pair<double, double>>& diag2) {
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