summaryrefslogtreecommitdiff
path: root/src/Bottleneck_distance/doc/Intro_bottleneck_distance.h
diff options
context:
space:
mode:
Diffstat (limited to 'src/Bottleneck_distance/doc/Intro_bottleneck_distance.h')
-rw-r--r--src/Bottleneck_distance/doc/Intro_bottleneck_distance.h4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/Bottleneck_distance/doc/Intro_bottleneck_distance.h b/src/Bottleneck_distance/doc/Intro_bottleneck_distance.h
index 00e614f6..ccb558c5 100644
--- a/src/Bottleneck_distance/doc/Intro_bottleneck_distance.h
+++ b/src/Bottleneck_distance/doc/Intro_bottleneck_distance.h
@@ -37,10 +37,10 @@ namespace bottleneck_distance {
*
* Bottleneck distance measures the similarity between two persistence 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
+ * the points of the two diagrams (and also all the points of the diagonal) such that
* any couple of matched points are at distance at most b.
*
- * \image html perturb_pd.png Bottleneck distance is the length of the longest edge.
+ * \image html perturb_pd.png Bottleneck distance is the length of the longest edge on this picture.
*
*/
/** @} */ // end defgroup bottleneck_distance