blob: 1ab768ba7cda37257a1acdc28443d111eb7d776a (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
|
/* 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(s): François Godi
*
* Copyright (C) 2016 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 bottleneck_distance {
/** \brief Concept of persistence diagram point. get<0>() must return the birth of the component and get<1>() its death.
*
* \ingroup bottleneck_distance
*/
struct Diagram_point{
double get<int>();
};
/** \brief Concept of persistence diagram. It's a range of Diagram_point.
*
* \ingroup bottleneck_distance
*/
struct Persistence_Diagram
{
const_iterator<Diagram_point> begin();
const_iterator<Diagram_point> end();
};
} // namespace bottleneck_distance
} // namespace Gudhi
#endif // CONCEPT_BOTTLENECK_DISTANCE_PERSISTENCE_DIAGRAM_H_
|
