summaryrefslogtreecommitdiff
path: root/src/Rips_complex/doc/Intro_rips_complex.h
diff options
context:
space:
mode:
Diffstat (limited to 'src/Rips_complex/doc/Intro_rips_complex.h')
-rw-r--r--src/Rips_complex/doc/Intro_rips_complex.h2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/Rips_complex/doc/Intro_rips_complex.h b/src/Rips_complex/doc/Intro_rips_complex.h
index e54ae57c..a2537036 100644
--- a/src/Rips_complex/doc/Intro_rips_complex.h
+++ b/src/Rips_complex/doc/Intro_rips_complex.h
@@ -55,7 +55,7 @@ namespace rips_complex {
* simplices with filtration value larger than some threshold, and keeping only
* the dim_max-skeleton. It may also be a good idea to start by making the
* point set sparser, for instance with
- * `Gudhi::subsampling::sparsify_point_set`, since small clusters of points
+ * `Gudhi::subsampling::sparsify_point_set()`, since small clusters of points
* have a disproportionate cost without affecting the persistence diagram much.
*
* In order to build this complex, the algorithm first builds the graph.