=====================================  =====================================  =====================================
:Author: Francois Godi                 :Introduced in: GUDHI 1.4.0            :Copyright: GPL v3
=====================================  =====================================  =====================================
:Requires: CGAL ≥ 4.8.0
=====================================  =====================================  =====================================

+-------------------------------------------+----------------------------------------------------------------------+
| .. image::                                | Bottleneck distance measures the similarity between two persistence  |
|      img/perturb_pd.png                   | diagrams. It's the shortest distance b for which there exists a      |
|                                           | perfect matching between the points of the two diagrams (+ all the   |
|                                           | diagonal points) such that any couple of matched points are at       |
|                                           | distance at most b.                                                  |
+-------------------------------------------+----------------------------------------------------------------------+
| :doc:`bottleneck_distance_user`           | :doc:`bottleneck_distance_ref`                                       |
+-------------------------------------------+----------------------------------------------------------------------+