Loading...
Searching...
No Matches
Class List
Here are the classes, structs, unions and interfaces with brief descriptions:

Gudhi | Gudhi namespace
alpha_complex |
SimplicialComplexForAlpha | The concept SimplicialComplexForAlpha describes the requirements for a type to implement a simplicial complex, that can be created from a Alpha_complex
SimplicialComplexForAlpha3d | The concept SimplicialComplexForAlpha3d describes the requirements for a type to implement a simplicial complex, that can be created from a Alpha_complex_3d
Alpha_complex | Alpha complex data structure
Alpha_kernel_d | Alpha complex kernel container
Alpha_complex_3d | Alpha complex data structure for 3d specific case
persistence_diagram |
DiagramPoint | Concept of point in a persistence diagram. std::get<0>(point) must return the birth of the corresponding component and std::get<1>(point) its death. Both should be convertible to double. A valid implementation of this concept is std::pair<double,double>. Death should be larger than birth, death can be std::numeric_limits<double>::infinity() for components which stay alive
PersistenceDiagram | Concept of persistence diagram. It is a range of DiagramPoint. std::begin(diagram) and std::end(diagram) must return corresponding iterators
cech_complex |
SimplicialComplexForCech | The concept SimplicialComplexForCech describes the requirements for a type to implement a simplicial complex, that can be created from a Cech_complex
SimplicialComplexForMEB |
Cech_complex | Cech complex class
coxeter_triangulation |
FunctionForImplicitManifold | The concept FunctionForImplicitManifold describes the requirements for a type to implement an implicit function class used for example in Manifold_tracing
IntersectionOracle | The concept IntersectionOracle describes the requirements for a type to implement an intersection oracle class used for example in Manifold_tracing
SimplexInCoxeterTriangulation | The concept SimplexInCoxeterTriangulation describes the requirements for a type to implement a representation of simplices in Freudenthal_triangulation or in Coxeter_triangulation
TriangulationForManifoldTracing | The concept TriangulationForManifoldTracing describes the requirements for a type to implement a triangulation class used for example in Manifold_tracing
Coxeter_triangulation | A class that stores Coxeter triangulation of type \(\tilde{A}_d\). This triangulation has the greatest simplex quality out of all linear transformations of the Freudenthal-Kuhn triangulation
Cell_complex | A class that constructs the cell complex from the output provided by the class Gudhi::coxeter_triangulation::Manifold_tracing
Query_result | The result of a query by an oracle such as Implicit_manifold_intersection_oracle
Freudenthal_triangulation | A class that stores any affine transformation of the Freudenthal-Kuhn triangulation
Cartesian_product | Constructs the function the zero-set of which is the Cartesian product of the zero-sets of some given functions
Constant_function | A class that encodes a constant function from R^d to R^k. This class does not have any implicit manifold in correspondence
Embed_in_Rd | Embedding of an implicit manifold in a higher dimension
Function_affine_plane_in_Rd | A class for the function that defines an m-dimensional implicit affine plane embedded in d-dimensional Euclidean space
Function_chair_in_R3 | A class that encodes the function, the zero-set of which is a so-called "chair" surface embedded in R^3
Function_iron_in_R3 | A class that encodes the function, the zero-set of which is a surface embedded in R^3 that ressembles an iron
Function_lemniscate_revolution_in_R3 | A class that encodes the function, the zero-set of which is a surface of revolution around the x axis based on the lemniscate of Bernoulli embedded in R^3
Function_moment_curve_in_Rd | A class for the function that defines an implicit moment curve in the d-dimensional Euclidean space
Function_Sm_in_Rd | A class for the function that defines an m-dimensional implicit sphere embedded in the d-dimensional Euclidean space
Function_torus_in_R3 | A class that encodes the function, the zero-set of which is a torus surface embedded in R^3
Function_whitney_umbrella_in_R3 | A class that encodes the function, the zero-set of which is the Whitney umbrella surface embedded in R^3
Linear_transformation | Transforms the zero-set of the function by a given linear transformation. The underlying function corresponds to f(M*x), where M is the transformation matrix
Negation | Constructs the "minus" function. The zero-set is the same, but the values at other points are the negative of their original value
PL_approximation | Constructs a piecewise-linear approximation of a function induced by an ambient triangulation
Translate | Translates the zero-set of the function by a vector. The underlying function corresponds to f(x-off), where off is the offset vector
Implicit_manifold_intersection_oracle | An oracle that supports the intersection query on an implicit manifold
Mesh_medit | Structure to store a mesh that can be output in Medit .mesh file format using the output_meshes_to_medit method
Manifold_tracing | A class that assembles methods for manifold tracing algorithm
Permutahedral_representation | A class that stores the permutahedral representation of a simplex in a Coxeter triangulation or a Freudenthal-Kuhn triangulation
Combination_iterator | Class that allows the user to generate combinations of k elements in a set of n elements. Based on the algorithm by Mifsud
Integer_combination_iterator | Class that allows the user to generate combinations of k elements in a set of n elements. Based on the algorithm by Mifsud
Ordered_set_partition | Class that represents an ordered set partition of a set {0,...,n-1} in k parts as a pair of an unordered set partition given in lexicographic order and a permutation of the parts
Ordered_set_partition_iterator | Class that allows the user to generate set partitions of a set {0,...,n-1} in k parts
Vertex_iterator | Iterator over the vertices of a simplex represented by its permutahedral representation
Face_iterator | Iterator over the k-faces of a simplex given by its permutahedral representation
Coface_iterator | Iterator over the k-cofaces of a simplex given by its permutahedral representation
Permutation_iterator | Class that allows the user to generate permutations. Based on the optimization of the Heap's algorithm by Sedgewick
Set_partition_iterator | Class that allows the user to generate set partitions of a set {0,...,n-1} in k parts
Simplex_comparator | A comparator class for Permutahedral_representation. The comparison is in lexicographic order first on vertices and then on ordered partitions with sorted parts. The lexicographic order forces that any face is larger than a coface
Size_iterator | Auxiliary iterator class for sizes of parts in an ordered set partition
persistence_matrix | Persistence matrix namespace
FieldOperators | Concept of the field operator classes needed for the class Matrix
PersistenceMatrixColumn | Concept of the column classes used by the Matrix class. The classes the columns inherit from are either real or dummy classes, see Row_access_option, Column_dimension_option, Chain_column_option. If used with column compression, the column type has to have its std::hash method
PersistenceMatrixOptions | Concept of the template parameter for the class Matrix
Matrix | Data structure for matrices, and in particular thought for matrices representing filtered complexes in order to compute persistence and/or representative cycles
RowEntryComp | Compares two entries by their position in the row. They are assume to be in the same row
Persistence_interval | Type for an interval in a persistent diagram or barcode. Stores the birth, death and dimension of the interval. It can be used as a tuple with get/std::get (birth, death and dimension in this order), std::tuple_element and std::tuple_size, as well as structured binding
Base_matrix | A basic matrix structure allowing to easily manipulate and access entire columns and rows, but not individual entries

