blob: 91f4ef7562286a955bdb5986b4175e3209bb03e1 (
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
|
/* 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): Clément Maria
*
* Copyright (C) 2014 INRIA Sophia Antipolis-Méditerranée (France)
*
* 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 GUDHI_SIMPLEX_TREE_NODE_EXPLICIT_STORAGE_H
#define GUDHI_SIMPLEX_TREE_NODE_EXPLICIT_STORAGE_H
#include <vector>
#include <iostream>
namespace Gudhi{
/* \addtogroup simplex_tree
* Represents a node of a Simplex_tree.
* @{
*/
/*
* \brief Node of a simplex tree with filtration value
* and simplex key.
*
* It stores explicitely its own filtration value and its own Simplex_key.
*/
template < class SimplexTree >
class Simplex_tree_node_explicit_storage {
public:
// friend SimplexTree;
typedef typename SimplexTree::Siblings Siblings;
typedef typename SimplexTree::Filtration_value Filtration_value;
typedef typename SimplexTree::Simplex_key Simplex_key;
//private:
//friend class Simplex_tree;
// Default constructor.
Simplex_tree_node_explicit_storage() :
children_(NULL),
simplex_key_(-1),
filtration_(0) {}
Simplex_tree_node_explicit_storage(Siblings * sib,
Filtration_value filtration) :
children_(sib),
simplex_key_(-1),
filtration_(filtration) {}
void assign_key(Simplex_key key) { simplex_key_ = key; }
/*
* Return true if the node has children,
* false otherwise.
*/
//bool has_children(Vertex label)
//{ //if(children_ == NULL) return false; //for root simplices
// return (children_->parent() == label);}
/*
* Assign a children to the node
*/
void assign_children (Siblings * children) { children_ = children; }
/*
*
*/
void assign_filtration(double filtration_value) { filtration_ = filtration_value; }
Filtration_value filtration() { return filtration_; }
/* Careful -> has_children() must be true*/
Siblings * children() { return children_; }
Simplex_key key() { return simplex_key_; }
private:
Siblings * children_;
// Data attached to simplex, explicit storage
Simplex_key simplex_key_;
Filtration_value filtration_; //value in the filtration
};
/* @} */ //end addtogroup simplex_tree
} // namespace GUDHI
#endif // GUDHI_SIMPLEX_TREE_NODE_EXPLICIT_STORAGE_H
|
