From 6dd7403da12dff125e1dedacbc2ed0ec67e643ba Mon Sep 17 00:00:00 2001 From: fgodi Date: Wed, 23 Nov 2016 14:55:25 +0000 Subject: Bottleneck.h git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/bottleneck_integration@1774 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: 3b2f26c67ceb8a61f3efe3952f0618fff98465e4 --- src/Bottleneck_distance/doc/Intro_bottleneck_distance.h | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'src/Bottleneck_distance/doc/Intro_bottleneck_distance.h') 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 -- cgit v1.2.3