Loading...
Searching...
No Matches
SimplexTreeOptions.h
1/* This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
2 * See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
3 * Author(s): Marc Glisse
4 *
5 * Copyright (C) 2015 Inria
6 *
7 * Modification(s):
8 * - YYYY/MM Author: Description of the modification
9 */
10
17struct SimplexTreeOptions {
19 typedef IndexingTag Indexing_tag;
21 typedef VertexHandle Vertex_handle;
23 typedef FiltrationValue Filtration_value;
25 typedef SimplexKey Simplex_key;
27 static const bool store_key;
32 static const bool store_filtration;
33
35 static constexpr bool contiguous_vertices;
37 static const bool link_nodes_by_label;
39 static const bool stable_simplex_handles;
40};
41
FiltrationValue
Value type for a filtration function on a cell complex.
Definition: FiltrationValue.h:20
IndexingTag
Concept describing an indexing scheme (see FilteredComplex) for applying continuous maps to a cell co...
Definition: IndexingTag.h:18
SimplexKey
Key type used as simplex identifier.
Definition: SimplexKey.h:15
SimplexTreeOptions
Concept of the template parameter for the class Gudhi::Simplex_tree<SimplexTreeOptions>.
Definition: SimplexTreeOptions.h:17
SimplexTreeOptions::Filtration_value
FiltrationValue Filtration_value
Must be comparable with operator<.
Definition: SimplexTreeOptions.h:23
SimplexTreeOptions::store_key
static const bool store_key
If true, each simplex has extra storage for one Simplex_key. Necessary for Persistent_cohomology.
Definition: SimplexTreeOptions.h:27
SimplexTreeOptions::Vertex_handle
VertexHandle Vertex_handle
Must be a signed integer type. It admits a total order <.
Definition: SimplexTreeOptions.h:21
SimplexTreeOptions::store_filtration
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:32
SimplexTreeOptions::link_nodes_by_label
static const bool link_nodes_by_label
If true, the lists of Node with same label are stored to enhance cofaces and stars access.
Definition: SimplexTreeOptions.h:37
SimplexTreeOptions::Indexing_tag
IndexingTag Indexing_tag
Forced for now.
Definition: SimplexTreeOptions.h:19
SimplexTreeOptions::stable_simplex_handles
static const bool stable_simplex_handles
If true, Simplex_handle will not be invalidated after insertions or removals.
Definition: SimplexTreeOptions.h:39
SimplexTreeOptions::contiguous_vertices
static constexpr bool contiguous_vertices
If true, the list of vertices present in the complex must always be 0, ..., num_vertices-1,...
Definition: SimplexTreeOptions.h:35
SimplexTreeOptions::Simplex_key
SimplexKey Simplex_key
Must be an integer type.
Definition: SimplexTreeOptions.h:25
VertexHandle
Handle type for the vertices of a cell complex.
Definition: VertexHandle.h:15