diff options
author | Marc Glisse <marc.glisse@inria.fr> | 2019-04-13 00:11:01 +0200 |
---|---|---|
committer | Marc Glisse <marc.glisse@inria.fr> | 2019-04-13 00:11:01 +0200 |
commit | 2b61f54fe23f5945e93cc625a83709b633b1e3d5 (patch) | |
tree | 5cb374d9c2eab85d26e1cdca9b0f6031ea7295e7 /src/Rips_complex/include/gudhi/Rips_complex.h | |
parent | 0191e039a08ccd68b9916fafb2da98260e5b4efb (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/include/gudhi/Rips_complex.h')
-rw-r--r-- | src/Rips_complex/include/gudhi/Rips_complex.h | 2 |
1 files changed, 1 insertions, 1 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> |