Gudhi::persistence_diagram::DiagramPoint Struct Reference

Concept of point in a persistence diagram. std::get<0>(point) must return the birth of the corresponding component and std::get<1>(point) its death. Both should be convertible to `double`

. A valid implementation of this concept is std::pair<double,double>. Death should be larger than birth, death can be std::numeric_limits<double>::infinity() for components which stay alive.
More...

Concept of point in a persistence diagram. std::get<0>(point) must return the birth of the corresponding component and std::get<1>(point) its death. Both should be convertible to `double`

. A valid implementation of this concept is std::pair<double,double>. Death should be larger than birth, death can be std::numeric_limits<double>::infinity() for components which stay alive.

The documentation for this struct was generated from the following file:

- concept/Bottleneck_distance/Persistence_diagram.h

GUDHI Version 2.3.0 - C++ library for Topological Data Analysis (TDA) and Higher Dimensional Geometry Understanding. - Copyright : GPL v3 | Generated on Tue Sep 4 2018 14:33:00 for GUDHI by Doxygen 1.8.13 |