summaryrefslogtreecommitdiff
path: root/src/Rips_complex
diff options
context:
space:
mode:
authorMarc Glisse <marc.glisse@inria.fr>2019-04-13 00:11:01 +0200
committerMarc Glisse <marc.glisse@inria.fr>2019-04-13 00:11:01 +0200
commit2b61f54fe23f5945e93cc625a83709b633b1e3d5 (patch)
tree5cb374d9c2eab85d26e1cdca9b0f6031ea7295e7 /src/Rips_complex
parent0191e039a08ccd68b9916fafb2da98260e5b4efb (diff)
Fix the documentation of what relation i and j satisfy in the lower triangular part of a matrix.
Diffstat (limited to 'src/Rips_complex')
-rw-r--r--src/Rips_complex/include/gudhi/Rips_complex.h2
-rw-r--r--src/Rips_complex/include/gudhi/Sparse_rips_complex.h2
2 files changed, 2 insertions, 2 deletions
diff --git a/src/Rips_complex/include/gudhi/Rips_complex.h b/src/Rips_complex/include/gudhi/Rips_complex.h
index e902e52c..ee100867 100644
--- a/src/Rips_complex/include/gudhi/Rips_complex.h
+++ b/src/Rips_complex/include/gudhi/Rips_complex.h
@@ -90,7 +90,7 @@ class Rips_complex {
* @param[in] threshold Rips value.
*
* \tparam DistanceMatrix must have a `size()` method and on which `distance_matrix[i][j]` returns
- * the distance between points \f$i\f$ and \f$j\f$ as long as \f$ 0 \leqslant i < j \leqslant
+ * the distance between points \f$i\f$ and \f$j\f$ as long as \f$ 0 \leqslant j < i \leqslant
* distance\_matrix.size().\f$
*/
template<typename DistanceMatrix>
diff --git a/src/Rips_complex/include/gudhi/Sparse_rips_complex.h b/src/Rips_complex/include/gudhi/Sparse_rips_complex.h
index 3aafc5ff..1e8fb6a3 100644
--- a/src/Rips_complex/include/gudhi/Sparse_rips_complex.h
+++ b/src/Rips_complex/include/gudhi/Sparse_rips_complex.h
@@ -87,7 +87,7 @@ class Sparse_rips_complex {
*
* @param[in] distance_matrix Range of range of distances.
* `distance_matrix[i][j]` returns the distance between points \f$i\f$ and
- * \f$j\f$ as long as \f$ 0 \leqslant i < j \leqslant
+ * \f$j\f$ as long as \f$ 0 \leqslant j < i \leqslant
* distance\_matrix.size().\f$
* @param[in] epsilon Approximation parameter. epsilon must be positive.
*/