diff options
| author | vrouvrea <vrouvrea@636b058d-ea47-450e-bf9e-a15bfbe3eedb> | 2018-03-05 13:38:57 +0000 |
|---|---|---|
| committer | vrouvrea <vrouvrea@636b058d-ea47-450e-bf9e-a15bfbe3eedb> | 2018-03-05 13:38:57 +0000 |
| commit | b3a64294af818c977804c4b67a317782d872e2b5 (patch) | |
| tree | 5877d208013369a58c71ae7128ae9292424e7a10 /src/Cech_complex/include/gudhi/Cech_complex.h | |
| parent | 3cd1e01f0b0d4fdb46f49ec640c389374ca2fe70 (diff) | |
Fix doc and tests
git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/cechcomplex_vincent@3262 636b058d-ea47-450e-bf9e-a15bfbe3eedb
Former-commit-id: c76eb981f5960938221aa2498cb87b0707391733
Diffstat (limited to 'src/Cech_complex/include/gudhi/Cech_complex.h')
| -rw-r--r-- | src/Cech_complex/include/gudhi/Cech_complex.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/Cech_complex/include/gudhi/Cech_complex.h b/src/Cech_complex/include/gudhi/Cech_complex.h index a50ed9fa..612c73c3 100644 --- a/src/Cech_complex/include/gudhi/Cech_complex.h +++ b/src/Cech_complex/include/gudhi/Cech_complex.h @@ -23,7 +23,7 @@ #ifndef CECH_COMPLEX_H_ #define CECH_COMPLEX_H_ -#include <gudhi/distance_functions.h> // for Gudhi::Squared_radius +#include <gudhi/distance_functions.h> // for Gudhi::Radius_distance #include <gudhi/graph_simplicial_complex.h> // for Gudhi::Proximity_graph #include <gudhi/Debug_utils.h> // for GUDHI_CHECK #include <gudhi/Cech_complex_blocker.h> // for Gudhi::cech_complex::Cech_blocker @@ -43,7 +43,7 @@ namespace cech_complex { * * \details * The data structure is a proximity graph, containing edges when the edge length is less or equal - * to a given max_radius. Edge length is computed from `Gudhi::Squared_radius` distance function. + * to a given max_radius. Edge length is computed from `Gudhi::Radius_distance` distance function. * * \tparam SimplicialComplexForProximityGraph furnishes `Vertex_handle` and `Filtration_value` type definition required * by `Gudhi::Proximity_graph`. |