The concept SimplicialComplexForCech describes the requirements for a type to implement a simplicial complex, that can be created from a Cech_complex
.
More...
#include </home/gailuron/workspace/gudhi/gudhi-devel/build/gudhi.3.5.0/concept/Cech_complex/SimplicialComplexForCech.h>
|
int | assign_filtration (Simplex_handle simplex, Filtration_value filtration) |
|
Simplex_vertex_range | simplex_vertex_range (Simplex_handle const &simplex) |
| Returns a range over vertices of a given simplex.
|
|
template<class ProximityGraph > |
void | insert_graph (const ProximityGraph &proximity_graph) |
| Inserts a given Gudhi::ProximityGraph in the simplicial complex.
|
|
template<typename Blocker > |
void | expansion_with_blockers (int max_dim, Blocker block_simplex) |
| Expands the simplicial complex containing only its one skeleton until a given maximal dimension. expansion can be blocked by the blocker oracle.
|
|
std::size_t | num_vertices () |
|
The concept SimplicialComplexForCech describes the requirements for a type to implement a simplicial complex, that can be created from a Cech_complex
.
◆ Filtration_value
Handle to specify the simplex filtration value.
◆ Simplex_handle
Handle to specify a simplex.
◆ Vertex_handle
Handle to specify a vertex. Must be a non-negative integer.
◆ assign_filtration()
Assigns the 'simplex' with the given 'filtration' value.
◆ num_vertices()
std::size_t Gudhi::cech_complex::SimplicialComplexForCech::num_vertices |
( |
| ) |
|
Returns the number of vertices in the simplicial complex.
The documentation for this struct was generated from the following file: