diff options
Diffstat (limited to 'concept/Bottleneck_distance/Persistence_diagram.h')
| -rw-r--r-- | concept/Bottleneck_distance/Persistence_diagram.h | 50 |
1 files changed, 0 insertions, 50 deletions
diff --git a/concept/Bottleneck_distance/Persistence_diagram.h b/concept/Bottleneck_distance/Persistence_diagram.h deleted file mode 100644 index d016faf4..00000000 --- a/concept/Bottleneck_distance/Persistence_diagram.h +++ /dev/null @@ -1,50 +0,0 @@ -/* This file is part of the Gudhi Library. The Gudhi library - * (Geometric Understanding in Higher Dimensions) is a generic C++ - * library for computational topology. - * - * Author: François Godi - * - * Copyright (C) 2015 Inria - * - * This program is free software: you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation, either version 3 of the License, or - * (at your option) any later version. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with this program. If not, see <http://www.gnu.org/licenses/>. - */ - -#ifndef CONCEPT_BOTTLENECK_DISTANCE_PERSISTENCE_DIAGRAM_H_ -#define CONCEPT_BOTTLENECK_DISTANCE_PERSISTENCE_DIAGRAM_H_ - -namespace Gudhi { - -namespace persistence_diagram { - -/** \brief 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. - * - * \ingroup bottleneck_distance - */ -struct DiagramPoint{}; - -/** \brief Concept of persistence diagram. It is a range of `DiagramPoint`. - * std::begin(diagram) and std::end(diagram) must return corresponding iterators. - * - * \ingroup bottleneck_distance - */ -struct PersistenceDiagram{}; - -} // namespace persistence_diagram - -} // namespace Gudhi - -#endif // CONCEPT_BOTTLENECK_DISTANCE_PERSISTENCE_DIAGRAM_H_ |