Base_matrix_with_column_compression

A base matrix (also see Base_matrix), but with column compression. That is, all identical columns in the matrix are compressed together as the same column. For matrices with a lot of redundant columns, this will save a lot of space. Also, any addition made onto a column will be performed at the same time on all other identical columns, which is an advantage for the cohomology algorithm for example

Column | Type for columns. Only one for each "column class" is explicitly constructed
Dummy_base_pairing | Empty structure. Inherited instead of Base_pairing, when the computation of the barcode was not enabled or if the pairing is already managed by the vine update classes
Base_pairing | Class managing the barcode for Boundary_matrix if the option was enabled
Dummy_base_swap | Empty structure. Inherited instead of Base_swap, when the column and row swaps are not enabled
Base_swap | Class managing the column and row swaps in Base_matrix and Boundary_matrix
Boundary_matrix | Matrix structure to store the ordered boundary matrix \( R \) of a filtered complex in order to compute its persistent homology. Provides an access to its columns and rows as well as the possibility to remove the last cells of the filtration while maintaining a valid barcode

Chain_matrix

Matrix structure storing a compatible base of a filtered chain complex. See [zigzag]. The base is constructed from the boundaries of the cells in the complex. Allows the persistent homology to be computed, as well as representative cycles. Supports vineyards (see [vineyards]) and the removal of maximal cells while maintaining a valid barcode. Provides an access to its columns and rows

