Tweaks to the doc of Bottleneck.

git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/bottleneck-doc-glisse@1983 636b058d-ea47-450e-bf9e-a15bfbe3eedb

Former-commit-id: 5300e7c4cfd3ffe22fa7ec906a4193d99d95453b

1 files changed, 3 insertions, 3 deletions

diff --git a/src/Bottleneck_distance/doc/Intro_bottleneck_distance.h b/src/Bottleneck_distance/doc/Intro_bottleneck_distance.h
index 21187f9c..5223678d 100644
--- a/src/Bottleneck_distance/doc/Intro_bottleneck_distance.h
+++ b/src/Bottleneck_distance/doc/Intro_bottleneck_distance.h
@@ -26,7 +26,7 @@
 // needs namespace for Doxygen to link on classes
 namespace Gudhi {
 // needs namespace for Doxygen to link on classes
-namespace bottleneck_distance {
+namespace persistence_diagram {
 
 /**  \defgroup bottleneck_distance Bottleneck distance
  * 
@@ -35,7 +35,7 @@ namespace bottleneck_distance {
  * 
  * \section bottleneckdefinition Definition
  * 
- * The bottleneck distance measures the similarity between two persistence diagrams. It's the shortest distance b for which there exists a perfect matching between
+ * The bottleneck distance measures the similarity between two persistence diagrams. It is the shortest distance b for which there exists a perfect matching between
  * the points of the two diagrams (completed with all the points on the diagonal in order to ignore cardinality mismatchs) such that
  * any couple of matched points are at distance at most b.
  *
@@ -44,7 +44,7 @@ namespace bottleneck_distance {
  */
 /** @} */  // end defgroup bottleneck_distance
 
-}  // namespace bottleneck_distance
+}  // namespace persistence_diagram
 
 }  // namespace Gudhi