SkeletonBlockerDS.h
1 /* This file is part of the Gudhi Library. The Gudhi library
2  * (Geometric Understanding in Higher Dimensions) is a generic C++
3  * library for computational topology.
4  *
5  * Author(s): David Salinas
6  *
7  * Copyright (C) 2014 Inria
8  *
9  * This program is free software: you can redistribute it and/or modify
10  * it under the terms of the GNU General Public License as published by
11  * the Free Software Foundation, either version 3 of the License, or
12  * (at your option) any later version.
13  *
14  * This program is distributed in the hope that it will be useful,
15  * but WITHOUT ANY WARRANTY; without even the implied warranty of
16  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17  * GNU General Public License for more details.
18  *
19  * You should have received a copy of the GNU General Public License
20  * along with this program. If not, see <http://www.gnu.org/licenses/>.
21  */
22 
23 #ifndef CONCEPT_SKELETON_BLOCKER_SKELETONBLOCKERDS_H_
24 #define CONCEPT_SKELETON_BLOCKER_SKELETONBLOCKERDS_H_
25 
26 namespace Gudhi {
27 
28 namespace skeleton_blocker {
29 
40  typedef int boost_vertex_handle;
41 
60  boost_vertex_handle vertex;
61 
62  friend ostream& operator<<(ostream& o, const Root_vertex_handle & v);
63  };
64 
68  struct Vertex_handle {
69  boost_vertex_handle vertex;
70 
71  friend ostream& operator<<(ostream& o, const Vertex_handle & v);
72  };
73 
79  struct Graph_vertex {
83  void deactivate();
84 
87  void activate();
88 
91  bool is_active() const;
92 
93  void set_id(Root_vertex_handle i);
94  Root_vertex_handle get_id() const;
95  virtual string to_string() const;
96  friend ostream& operator<<(ostream& o, const Graph_vertex & v);
97  };
98 
103  struct Graph_edge {
107  void setId(Root_vertex_handle a, Root_vertex_handle b);
108 
112  Root_vertex_handle first() const;
113 
117  Root_vertex_handle second() const;
118 
119  friend ostream& operator<<(ostream& o, const Simple_edge & v);
120  };
121 };
122 
123 } // namespace skeleton_blocker
124 
125 namespace skbl = skeleton_blocker;
126 
127 } // namespace Gudhi
128 
129 #endif // CONCEPT_SKELETON_BLOCKER_SKELETONBLOCKERDS_H_
Definition: SimplicialComplexForAlpha.h:26
Root_vertex_handle and Vertex_handle are similar to global and local vertex descriptor used in boost ...
Definition: SkeletonBlockerDS.h:59
The type of edges that are stored the boost graph. An Edge must be Default Constructible and Equality...
Definition: SkeletonBlockerDS.h:103
Concept for the template class passed for Skeleton_blocker_complex. Most importantly, it contains the nodes for vertices and edges (Graph_vertex and Graph_edge) that are stored in the simplicial complex. The user can redefine these classes to attach additional information to vertices and edges.
Definition: SkeletonBlockerDS.h:36
The type of vertices that are stored the boost graph. A Vertex must be Default Constructible and Equa...
Definition: SkeletonBlockerDS.h:79
int boost_vertex_handle
index that allows to find the vertex in the boost graph
Definition: SkeletonBlockerDS.h:40
GUDHI  Version 2.2.0  - C++ library for Topological Data Analysis (TDA) and Higher Dimensional Geometry Understanding.  - Copyright : GPL v3 Generated on Thu Jun 14 2018 15:00:53 for GUDHI by Doxygen 1.8.13