IndexingTag Indexing_tag
Forced for now.
Definition: SimplexTreeOptions.h:29
VertexHandle Vertex_handle
Must be a signed integer type. It admits a total order <.
Definition: SimplexTreeOptions.h:31
Concept describing an indexing scheme (see FilteredComplex) for applying continuous maps to a cell co...
Definition: IndexingTag.h:30
static constexpr bool contiguous_vertices
If true, the list of vertices present in the complex must always be 0, ..., num_vertices-1, without any hole.
Definition: SimplexTreeOptions.h:41
Key type used as simplex identifier.
Definition: SimplexKey.h:27
Value type for a filtration function on a cell complex.
Definition: FiltrationValue.h:32
FiltrationValue Filtration_value
Must be comparable with operator<.
Definition: SimplexTreeOptions.h:33
Concept of the template parameter for the class Gudhi::Simplex_tree<SimplexTreeOptions>.
Definition: SimplexTreeOptions.h:27
SimplexKey Simplex_key
Must be an integer type.
Definition: SimplexTreeOptions.h:35
Handle type for the vertices of a cell complex.
Definition: VertexHandle.h:27
static const bool store_filtration
If true, each simplex has extra storage for one Filtration_value, and this value is propagated by ope...
Definition: SimplexTreeOptions.h:39
static const bool store_key
If true, each simplex has extra storage for one Simplex_key. Necessary for Persistent_cohomology.
Definition: SimplexTreeOptions.h:37