diff options
author | Hind-M <hind.montassif@gmail.com> | 2021-09-30 11:05:17 +0200 |
---|---|---|
committer | Hind-M <hind.montassif@gmail.com> | 2021-09-30 11:05:17 +0200 |
commit | 767d9fca5da2d3dd9698a5c27e9bedc159271f67 (patch) | |
tree | defb85dddefbe6cd2064059baf9baeed0e72b87e /src/common/include/gudhi/graph_simplicial_complex.h | |
parent | 44f754ee58aeee043891f4494892798b9807374b (diff) |
Move minimal enclosing balls cache to Cech_complex.h instead of the blocker
Modify cech test to be more relevant regarding the current algorithm
Do some cleaning
Diffstat (limited to 'src/common/include/gudhi/graph_simplicial_complex.h')
-rw-r--r-- | src/common/include/gudhi/graph_simplicial_complex.h | 3 |
1 files changed, 0 insertions, 3 deletions
diff --git a/src/common/include/gudhi/graph_simplicial_complex.h b/src/common/include/gudhi/graph_simplicial_complex.h index 9190182c..da9dee7d 100644 --- a/src/common/include/gudhi/graph_simplicial_complex.h +++ b/src/common/include/gudhi/graph_simplicial_complex.h @@ -18,8 +18,6 @@ #include <map> #include <tuple> // for std::tie -#include <iostream> - namespace Gudhi { /** @file * @brief Graph simplicial complex methods @@ -78,7 +76,6 @@ Proximity_graph<SimplicialComplexForProximityGraph> compute_proximity_graph( for (auto it_u = points.begin(); it_u != points.end(); ++it_u) { idx_v = idx_u + 1; for (auto it_v = it_u + 1; it_v != points.end(); ++it_v, ++idx_v) { - std::clog << "#idx_u" << idx_u << "#idx_v " << idx_v << std::endl; fil = distance(*it_u, *it_v); if (fil <= threshold) { edges.emplace_back(idx_u, idx_v); |