11 #ifndef CONCEPT_CECH_COMPLEX_SIMPLICIAL_COMPLEX_FOR_CECH_H_    12 #define CONCEPT_CECH_COMPLEX_SIMPLICIAL_COMPLEX_FOR_CECH_H_    16 namespace cech_complex {
    37   template<
class ProximityGraph>
    38   void insert_graph(
const ProximityGraph& proximity_graph);
    42   template< 
typename Blocker >
    54 #endif  // CONCEPT_ALPHA_COMPLEX_SIMPLICIAL_COMPLEX_FOR_ALPHA_H_ unspecified Filtration_value
Definition: SimplicialComplexForCech.h:27
Simplex_vertex_range simplex_vertex_range(Simplex_handle const &simplex)
Returns a range over vertices of a given simplex. 
int assign_filtration(Simplex_handle simplex, Filtration_value filtration)
Definition: SimplicialComplexForAlpha.h:14
void expansion_with_blockers(int max_dim, Blocker block_simplex)
Expands the simplicial complex containing only its one skeleton until a given maximal dimension...
unspecified Vertex_handle
Definition: SimplicialComplexForCech.h:25
std::size_t num_vertices()
unspecified Simplex_handle
Definition: SimplicialComplexForCech.h:23
void insert_graph(const ProximityGraph &proximity_graph)
Inserts a given Gudhi::ProximityGraph in the simplicial complex. 
The concept SimplicialComplexForCech describes the requirements for a type to implement a simplicial ...
Definition: SimplicialComplexForCech.h:21