diff options
| author | Vincent Rouvreau <vincent.rouvreau@inria.fr> | 2022-12-09 15:11:14 +0100 |
|---|---|---|
| committer | Vincent Rouvreau <vincent.rouvreau@inria.fr> | 2022-12-09 15:11:14 +0100 |
| commit | 6b8da55930c5a76aefc6725d3cffb17bab5438d0 (patch) | |
| tree | 6c39f409cafca080530d268849c794ac5ed32929 | |
| parent | bd4e59cb2badaad716f8e543026e452bfdbfcec7 (diff) | |
code review: bad copy/paste of a comment
| -rw-r--r-- | src/Tangential_complex/include/gudhi/Tangential_complex.h | 3 |
1 files changed, 1 insertions, 2 deletions
diff --git a/src/Tangential_complex/include/gudhi/Tangential_complex.h b/src/Tangential_complex/include/gudhi/Tangential_complex.h index 1440bfc4..ab203ca5 100644 --- a/src/Tangential_complex/include/gudhi/Tangential_complex.h +++ b/src/Tangential_complex/include/gudhi/Tangential_complex.h @@ -625,8 +625,7 @@ class Tangential_complex { int max_dim = -1; - // Vertices to be inserted first by the create_complex method to avoid quadratic complexity. - // It isn't just [0, n) if some points have multiplicity (only one copy appears in the complex). + // Ordered vertices to be inserted first by the create_complex method to avoid quadratic complexity. std::vector<typename Simplex_tree_::Vertex_handle> vertices(m_points.size()); std::iota(vertices.begin(), vertices.end(), 0); tree.insert_batch_vertices(vertices); |