| CGudhi::skbl::Blocker_iterator_around_vertex_internal< MapIteratorType, ReturnType > | Iterator through the blockers of a vertex |
| CGudhi::skbl::Blocker_iterator_internal< MapIteratorType, ReturnType > | Iterator through the blockers of a vertex |
| ▼CCoefficientField | Concept describing the requirements for a class to represent a field of coefficients to compute persistent homology |
| CGudhi::persistent_cohomology::Field_Zp | Structure representing the coefficient field  |
| CGudhi::persistent_cohomology::Multi_field | Structure representing coefficients in a set of finite fields simultaneously using the chinese remainder theorem |
| CGudhi::skbl::Complex_edge_iterator< SkeletonBlockerComplex > | Iterator on the edges of a simplicial complex |
| CGudhi::skbl::Complex_edge_iterator< Complex > | |
| CGudhi::skbl::Complex_vertex_iterator< SkeletonBlockerComplex > | Iterator on the vertices of a simplicial complex |
| CGudhi::contraction::Contraction_visitor< EdgeProfile > | Interface for a visitor of the edge contraction process |
| ▼CGudhi::contraction::Contraction_visitor< Profile > | |
| CGudhi::contraction::Contraction_visitor_remove_popable< Profile > | Visitor to remove popable blockers after an edge contraction |
| ▼CGudhi::contraction::Cost_policy< EdgeProfile > | Policy to specify the cost of contracting an edge |
| CGudhi::contraction::Edge_length_cost< EdgeProfile > | Return a cost corresponding to the squared length of the edge |
| ▼CFilteredComplex | The concept FilteredComplex describes the requirements for a type to implement a filtered cell complex, from which one can compute persistent homology via a model of the concept PersistentHomology |
| CGudhi::Hasse_complex< FiltrationValue, SimplexKey, VertexHandle > | Data structure representing a Hasse diagram, i.e. a complex where all codimension 1 incidence relations are explicitly encoded |
| CGudhi::Simplex_tree< IndexingTag, FiltrationValue, SimplexKey, VertexHandle > | Simplex Tree data structure for representing simplicial complexes |
| CFiltrationValue | Value type for a filtration function on a cell complex |
| ▼CGudhi::skbl::SkeletonBlockerDS::Graph_edge | The type of edges that are stored the boost graph. An Edge must be Default Constructible and Equality Comparable |
| CGudhi::skbl::SkeletonBlockerGeometricDS< GeometryTrait >::Graph_Edge | Edge that allows to access to an index. The indices of the edges are used to store heap information in the edge contraction algorithm |
| ▼CGudhi::skbl::SkeletonBlockerDS::Graph_vertex | The type of vertices that are stored the boost graph. A Vertex must be Default Constructible and Equality Comparable |
| CGudhi::skbl::SkeletonBlockerGeometricDS< GeometryTrait >::Graph_vertex | Vertex that stores a point |
| ▼CIndexingTag | Concept describing an indexing scheme (see FilteredComplex) for applying continuous maps to a cell complex, and compute its persistent homology |
| CGudhi::linear_indexing_tag | Tag for a linear ordering of simplices |
| CGudhi::Off_reader | |
| ▼CPersistentHomology | Concept describing the requirements for a class to compute persistent homology |
| CGudhi::persistent_cohomology::Persistent_cohomology< FilteredComplex, CoefficientField > | Computes the persistent cohomology of a filtered complex |
| ▼CGudhi::contraction::Placement_policy< EdgeProfile > | Policy to specify where the merged point had to be placed after an edge contraction |
| CGudhi::contraction::First_vertex_placement< EdgeProfile > | Places the contracted point onto the first point of the edge |
| CGudhi::skbl::Skeleton_blocker_simple_traits::Root_vertex_handle | Global and local handle similar to boost subgraphs. Vertices are stored in a vector. For the root simplicial complex, the local and global descriptors are the same. For a subcomplex L and one of its vertices 'v', the local descriptor of 'v' is its position in the vertex vector of the subcomplex L whereas its global descriptor is the position of 'v' in the vertex vector of the root simplicial complex |
| CGudhi::skbl::SkeletonBlockerDS::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 |
| CGudhi::skbl::Skeleton_blocker_simple_geometric_traits< GeometryTrait >::Simple_geometric_vertex | Vertex with a point attached |
| CGudhi::skbl::Simplex_around_vertex_iterator< SkeletonBlockerComplex, Link > | |
| CSimplexKey | Key type used as simplex identifier |
| ▼CGudhi::skbl::Skeleton_blocker_complex< SkeletonBlockerDS > | Abstract Simplicial Complex represented with a skeleton/blockers pair |
| CGudhi::skbl::Skeleton_blocker_simplifiable_complex< SkeletonBlockerDS > | Class that allows simplification operation on a simplicial complex represented by a skeleton/blockers pair |
| CGudhi::skbl::Skeleton_blocker_simplifiable_complex< SkeletonBlockerDS > | Class that allows simplification operation on a simplicial complex represented by a skeleton/blockers pair |
| ▼CGudhi::skbl::Skeleton_blocker_sub_complex< ComplexType > | Simplicial subcomplex of a complex represented by a skeleton/blockers pair |
| ▼CGudhi::skbl::Skeleton_blocker_link_complex< ComplexType > | Class representing the link of a simplicial complex encoded by a skeleton/blockers pair. It inherits from Skeleton_blocker_sub_complex because such complex is a sub complex of a root complex |
| CGudhi::skbl::Skeleton_blocker_link_superior< ComplexType > | Class representing the link of a simplicial complex encoded by a skeleton/blockers pair. It computes only vertices greater than the simplex used to build the link |
| ▼CGudhi::skbl::Skeleton_blocker_simplifiable_complex< SkeletonBlockerGeometricDS > | |
| CGudhi::skbl::Skeleton_blocker_geometric_complex< SkeletonBlockerGeometricDS > | Class that represents a geometric complex that can be simplified. The class allows access to points of vertices |
| ▼CGudhi::skbl::Skeleton_blocker_complex< SkeletonBlockerGeometricDS > | |
| CGudhi::skbl::Skeleton_blocker_simplifiable_complex< SkeletonBlockerGeometricDS > | |
| ▼CGudhi::skbl::Skeleton_blocker_complex_visitor< Vertex_handle > | Interface for a visitor of a simplicial complex |
| CGudhi::skbl::Dummy_complex_visitor< Vertex_handle > | A dummy visitor of a simplicial complex that does nothing |
| CGudhi::skbl::Print_complex_visitor< Vertex_handle > | A visitor that prints the visit information |
| ▼CGudhi::skbl::Skeleton_blocker_complex_visitor< GeometricSimplifiableComplex::Vertex_handle > | |
| ▼CGudhi::skbl::Dummy_complex_visitor< GeometricSimplifiableComplex::Vertex_handle > | |
| CGudhi::contraction::Skeleton_blocker_contractor< GeometricSimplifiableComplex, EdgeProfile > | Class that allows to contract iteratively edges of a simplicial complex |
| CGudhi::skbl::Skeleton_blocker_off_reader< Complex > | Class that allows to load a Skeleton_blocker_complex from an off file |
| CGudhi::skbl::Skeleton_blocker_off_visitor_reader< Complex > | Off reader visitor that can be passed to Off_reader to read a Skeleton_blocker_complex |
| CGudhi::skbl::Skeleton_blocker_simplex< T > | Abstract simplex used in Skeleton blockers data-structure |
| ▼CGudhi::skbl::SkeletonBlockerDS | 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 |
| ▼CGudhi::skbl::Skeleton_blocker_simple_traits | Simple traits that is a model of SkeletonBlockerDS and can be passed as a template argument to Skeleton_blocker_complex |
| CGudhi::skbl::Skeleton_blocker_simple_geometric_traits< GeometryTrait > | Simple traits that is a model of SkeletonBlockerGeometricDS and can be passed as a template argument to Skeleton_blocker_geometric_complex |
| ▼CGudhi::skbl::SkeletonBlockerGeometricDS< GeometryTrait > | Concept for template class of Skeleton_blocker_geometric_complex . It must specify a GeometryTrait which contains a Point definition |
| CGudhi::skbl::Skeleton_blocker_simple_geometric_traits< GeometryTrait > | Simple traits that is a model of SkeletonBlockerGeometricDS and can be passed as a template argument to Skeleton_blocker_geometric_complex |
| CTest | |
| CGudhi::skbl::Triangle_around_vertex_iterator< Complex, LinkType > | Iterator over the triangles that are adjacent to a vertex of the simplicial complex |
| CGudhi::skbl::Triangle_iterator< SkeletonBlockerComplex > | Iterator over the triangles of the simplicial complex |
| ▼CGudhi::contraction::Valid_contraction_policy< EdgeProfile > | Policy to specify if an edge contraction is valid or not |
| CGudhi::contraction::Dummy_valid_contraction< EdgeProfile > | Policy that accept all edge contraction |
| CGudhi::contraction::Link_condition_valid_contraction< EdgeProfile > | Policy that only accept edges verifying the link condition (and therefore whose contraction preserving homotopy type) |
| CGudhi::skbl::SkeletonBlockerDS::Vertex_handle | |
| CVertexHandle | Handle type for the vertices of a cell complex |
1.8.7
