From dc8731b3e43c9289004b474dcb0b97b2e03527c6 Mon Sep 17 00:00:00 2001 From: vrouvrea Date: Mon, 12 Dec 2016 16:56:47 +0000 Subject: Fix for doc review git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/distance_matrix_in_rips_module@1859 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: 3460f25024dc952a3313322111ffb1b3eef5abda --- src/Rips_complex/include/gudhi/Rips_complex.h | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) (limited to 'src') diff --git a/src/Rips_complex/include/gudhi/Rips_complex.h b/src/Rips_complex/include/gudhi/Rips_complex.h index 3260e500..d00372d8 100644 --- a/src/Rips_complex/include/gudhi/Rips_complex.h +++ b/src/Rips_complex/include/gudhi/Rips_complex.h @@ -47,8 +47,8 @@ namespace rips_complex { * \ingroup rips_complex * * \details - * The data structure is a one skeleton graph constructed from a point cloud, containing edges when the edge length is - * less or equal to a given threshold. Edge length is computed from a user given function. + * The data structure is a one skeleton graph, or Rips graph, constructed from a point cloud, containing edges when + * the edge length is less or equal to a given threshold. Edge length is computed from a user given function. * * The complex is a template class requiring a Filtration_value type. * @@ -90,7 +90,7 @@ class Rips_complex { [&](size_t i, size_t j){return distance_matrix[j][i];}); } - /** \brief Initializes the simplicial complex from the 1-skeleton graph and expands it until a given maximal + /** \brief Initializes the simplicial complex from the Rips graph and expands it until a given maximal * dimension. * * \tparam SimplicialComplexForRips must meet `SimplicialComplexForRips` concept. -- cgit v1.2.3