Dummy_chain_pairing | Empty structure. Inherited instead of Chain_pairing, when the computation of the barcode was not enabled or if the pairing is already managed by the vine update classes
Chain_pairing | Class managing the barcode for Chain_matrix if the option was enabled
Dummy_chain_representative_cycles | Empty structure. Inherited instead of Chain_representative_cycles, when the computation of the representative cycles were not enabled
Chain_representative_cycles | Class managing the representative cycles for Chain_matrix if the option was enabled
Dummy_chain_vine_swap | Empty structure. Inherited instead of Chain_vine_swap, when vine swaps are not enabled
Dummy_chain_vine_pairing | Empty structure. Inherited instead of Chain_barcode_swap, when the barcode is not stored
Chain_barcode_swap | Class managing the barcode for Chain_vine_swap
Chain_vine_swap | Class managing the vine swaps for Chain_matrix
Dummy_chain_properties | Empty structure. Inherited instead of Chain_column_extra_properties, when the columns are not meant for chain matrices
Chain_column_extra_properties | Class managing the pivot and partitioning of columns in Chain_matrix
Dummy_dimension_holder | Empty structure. Inherited instead of Column_dimension_holder, when the columns are not storing a dimension
Column_dimension_holder | Class managing the dimension access of a column
Dummy_entry_column_index_mixin | Empty structure. Inherited instead of Entry_column_index, when the row access is disabled
Dummy_entry_field_element_mixin | Empty structure. Inherited instead of Entry_field_element, when PersistenceMatrixOptions::is_z2 is true
Entry_column_index | Class managing the column index access of an entry
Entry_field_element | Class managing the value access of an entry
Entry | Matrix entry class. Stores by default only the row index it belongs to, but can also store its column index when the row access is enabled, as well as its value when they are different from only 0 and 1. Zero-valued entries are never made explicit in the matrix
Heap_column | Column class following the PersistenceMatrixColumn concept. Not compatible with row access
Intrusive_list_column | Column class following the PersistenceMatrixColumn concept
Intrusive_set_column | Column class following the PersistenceMatrixColumn concept
List_column | Column class following the PersistenceMatrixColumn concept
Naive_vector_column | Column class following the PersistenceMatrixColumn concept
Dummy_row_access | Empty structure. Inherited instead of Row_access, if the row access is not enabled
Row_access | Class managing the row access for the columns
Set_column | Column class following the PersistenceMatrixColumn concept
Unordered_set_column | Column class following the PersistenceMatrixColumn concept
Vector_column | Column class following the PersistenceMatrixColumn concept
Id_to_index_overlay | Overlay for non-basic matrices replacing all input and output MatIdx indices of the original methods with IDIdx indices
Dummy_matrix_dimension_holder | Empty structure. Inherited instead of Matrix_max_dimension_holder or Matrix_all_dimension_holder, when the maximal dimension of a matrix is not stored
Matrix_max_dimension_holder | Class managing the maximal dimension of a cell represented in the inheriting matrix, when the option of cell removal is not enabled
Matrix_all_dimension_holder | Class managing the maximal dimension of a cell represented in the inheriting matrix, when the option of cell removal is enabled
Dummy_matrix_row_access | Empty structure. Inherited instead of Matrix_row_access, when the the row access is not enabled
Matrix_row_access | Class managing the row access for the inheriting matrix
Position_to_index_overlay | Overlay for chain matrices replacing all input and output MatIdx indices of the original methods with PosIdx indices. The overlay is useless for boundary matrices as MatIdx == PosIdx for them
RU_matrix | Matrix structure to store the ordered boundary matrix \( R \cdot U \) of a filtered complex in order to compute its persistent homology, as well as representative cycles. Supports vineyards (see [vineyards]) and the removal of maximal cells while maintaining a valid barcode. Provides an access to its columns and rows
Dummy_ru_pairing | Empty structure. Inherited instead of RU_pairing, when the computation of the barcode was not enabled or if the pairing is already managed by the vine update classes
RU_pairing | Class managing the barcode for RU_matrix if the option was enabled
Dummy_ru_representative_cycles | Empty structure. Inherited instead of RU_representative_cycles, when the computation of the representative cycles were not enabled
RU_representative_cycles | Class managing the representative cycles for RU_matrix if the option was enabled
Dummy_ru_vine_swap | Empty structure. Inherited instead of RU_vine_swap, when vine swaps are not enabled
Dummy_ru_vine_pairing | Empty structure. Inherited instead of RU_pairing, when the barcode is not stored
RU_vine_swap | Class managing the vine swaps for RU_matrix
Default_options | Default option structure for Matrix class. See the PersistenceMatrixOptions concept for a more detailed description of the fields. Produces a base matrix with no enabled option
Zigzag_options | Options used for the Zigzag persistence module
Representative_cycles_options | Options needed to use the representative cycles
Multi_persistence_options | Options used by the Multipersistence module
Cohomology_persistence_options | Options used by the cohomology module
Persistence_representations |
Real_valued_topological_data | The concept Real_valued_topological_data describes the requirements for a type to implement a container that allows computations of its projections to R
Topological_data_with_averages | The concept Topological_data_with_averages describes the requirements for a type to implement a container that allows computations of averages. Note that the average object after being computed is stored in *this
Topological_data_with_distances | The concept Topological_data_with_distances describes the requirements for a type to implement a container that allows computations of distance to another contained of that type
Topological_data_with_scalar_product | The concept Topological_data_with_scalar_product describes the requirements for a type to implement a container that allows computations of scalar products
Vectorized_topological_data | The concept Vectorized_topological_data describes the requirements for a type to implement a container that allows vectorization
constant_scaling_function |
distance_from_diagonal_scaling |
squared_distance_from_diagonal_scaling |
arc_tan_of_persistence_of_point |
weight_by_setting_maximal_interval_to_have_length_one |
Persistence_heat_maps | A class implementing persistence heat maps
Persistence_intervals |
Persistence_landscape | A class implementing persistence landscapes data structures
Persistence_landscape_on_grid | A class implementing persistence landscapes by approximating them on a collection of grid points
Vector_distances_in_diagram | A class implementing persistence vectors
PSSK |
Sliced_Wasserstein | A class implementing the Sliced Wasserstein kernel
rips_complex |
SimplicialComplexForRips | The concept SimplicialComplexForRips describes the requirements for a type to implement a simplicial complex, that can be created from a Rips_complex. The only available model for the moment is the Simplex_tree
Rips_complex | Rips complex data structure
Sparse_rips_complex | Sparse Rips complex data structure
skeleton_blocker |
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
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
Vertex_handle |
Graph_vertex | The type of vertices that are stored the boost graph. A Vertex must be Default Constructible and Equality Comparable
Graph_edge | The type of edges that are stored the boost graph. An Edge must be Default Constructible and Equality Comparable
SkeletonBlockerGeometricDS | Concept for template class of Skeleton_blocker_geometric_complex . It must specify a GeometryTrait which contains a Point definition
Graph_vertex | Vertex that stores a point
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
Blocker_iterator_internal | Iterator through the blockers of a vertex
Blocker_iterator_around_vertex_internal | Iterator through the blockers of a vertex
Edge_iterator | Iterator on the edges of a simplicial complex
Simplex_around_vertex_iterator |
Simplex_coboundary_iterator |
Triangle_around_vertex_iterator | Iterator over the triangles that are adjacent to a vertex of the simplicial complex
Triangle_iterator | Iterator over the triangles of the simplicial complex
Vertex_iterator | Iterator on the vertices of a simplicial complex
Skeleton_blocker_complex_visitor | Interface for a visitor of a simplicial complex
Dummy_complex_visitor | A dummy visitor of a simplicial complex that does nothing
Print_complex_visitor | A visitor that prints the visit information
Skeleton_blocker_sub_complex | Simplicial subcomplex of a complex represented by a skeleton/blockers pair
Skeleton_blocker_link_superior | 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
Skeleton_blocker_off_flag_visitor_reader | Off reader visitor that can be passed to Off_reader to read a Skeleton_blocker_complex
Skeleton_blocker_off_visitor_reader | Off reader visitor that can be passed to Off_reader to read a Skeleton_blocker_complex
Skeleton_blocker_off_reader | Class that allows to load a Skeleton_blocker_complex from an off file
Skeleton_blocker_simple_geometric_traits | Simple traits that is a model of SkeletonBlockerGeometricDS and can be passed as a template argument to Skeleton_blocker_geometric_complex
Simple_geometric_vertex | Vertex with a point attached
Skeleton_blocker_simple_traits | Simple traits that is a model of SkeletonBlockerDS and can be passed as a template argument to Skeleton_blocker_complex

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

