From f1a8c07758aa66c3a95effd7a898e8a063b5f3ce Mon Sep 17 00:00:00 2001 From: fgodi Date: Fri, 16 Dec 2016 12:56:39 +0000 Subject: small modifications (doc) git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/bottleneck_integration@1899 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: e1a9e88af05611d3572830a719ca9ee0d042144e --- src/Bottleneck_distance/concept/Persistence_diagram.h | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'src/Bottleneck_distance/concept') diff --git a/src/Bottleneck_distance/concept/Persistence_diagram.h b/src/Bottleneck_distance/concept/Persistence_diagram.h index e4766628..2d841086 100644 --- a/src/Bottleneck_distance/concept/Persistence_diagram.h +++ b/src/Bottleneck_distance/concept/Persistence_diagram.h @@ -29,7 +29,7 @@ namespace bottleneck_distance { /** \brief Concept of Diagram_point. std::get<0>(point) must return the birth of the corresponding component and std::get<1>(point) its death. * A valid implementation of this concept is std::pair. - * Birth must be 0 or positive, death should be larger than birth, death can be std::numeric_limits::infinity() for components which stay alive. + * Death should be larger than birth, death can be std::numeric_limits::infinity() for components which stay alive. * * \ingroup bottleneck_distance */ -- cgit v1.2.3