| NGudhi | Gudhi namespace |
| Nalpha_complex | |
| CAlpha_complex | Alpha complex data structure |
| CAlpha_complex_3d | Alpha complex data structure for 3d specific case |
| CAlpha_kernel_d | Alpha complex kernel container |
| CSimplicialComplexForAlpha | The concept SimplicialComplexForAlpha describes the requirements for a type to implement a simplicial complex, that can be created from a Alpha_complex |
| CSimplicialComplexForAlpha3d | The concept SimplicialComplexForAlpha3d describes the requirements for a type to implement a simplicial complex, that can be created from a Alpha_complex_3d |
| Ncech_complex | |
| CCech_complex | Cech complex class |
| CSimplicialComplexForCech | The concept SimplicialComplexForCech describes the requirements for a type to implement a simplicial complex, that can be created from a Cech_complex |
| CSimplicialComplexForMEB | |
| Ncontraction | |
| CContraction_visitor | Interface for a visitor of the edge contraction process |
| CContraction_visitor_remove_popable | Visitor to remove popable blockers after an edge contraction |
| CCost_policy | Policy to specify the cost of contracting an edge |
| CDummy_valid_contraction | Policy that accept all edge contraction |
| CEdge_length_cost | Return a cost corresponding to the squared length of the edge |
| CFirst_vertex_placement | Places the contracted point onto the first point of the edge |
| CLink_condition_valid_contraction | Policy that only accept edges verifying the link condition (and therefore whose contraction preserving homotopy type) |
| CPlacement_policy | Policy to specify where the merged point had to be placed after an edge contraction |
| CSkeleton_blocker_contractor | Class that allows to contract iteratively edges of a simplicial complex |
| CValid_contraction_policy | Policy to specify if an edge contraction is valid or not |
| Ncover_complex | |
| CCover_complex | Cover complex data structure |
| Ncoxeter_triangulation | |
| CCartesian_product | Constructs the function the zero-set of which is the Cartesian product of the zero-sets of some given functions |
| CCell_complex | A class that constructs the cell complex from the output provided by the class Gudhi::coxeter_triangulation::Manifold_tracing |
| CCoface_iterator | Iterator over the k-cofaces of a simplex given by its permutahedral representation |
| CCombination_iterator | Class that allows the user to generate combinations of k elements in a set of n elements. Based on the algorithm by Mifsud |
| CConstant_function | A class that encodes a constant function from R^d to R^k. This class does not have any implicit manifold in correspondence |
| CCoxeter_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 |
| CEmbed_in_Rd | Embedding of an implicit manifold in a higher dimension |
| CFace_iterator | Iterator over the k-faces of a simplex given by its permutahedral representation |
| CFreudenthal_triangulation | A class that stores any affine transformation of the Freudenthal-Kuhn triangulation |
| CFunction_affine_plane_in_Rd | A class for the function that defines an m-dimensional implicit affine plane embedded in d-dimensional Euclidean space |
| CFunction_chair_in_R3 | A class that encodes the function, the zero-set of which is a so-called "chair" surface embedded in R^3 |
| CFunction_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 |
| CFunction_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 |
| CFunction_moment_curve_in_Rd | A class for the function that defines an implicit moment curve in the d-dimensional Euclidean space |
| CFunction_Sm_in_Rd | A class for the function that defines an m-dimensional implicit sphere embedded in the d-dimensional Euclidean space |
| CFunction_torus_in_R3 | A class that encodes the function, the zero-set of which is a torus surface embedded in R^3 |
| CFunction_whitney_umbrella_in_R3 | A class that encodes the function, the zero-set of which is the Whitney umbrella surface embedded in R^3 |
| CFunctionForImplicitManifold | The concept FunctionForImplicitManifold describes the requirements for a type to implement an implicit function class used for example in Manifold_tracing |
| CImplicit_manifold_intersection_oracle | An oracle that supports the intersection query on an implicit manifold |
| CInteger_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 |
| CIntersectionOracle | The concept IntersectionOracle describes the requirements for a type to implement an intersection oracle class used for example in Manifold_tracing |
| CLinear_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 |
| CManifold_tracing | A class that assembles methods for manifold tracing algorithm |
| CMesh_medit | Structure to store a mesh that can be output in Medit .mesh file format using the output_meshes_to_medit method |
| CNegation | Constructs the "minus" function. The zero-set is the same, but the values at other points are the negative of their original value |
| COrdered_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 |
| COrdered_set_partition_iterator | Class that allows the user to generate set partitions of a set {0,...,n-1} in k parts |
| CPermutahedral_representation | A class that stores the permutahedral representation of a simplex in a Coxeter triangulation or a Freudenthal-Kuhn triangulation |
| CPermutation_iterator | Class that allows the user to generate permutations. Based on the optimization of the Heap's algorithm by Sedgewick |
| CPL_approximation | Constructs a piecewise-linear approximation of a function induced by an ambient triangulation |
| CQuery_result | The result of a query by an oracle such as Implicit_manifold_intersection_oracle |
| CSet_partition_iterator | Class that allows the user to generate set partitions of a set {0,...,n-1} in k parts |
| CSimplex_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 |
| CSimplexInCoxeterTriangulation | The concept SimplexInCoxeterTriangulation describes the requirements for a type to implement a representation of simplices in Freudenthal_triangulation or in Coxeter_triangulation |
| CSize_iterator | Auxiliary iterator class for sizes of parts in an ordered set partition |
| CTranslate | Translates the zero-set of the function by a vector. The underlying function corresponds to f(x-off), where off is the offset vector |
| CTriangulationForManifoldTracing | The concept TriangulationForManifoldTracing describes the requirements for a type to implement a triangulation class used for example in Manifold_tracing |
| CVertex_iterator | Iterator over the vertices of a simplex represented by its permutahedral representation |
| Ncubical_complex | |
| CBitmap_cubical_complex | Cubical complex represented as a bitmap |
| CSkeleton_simplex_range | A range containing all the cells of dimension at most k |
| CBitmap_cubical_complex_base | Cubical complex represented as a bitmap, class with basic implementation |
| CTop_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) |
| CTop_dimensional_cells_range | Range corresponding to Top_dimensional_cells_iterator |
| CBitmap_cubical_complex_periodic_boundary_conditions_base | Cubical complex with periodic boundary conditions represented as a bitmap |
| NHasse_diagram | |
| CHasse_diagram_cell | Data structure to store a cell in a Hasse diagram |
| Npersistence_diagram | |
| CDiagramPoint | 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 |
| CPersistenceDiagram | Concept of persistence diagram. It is a range of DiagramPoint. std::begin(diagram) and std::end(diagram) must return corresponding iterators |
| Npersistence_fields | Field namespace |
| CMulti_field_element | Class representing an element of a multi-field. The characteristics will corresponds to all prime numbers in the interval given as template |
| CMulti_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 |
| CMulti_field_operators | Class defining operators for a multi-field with "consecutive" characteristic range |
| CMulti_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 |
| CShared_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 |
| CShared_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 |
| CShared_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 |
| CZ2_field_element | Class representing an element of the \( \mathbb{F}_2 \) field |
| CZ2_field_operators | Class defining operators for the \( \mathbb{F}_2 \) field |
| CZp_field_element | Class representing an element of the \( \mathbb{F}_p \) field for any prime number \( p \) |
| CZp_field_operators | Class defining operators for the \( \mathbb{F}_p \) field for any prime number \( p \) |
| Npersistence_matrix | Persistence matrix namespace |
| CBase_matrix | A basic matrix structure allowing to easily manipulate and access entire columns and rows, but not individual entries |
| CBase_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 |
| CColumn | Type for columns. Only one for each "column class" is explicitly constructed |
| CBase_pairing | Class managing the barcode for Boundary_matrix if the option was enabled |
| CBase_swap | Class managing the column and row swaps in Base_matrix and Boundary_matrix |
| CBoundary_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 |
| CChain_barcode_swap | Class managing the barcode for Chain_vine_swap |
| CChain_column_extra_properties | Class managing the pivot and partitioning of columns in Chain_matrix |
| CChain_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 |
| CChain_pairing | Class managing the barcode for Chain_matrix if the option was enabled |
| CChain_representative_cycles | Class managing the representative cycles for Chain_matrix if the option was enabled |
| CChain_vine_swap | Class managing the vine swaps for Chain_matrix |
| CCohomology_persistence_options | Options used by the cohomology module |
| CColumn_dimension_holder | Class managing the dimension access of a column |
| CDefault_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 |
| CDummy_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 |
| CDummy_base_swap | Empty structure. Inherited instead of Base_swap, when the column and row swaps are not enabled |
| CDummy_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 |
| CDummy_chain_properties | Empty structure. Inherited instead of Chain_column_extra_properties, when the columns are not meant for chain matrices |
| CDummy_chain_representative_cycles | Empty structure. Inherited instead of Chain_representative_cycles, when the computation of the representative cycles were not enabled |
| CDummy_chain_vine_pairing | Empty structure. Inherited instead of Chain_barcode_swap, when the barcode is not stored |
| CDummy_chain_vine_swap | Empty structure. Inherited instead of Chain_vine_swap, when vine swaps are not enabled |
| CDummy_dimension_holder | Empty structure. Inherited instead of Column_dimension_holder, when the columns are not storing a dimension |
| CDummy_entry_column_index_mixin | Empty structure. Inherited instead of Entry_column_index, when the row access is disabled |
| CDummy_entry_field_element_mixin | Empty structure. Inherited instead of Entry_field_element, when PersistenceMatrixOptions::is_z2 is true |
| CDummy_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 |
| CDummy_matrix_row_access | Empty structure. Inherited instead of Matrix_row_access, when the the row access is not enabled |
| CDummy_row_access | Empty structure. Inherited instead of Row_access, if the row access is not enabled |
| CDummy_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 |
| CDummy_ru_representative_cycles | Empty structure. Inherited instead of RU_representative_cycles, when the computation of the representative cycles were not enabled |
| CDummy_ru_vine_pairing | Empty structure. Inherited instead of RU_pairing, when the barcode is not stored |
| CDummy_ru_vine_swap | Empty structure. Inherited instead of RU_vine_swap, when vine swaps are not enabled |
| CEntry | 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 |
| CEntry_column_index | Class managing the column index access of an entry |
| CEntry_field_element | Class managing the value access of an entry |
| CFieldOperators | Concept of the field operator classes needed for the class Matrix |
| CHeap_column | Column class following the PersistenceMatrixColumn concept. Not compatible with row access |
| CId_to_index_overlay | Overlay for non-basic matrices replacing all input and output MatIdx indices of the original methods with IDIdx indices |
| CIntrusive_list_column | Column class following the PersistenceMatrixColumn concept |
| CIntrusive_set_column | Column class following the PersistenceMatrixColumn concept |
| CList_column | Column class following the PersistenceMatrixColumn concept |
| CMatrix | Data structure for matrices, and in particular thought for matrices representing filtered complexes in order to compute persistence and/or representative cycles |
| CRowEntryComp | Compares two entries by their position in the row. They are assume to be in the same row |
| CMatrix_all_dimension_holder | Class managing the maximal dimension of a cell represented in the inheriting matrix, when the option of cell removal is enabled |
| CMatrix_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 |
| CMatrix_row_access | Class managing the row access for the inheriting matrix |
| CMulti_persistence_options | Options used by the Multipersistence module |
| CNaive_vector_column | Column class following the PersistenceMatrixColumn concept |
| CPersistence_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 |
| CPersistenceMatrixColumn | 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 |
| CPersistenceMatrixOptions | Concept of the template parameter for the class Matrix |
| CPosition_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 |
| CRepresentative_cycles_options | Options needed to use the representative cycles |
| CRow_access | Class managing the row access for the columns |
| CRU_barcode_swap | Class managing the barcode for RU_vine_swap |
| CRU_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 |
| CRU_pairing | Class managing the barcode for RU_matrix if the option was enabled |
| CRU_representative_cycles | Class managing the representative cycles for RU_matrix if the option was enabled |
| CRU_vine_swap | Class managing the vine swaps for RU_matrix |
| CSet_column | Column class following the PersistenceMatrixColumn concept |
| CUnordered_set_column | Column class following the PersistenceMatrixColumn concept |
| CVector_column | Column class following the PersistenceMatrixColumn concept |
| CZigzag_options | Options used for the Zigzag persistence module |
| NPersistence_representations | |
| Carc_tan_of_persistence_of_point | |
| Cconstant_scaling_function | |
| Cdistance_from_diagonal_scaling | |
| CPersistence_heat_maps | A class implementing persistence heat maps |
| CPersistence_intervals | This class implements the following concepts: Vectorized_topological_data, Topological_data_with_distances, Real_valued_topological_data |
| CPersistence_intervals_with_distances | This class implements the following concepts: Vectorized_topological_data, Topological_data_with_distances, Real_valued_topological_data |
| CPersistence_landscape | A class implementing persistence landscapes data structures |
| CPersistence_landscape_on_grid | A class implementing persistence landscapes by approximating them on a collection of grid points |
| CPSSK | |
| CReal_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 |
| CSliced_Wasserstein | A class implementing the Sliced Wasserstein kernel |
| Csquared_distance_from_diagonal_scaling | |
| CTopological_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 |
| CTopological_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 |
| CTopological_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 |
| CVector_distances_in_diagram | A class implementing persistence vectors |
| CVectorized_topological_data | The concept Vectorized_topological_data describes the requirements for a type to implement a container that allows vectorization |
| Cweight_by_setting_maximal_interval_to_have_length_one | |
| Npersistent_cohomology | |
| CField_Zp | Structure representing the coefficient field \(\mathbb{Z}/p\mathbb{Z}\) |
| CMulti_field | Structure representing coefficients in a set of finite fields simultaneously using the chinese remainder theorem |
| CPersistent_cohomology | Computes the persistent cohomology of a filtered complex |
| Nrips_complex | |
| CRips_complex | Rips complex data structure |
| CSimplicialComplexForRips | 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 |
| CSparse_rips_complex | Sparse Rips complex data structure |
| Nsimplex_tree | |
| Cempty_filtration_value_t | Returns Filtration_value(0) when converted to Filtration_value |
| Nskeleton_blocker | |
| CBlocker_iterator_around_vertex_internal | Iterator through the blockers of a vertex |
| CBlocker_iterator_internal | Iterator through the blockers of a vertex |
| CDummy_complex_visitor | A dummy visitor of a simplicial complex that does nothing |
| CEdge_iterator | Iterator on the edges of a simplicial complex |
| CPrint_complex_visitor | A visitor that prints the visit information |
| CSimplex_around_vertex_iterator | |
| CSimplex_coboundary_iterator | |
| CSkeleton_blocker_complex | Abstract Simplicial Complex represented with a skeleton/blockers pair |
| CSkeleton_blocker_complex_visitor | Interface for a visitor of a simplicial complex |
| CSkeleton_blocker_geometric_complex | Class that represents a geometric complex that can be simplified. The class allows access to points of vertices |
| CSkeleton_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 |
| CSkeleton_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 |
| CSkeleton_blocker_off_flag_visitor_reader | Off reader visitor that can be passed to Off_reader to read a Skeleton_blocker_complex |
| CSkeleton_blocker_off_reader | Class that allows to load a Skeleton_blocker_complex from an off file |
| CSkeleton_blocker_off_visitor_reader | Off reader visitor that can be passed to Off_reader to read a Skeleton_blocker_complex |
| CSkeleton_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 |
| CSimple_geometric_vertex | Vertex with a point attached |
| CSkeleton_blocker_simple_traits | Simple traits that is a model of SkeletonBlockerDS and can be passed as a template argument to Skeleton_blocker_complex |
| CRoot_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 |
| CSkeleton_blocker_simplex | Abstract simplex used in Skeleton blockers data-structure |
| CSkeleton_blocker_sub_complex | Simplicial subcomplex of a complex represented by a skeleton/blockers pair |
| CSkeletonBlockerDS | 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 |
| CRoot_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 |
| CVertex_handle | |
| CGraph_vertex | The type of vertices that are stored the boost graph. A Vertex must be Default Constructible and Equality Comparable |
| CGraph_edge | The type of edges that are stored the boost graph. An Edge must be Default Constructible and Equality Comparable |
| CSkeletonBlockerGeometricDS | Concept for template class of Skeleton_blocker_geometric_complex . It must specify a GeometryTrait which contains a Point definition |
| CGraph_vertex | Vertex that stores a point |
| CGraph_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 |
| CTriangle_around_vertex_iterator | Iterator over the triangles that are adjacent to a vertex of the simplicial complex |
| CTriangle_iterator | Iterator over the triangles of the simplicial complex |
| CVertex_iterator | Iterator on the vertices of a simplicial complex |
| Nspatial_searching | |
| CKd_tree_search | Spatial tree data structure to perform (approximate) nearest and furthest neighbor search |
| Ntangential_complex | |
| CTangential_complex | Tangential complex data structure |
| CFix_inconsistencies_info | Type returned by Tangential_complex::fix_inconsistencies_using_perturbation |
| CNum_inconsistencies | Type returned by Tangential_complex::number_of_inconsistent_simplices |
| Nwitness_complex | |
| CActive_witness | Class representing a list of nearest neighbors to a given witness |
| CActive_witness_iterator | Iterator in the nearest landmark list |
| CEuclidean_strong_witness_complex | Constructs strong witness complex for given sets of witnesses and landmarks in Euclidean space |
| CEuclidean_witness_complex | Constructs (weak) witness complex for given sets of witnesses and landmarks in Euclidean space |
| CSimplicialComplexForWitness | 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 |
| CStrong_witness_complex | Constructs strong witness complex for a given table of nearest landmarks with respect to witnesses |
| CWitness_complex | Constructs (weak) witness complex for a given table of nearest landmarks with respect to witnesses |
| Nzigzag_persistence | |
| CDefault_filtered_zigzag_options | Default options for Filtered_zigzag_persistence_with_storage and Filtered_zigzag_persistence |
| CDefault_zigzag_options | Default options for Zigzag_persistence |
| CFiltered_zigzag_persistence | Class computing the zigzag persistent homology of a zigzag filtration. Algorithm based on [zigzag] |
| CFiltered_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 |
| CFilteredZigzagOptions | List of options used for the filtered zigzag persistence computation |
| CZigzag_matrix_options | Options for the internal matrix of Zigzag_persistence |
| CZigzag_persistence | Class computing the zigzag persistent homology of a zigzag sequence. Algorithm based on [zigzag] |
| CZigzagOptions | List of options used for the zigzag persistence computation |
| CEuclidean_distance | Compute the Euclidean distance between two Points given by a range of coordinates. The points are assumed to have the same dimension |
| Cextents | Reproduces the behaviour of C++23 std::extents class |
| CHooks_simplex_base_dummy | No hook when SimplexTreeOptions::link_nodes_by_label is false |
| CHooks_simplex_base_link_nodes | Data structure to put all simplex tree nodes with same label into a list |
| CLazy_toplex_map | Lazy toplex map data structure for representing unfiltered simplicial complexes |
| Clinear_indexing_tag | Tag for a linear ordering of simplices |
| CNull_output_iterator | |
| COff_reader | OFF file reader top class visitor |
| CPersistence_interval_common | |
| CPoints_3D_off_reader | |
| CPoints_3D_off_visitor_reader | OFF file visitor implementation according to Off_reader in order to read points from an OFF file |
| CPoints_off_reader | OFF file reader implementation in order to read points from an OFF file |
| CPoints_off_visitor_reader | OFF file visitor implementation according to Off_reader in order to read points from an OFF file |
| CSimplex_tree | Simplex Tree data structure for representing simplicial complexes |
| CSimplex_tree_boundary_opposite_vertex_simplex_iterator | Iterator over the simplices of the boundary of a simplex and their opposite vertices |
| CSimplex_tree_boundary_simplex_iterator | Iterator over the simplices of the boundary of a simplex |
| CSimplex_tree_complex_simplex_iterator | Iterator over the simplices of a simplicial complex |
| CSimplex_tree_dimension_simplex_iterator | Iterator over the simplices of the simplicial complex that match the dimension specified by the parameter |
| CSimplex_tree_node_explicit_storage | Node of a simplex tree with filtration value and simplex key |
| CSimplex_tree_optimized_star_simplex_iterator | Iterator over the simplices of the star of a simplex |
| CSimplex_tree_options_default | |
| CSimplex_tree_options_full_featured | |
| CSimplex_tree_options_minimal | |
| CSimplex_tree_siblings | Data structure to store a set of nodes in a SimplexTree sharing the same parent node |
| CSimplex_tree_simplex_vertex_iterator | Iterator over the vertices of a simplex in a SimplexTree |
| CSimplex_tree_skeleton_simplex_iterator | Iterator over the simplices of the skeleton of a given dimension of the simplicial complex |
| CToplex_map | Toplex map data structure for representing unfiltered simplicial complexes |
| Nstd | STL namespace |
| Chash< Gudhi::persistence_matrix::Entry< Master_matrix > > | Hash method for Gudhi::persistence_matrix::Entry |
| Chash< Gudhi::persistence_matrix::Heap_column< Master_matrix > > | Hash method for Gudhi::persistence_matrix::Heap_column |
| Chash< Gudhi::persistence_matrix::Intrusive_list_column< Master_matrix > > | Hash method for Gudhi::persistence_matrix::Intrusive_list_column |
| Chash< Gudhi::persistence_matrix::Intrusive_set_column< Master_matrix > > | Hash method for Gudhi::persistence_matrix::Intrusive_set_column |
| Chash< Gudhi::persistence_matrix::List_column< Master_matrix > > | Hash method for Gudhi::persistence_matrix::List_column |
| Chash< Gudhi::persistence_matrix::Naive_vector_column< Master_matrix, Support > > | Hash method for Gudhi::persistence_matrix::Naive_vector_column |
| Chash< Gudhi::persistence_matrix::Set_column< Master_matrix > > | Hash method for Gudhi::persistence_matrix::Set_column |
| Chash< Gudhi::persistence_matrix::Unordered_set_column< Master_matrix > > | Hash method for Gudhi::persistence_matrix::Unordered_set_column |
| Chash< Gudhi::persistence_matrix::Vector_column< Master_matrix > > | Hash method for Gudhi::persistence_matrix::Vector_column |
| Ctuple_element< I, Gudhi::persistence_matrix::Persistence_interval< Dimension, Event_value > > | Partial specialization of std::tuple_element for Gudhi::persistence_matrix::Persistence_interval |
| Ctuple_size< Gudhi::persistence_matrix::Persistence_interval< Dimension, Event_value > > | Partial specialization of std::tuple_size for Gudhi::persistence_matrix::Persistence_interval |
| CCoefficientField | Concept describing the requirements for a class to represent a field of coefficients to compute persistent homology |
| CDefault_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 |
| CExtended_simplex_type | Extended simplex type data structure for representing the type of simplices in an extended filtration |
| CFilteredComplex | 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 |
| CFiltrationValue | Value type for a filtration function on a cell complex |
| CIndexingTag | Concept describing an indexing scheme (see FilteredComplex) for applying continuous maps to a cell complex, and compute its persistent homology |
| CPersistentHomology | Concept describing the requirements for a class to compute persistent homology |
| CShared_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 |
| CSimplex_tree | Simplex Tree data structure for representing simplicial complexes |
| CSimplexKey | Key type used as simplex identifier |
| CSimplexTreeOptions | Concept of the template parameter for the class Gudhi::Simplex_tree<SimplexTreeOptions> |
| CVertexHandle | Handle type for the vertices of a cell complex |
| CZ2_field_element | Class representing an element of the \( \mathbb{F}_2 \) field |
| CZ2_field_operators | Class defining operators for the \( \mathbb{F}_2 \) field |
| CZp_field_element | Class representing an element of the \( \mathbb{F}_p \) field for any prime number \( p \) |
| CZp_field_operators | Class defining operators for the \( \mathbb{F}_p \) field for any prime number \( p \) |