Skeleton_blocker_simplex | Abstract simplex used in Skeleton blockers data-structure
Skeleton_blocker_complex | Abstract Simplicial Complex represented with a skeleton/blockers pair
Skeleton_blocker_geometric_complex | Class that represents a geometric complex that can be simplified. The class allows access to points of vertices
Skeleton_blocker_link_complex | 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
witness_complex |
SimplicialComplexForWitness | The concept SimplicialComplexForWitness describes the requirements for a type to implement a simplicial complex, used for example to build a Witness_complex or Strong_witness_complex
Active_witness | Class representing a list of nearest neighbors to a given witness
Active_witness_iterator | Iterator in the nearest landmark list
Euclidean_strong_witness_complex | Constructs strong witness complex for given sets of witnesses and landmarks in Euclidean space
Euclidean_witness_complex | Constructs (weak) witness complex for given sets of witnesses and landmarks in Euclidean space
Strong_witness_complex | Constructs strong witness complex for a given table of nearest landmarks with respect to witnesses
Witness_complex | Constructs (weak) witness complex for a given table of nearest landmarks with respect to witnesses
zigzag_persistence |
FilteredZigzagOptions | List of options used for the filtered zigzag persistence computation
ZigzagOptions | List of options used for the zigzag persistence computation
Default_filtered_zigzag_options | Default options for Filtered_zigzag_persistence_with_storage and Filtered_zigzag_persistence

