From 854e61dc5f31ab4528c104119007276a81916293 Mon Sep 17 00:00:00 2001 From: vrouvrea Date: Wed, 28 Sep 2016 05:57:24 +0000 Subject: Fix bottleneck doxygen issues git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/bottleneck_integration@1574 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: d85f8399427bb2518650adaf5f9e849b53e13048 --- src/Bottleneck_distance/doc/Intro_bottleneck_distance.h | 6 +++--- 1 file changed, 3 insertions(+), 3 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 795bcbea..00e614f6 100644 --- a/src/Bottleneck_distance/doc/Intro_bottleneck_distance.h +++ b/src/Bottleneck_distance/doc/Intro_bottleneck_distance.h @@ -30,17 +30,17 @@ namespace bottleneck_distance { /** \defgroup bottleneck_distance Bottleneck distance * - * \author François Godi + * \author François Godi * @{ * * \section bottleneckdefinition Definition * - * Bottleneck distance mesures the similarity between two persistence diagrams. + * 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 * any couple of matched points are at distance at most b. * - * \image html perturb_pd.png La bottleneck distance est la longueur de la plus longue arĂȘte. + * \image html perturb_pd.png Bottleneck distance is the length of the longest edge. * */ /** @} */ // end defgroup bottleneck_distance -- cgit v1.2.3