diff options
author | Marc Glisse <marc.glisse@inria.fr> | 2020-10-17 19:14:09 +0200 |
---|---|---|
committer | Marc Glisse <marc.glisse@inria.fr> | 2020-10-17 19:14:09 +0200 |
commit | 7f2eefc474cb32dc5d566c5c370b03478c1996ac (patch) | |
tree | 07eac6218e929b6b6d80ee05a23bd7ebd9fbe27d /src/Bottleneck_distance/include/gudhi/Bottleneck.h | |
parent | 3cfbb32adf1725afe3a1a9d270f520788de5c5a1 (diff) |
Replace diameter (actually max y) with max distance to diagonal
Diffstat (limited to 'src/Bottleneck_distance/include/gudhi/Bottleneck.h')
-rw-r--r-- | src/Bottleneck_distance/include/gudhi/Bottleneck.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/Bottleneck_distance/include/gudhi/Bottleneck.h b/src/Bottleneck_distance/include/gudhi/Bottleneck.h index e466828a..ad437710 100644 --- a/src/Bottleneck_distance/include/gudhi/Bottleneck.h +++ b/src/Bottleneck_distance/include/gudhi/Bottleneck.h @@ -35,7 +35,7 @@ namespace persistence_diagram { inline double bottleneck_distance_approx(Persistence_graph& g, double e) { double b_lower_bound = 0.; - double b_upper_bound = g.diameter_bound(); + double b_upper_bound = g.max_dist_to_diagonal(); const double alpha = std::pow(g.size(), 1. / 5.); Graph_matching m(g); Graph_matching biggest_unperfect(g); |