Filtered_zigzag_persistence_with_storage

Class computing the zigzag persistent homology of a zigzag filtration. Algorithm based on [zigzag]. Even though the insertions and removals are given in a "stream-like" way, the barcode and other values are stored during the whole process and not removed. It is therefore suited for smaller filtrations where the clean ups produce a higher overhead than the memory consumption

Filtered_zigzag_persistence | Class computing the zigzag persistent homology of a zigzag filtration. Algorithm based on [zigzag]
Zigzag_matrix_options | Options for the internal matrix of Zigzag_persistence
Default_zigzag_options | Default options for Zigzag_persistence
Zigzag_persistence | Class computing the zigzag persistent homology of a zigzag sequence. Algorithm based on [zigzag]
cubical_complex |
Bitmap_cubical_complex | Cubical complex represented as a bitmap
Skeleton_simplex_range | A range containing all the cells of dimension at most k
Bitmap_cubical_complex_base | Cubical complex represented as a bitmap, class with basic implementation
Top_dimensional_cells_iterator | Iterator through top dimensional cells of the complex. The cells appear in order they are stored in the structure (i.e. in lexicographical order)
Top_dimensional_cells_range | Range corresponding to Top_dimensional_cells_iterator
Bitmap_cubical_complex_periodic_boundary_conditions_base | Cubical complex with periodic boundary conditions represented as a bitmap
cover_complex |
Cover_complex | Cover complex data structure
persistence_fields | Field namespace
Multi_field_element | Class representing an element of a multi-field. The characteristics will corresponds to all prime numbers in the interval given as template
Multi_field_operators | Class defining operators for a multi-field with "consecutive" characteristic range
Shared_multi_field_element | Class representing an element of a multi-field. If each instantiation of the class can represent another element, they all share the same characteristics. That is if the characteristics are set for one, they will be set for all the others. The characteristics can be set before instantiating the elements with the static Shared_multi_field_element::initialize method
Multi_field_element_with_small_characteristics | Class representing an element of a multi-field, such that the product of all characteristics fits into the given `Unsigned_integer_type` template argument. The characteristics will corresponds to all prime numbers in the interval given as other template arguments
Multi_field_operators_with_small_characteristics | Class defining operators for a multi-field with "consecutive" characteristic range, such that productOfAllCharacteristics ^ 2 fits into an unsigned int

