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. More...
Classes | |
struct | Graph_edge |
The type of edges that are stored the boost graph. An Edge must be Default Constructible and Equality Comparable. More... | |
struct | Graph_vertex |
The type of vertices that are stored the boost graph. A Vertex must be Default Constructible and Equality Comparable. More... | |
struct | Root_vertex_handle |
Root_vertex_handle and Vertex_handle are similar to global and local vertex descriptor used in boost subgraphs and allow to localize a vertex of a subcomplex on its parent root complex. More... | |
struct | Vertex_handle |
Public Types | |
typedef int | boost_vertex_handle |
index that allows to find the vertex in the boost graph | |
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.
GUDHI Version 3.1.1 - C++ library for Topological Data Analysis (TDA) and Higher Dimensional Geometry Understanding. - Copyright : MIT | Generated on Fri Feb 7 2020 16:35:36 for GUDHI by Doxygen 1.8.13 |