summaryrefslogtreecommitdiff
path: root/src/Rips_complex
diff options
context:
space:
mode:
Diffstat (limited to 'src/Rips_complex')
-rw-r--r--src/Rips_complex/include/gudhi/Sparse_rips_complex.h4
-rw-r--r--src/Rips_complex/utilities/rips_correlation_matrix_persistence.cpp1
2 files changed, 3 insertions, 2 deletions
diff --git a/src/Rips_complex/include/gudhi/Sparse_rips_complex.h b/src/Rips_complex/include/gudhi/Sparse_rips_complex.h
index 19a44b28..4dcc08ed 100644
--- a/src/Rips_complex/include/gudhi/Sparse_rips_complex.h
+++ b/src/Rips_complex/include/gudhi/Sparse_rips_complex.h
@@ -54,7 +54,7 @@ namespace rips_complex {
template <typename Filtration_value>
class Sparse_rips_complex {
private:
- // TODO: use a different graph where we know we can safely insert in parallel.
+ // TODO(MG): use a different graph where we know we can safely insert in parallel.
typedef typename boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS,
boost::property<vertex_filtration_t, Filtration_value>,
boost::property<edge_filtration_t, Filtration_value>>
@@ -140,7 +140,7 @@ class Sparse_rips_complex {
put(vertex_filtration_t(), graph_, v, 0);
}
- // TODO:
+ // TODO(MG):
// - make it parallel
// - only test near-enough neighbors
for (int i = 0; i < n; ++i)
diff --git a/src/Rips_complex/utilities/rips_correlation_matrix_persistence.cpp b/src/Rips_complex/utilities/rips_correlation_matrix_persistence.cpp
index d4671b45..c78677d2 100644
--- a/src/Rips_complex/utilities/rips_correlation_matrix_persistence.cpp
+++ b/src/Rips_complex/utilities/rips_correlation_matrix_persistence.cpp
@@ -31,6 +31,7 @@
#include <string>
#include <vector>
#include <limits> // infinity
+#include <algorithm> // for sort
// Types definition
using Simplex_tree = Gudhi::Simplex_tree<Gudhi::Simplex_tree_options_fast_persistence>;