summaryrefslogtreecommitdiff
path: root/src/Persistent_cohomology/benchmark/performance_rips_persistence.cpp
diff options
context:
space:
mode:
authoralbert-github <albert.tests@gmail.com>2022-05-22 17:58:57 +0200
committeralbert-github <albert.tests@gmail.com>2022-05-22 17:58:57 +0200
commita00ce1990b112aa34f72e5504ae0cfe14f11e292 (patch)
tree73e3677a69d086b67d68d522ab69d068f74ee236 /src/Persistent_cohomology/benchmark/performance_rips_persistence.cpp
parenta163623da4e350f2e9de01144d74edfab1c28f78 (diff)
Spelling corrections
A number of spelling corrections as reported by the codespell (see: https://github.com/codespell-project/codespell) program and lists. Some remarks: - not considered are grammatical errors - not considered are names in the code although there are a number that could be improved (like `childs` -> `children`) - in the documentation it could be made clearer what are variables and what is running text (e.g. by placing variables in running text between backticks) - some comments are in the French language, I think it would be better to have them in the English (United States version).
Diffstat (limited to 'src/Persistent_cohomology/benchmark/performance_rips_persistence.cpp')
-rw-r--r--src/Persistent_cohomology/benchmark/performance_rips_persistence.cpp2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/Persistent_cohomology/benchmark/performance_rips_persistence.cpp b/src/Persistent_cohomology/benchmark/performance_rips_persistence.cpp
index 030b072a..3bec8830 100644
--- a/src/Persistent_cohomology/benchmark/performance_rips_persistence.cpp
+++ b/src/Persistent_cohomology/benchmark/performance_rips_persistence.cpp
@@ -49,7 +49,7 @@ void timing_persistence(FilteredComplex & cpx
* with a Hasse diagram. The Hasse diagram represents explicitly all
* codimension 1 incidence relations in the complex, and hence leads to
* a faster computation of persistence because boundaries are precomputed.
- * Hovewer, the simplex tree may be constructed directly from a point cloud and
+ * However, the simplex tree may be constructed directly from a point cloud and
* is more compact.
* We compute persistent homology with coefficient fields Z/2Z and Z/1223Z.
* We present also timings for the computation of multi-field persistent