Shared_multi_field_element_with_small_characteristics

Class representing an element of a multi-field, such that productOfAllCharacteristics ^ 2 fits into the given `Unsigned_integer_type` template argument. If each instantiation of the class can represent another element, they all share the same characteristics. That is if the characteristics are set for one, they will be set for all the others. The characteristics can be set before instantiating the elements with the static Shared_multi_field_element_with_small_characteristics::initialize method

Z2_field_element | Class representing an element of the \( \mathbb{F}_2 \) field
Z2_field_operators | Class defining operators for the \( \mathbb{F}_2 \) field
Zp_field_element | Class representing an element of the \( \mathbb{F}_p \) field for any prime number \( p \)
Zp_field_operators | Class defining operators for the \( \mathbb{F}_p \) field for any prime number \( p \)

Shared_Zp_field_element

Class representing an element of the \( \mathbb{F}_p \) field for any prime number \( p \). If each instantiation of the class can represent another element, they all share the same characteristics. That is if the characteristics are set for one, they will be set for all the others. The characteristics can be set before instantiating the elements with the static Shared_Zp_field_element::initialize method

persistent_cohomology |
Persistent_cohomology | Computes the persistent cohomology of a filtered complex
Field_Zp | Structure representing the coefficient field \(\mathbb{Z}/p\mathbb{Z}\)
Multi_field | Structure representing coefficients in a set of finite fields simultaneously using the chinese remainder theorem
spatial_searching |
Kd_tree_search | Spatial tree data structure to perform (approximate) nearest and furthest neighbor search
tangential_complex |
Tangential_complex | Tangential complex data structure
Fix_inconsistencies_info | Type returned by Tangential_complex::fix_inconsistencies_using_perturbation
Num_inconsistencies | Type returned by Tangential_complex::number_of_inconsistent_simplices
contraction |
Contraction_visitor | Interface for a visitor of the edge contraction process
Cost_policy | Policy to specify the cost of contracting an edge
Dummy_valid_contraction | Policy that accept all edge contraction
Edge_length_cost | Return a cost corresponding to the squared length of the edge
First_vertex_placement | Places the contracted point onto the first point of the edge
Link_condition_valid_contraction | Policy that only accept edges verifying the link condition (and therefore whose contraction preserving homotopy type)
Placement_policy | Policy to specify where the merged point had to be placed after an edge contraction
Valid_contraction_policy | Policy to specify if an edge contraction is valid or not
Contraction_visitor_remove_popable | Visitor to remove popable blockers after an edge contraction
Skeleton_blocker_contractor | Class that allows to contract iteratively edges of a simplicial complex
Hasse_diagram |
Hasse_diagram_cell | Data structure to store a cell in a Hasse diagram
Euclidean_distance | Compute the Euclidean distance between two Points given by a range of coordinates. The points are assumed to have the same dimension
Lazy_toplex_map | Lazy toplex map data structure for representing unfiltered simplicial complexes
Null_output_iterator |
Off_reader | OFF file reader top class visitor
Points_3D_off_visitor_reader | OFF file visitor implementation according to Off_reader in order to read points from an OFF file
Points_3D_off_reader |
Points_off_visitor_reader | OFF file visitor implementation according to Off_reader in order to read points from an OFF file
Points_off_reader | OFF file reader implementation in order to read points from an OFF file
Simplex_tree | Simplex Tree data structure for representing simplicial complexes
Hooks_simplex_base_dummy | No hook when SimplexTreeOptions::link_nodes_by_label is false
Hooks_simplex_base_link_nodes | Data structure to put all simplex tree nodes with same label into a list
linear_indexing_tag | Tag for a linear ordering of simplices
Simplex_tree_simplex_vertex_iterator | Iterator over the vertices of a simplex in a SimplexTree
Simplex_tree_boundary_simplex_iterator | Iterator over the simplices of the boundary of a simplex
Simplex_tree_boundary_opposite_vertex_simplex_iterator | Iterator over the simplices of the boundary of a simplex and their opposite vertices
Simplex_tree_complex_simplex_iterator | Iterator over the simplices of a simplicial complex
Simplex_tree_skeleton_simplex_iterator | Iterator over the simplices of the skeleton of a given dimension of the simplicial complex
Simplex_tree_node_explicit_storage | Node of a simplex tree with filtration value and simplex key
Simplex_tree_options_default |
Simplex_tree_options_full_featured |
Simplex_tree_options_minimal |
Simplex_tree_siblings | Data structure to store a set of nodes in a SimplexTree sharing the same parent node
Simplex_tree_optimized_star_simplex_iterator | Iterator over the simplices of the star of a simplex
Toplex_map | Toplex map data structure for representing unfiltered simplicial complexes
Persistence_interval_common |
std | STL namespace
tuple_size< Gudhi::persistence_matrix::Persistence_interval< Dimension, Event_value > > | Partial specialization of std::tuple_size for Gudhi::persistence_matrix::Persistence_interval
tuple_element< I, Gudhi::persistence_matrix::Persistence_interval< Dimension, Event_value > > | Partial specialization of std::tuple_element for Gudhi::persistence_matrix::Persistence_interval
hash< Gudhi::persistence_matrix::Entry< Master_matrix > > | Hash method for Gudhi::persistence_matrix::Entry
hash< Gudhi::persistence_matrix::Heap_column< Master_matrix > > | Hash method for Gudhi::persistence_matrix::Heap_column
hash< Gudhi::persistence_matrix::Intrusive_list_column< Master_matrix > > | Hash method for Gudhi::persistence_matrix::Intrusive_list_column
hash< Gudhi::persistence_matrix::Intrusive_set_column< Master_matrix > > | Hash method for Gudhi::persistence_matrix::Intrusive_set_column
hash< Gudhi::persistence_matrix::List_column< Master_matrix > > | Hash method for Gudhi::persistence_matrix::List_column
hash< Gudhi::persistence_matrix::Naive_vector_column< Master_matrix, Support > > | Hash method for Gudhi::persistence_matrix::Naive_vector_column
hash< Gudhi::persistence_matrix::Set_column< Master_matrix > > | Hash method for Gudhi::persistence_matrix::Set_column
hash< Gudhi::persistence_matrix::Unordered_set_column< Master_matrix > > | Hash method for Gudhi::persistence_matrix::Unordered_set_column
hash< Gudhi::persistence_matrix::Vector_column< Master_matrix > > | Hash method for Gudhi::persistence_matrix::Vector_column
CoefficientField | Concept describing the requirements for a class to represent a field of coefficients to compute persistent homology
Default_options | Default option structure for Matrix class. See the PersistenceMatrixOptions concept for a more detailed description of the fields. Produces a base matrix with no enabled option
Extended_simplex_type | Extended simplex type data structure for representing the type of simplices in an extended filtration
FilteredComplex | 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
FiltrationValue | Value type for a filtration function on a cell complex
IndexingTag | Concept describing an indexing scheme (see FilteredComplex) for applying continuous maps to a cell complex, and compute its persistent homology
PersistentHomology | Concept describing the requirements for a class to compute persistent homology

Shared_Zp_field_element

Class representing an element of the \( \mathbb{F}_p \) field for any prime number \( p \). If each instantiation of the class can represent another element, they all share the same characteristics. That is if the characteristics are set for one, they will be set for all the others. The characteristics can be set before instantiating the elements with the static Shared_Zp_field_element::initialize method

Simplex_tree | Simplex Tree data structure for representing simplicial complexes
SimplexKey | Key type used as simplex identifier
SimplexTreeOptions | Concept of the template parameter for the class Gudhi::Simplex_tree<SimplexTreeOptions>
VertexHandle | Handle type for the vertices of a cell complex
Z2_field_element | Class representing an element of the \( \mathbb{F}_2 \) field
Z2_field_operators | Class defining operators for the \( \mathbb{F}_2 \) field
Zp_field_element | Class representing an element of the \( \mathbb{F}_p \) field for any prime number \( p \)
Zp_field_operators | Class defining operators for the \( \mathbb{F}_p \) field for any prime number \( p \)