Loading...
Searching...
No Matches
Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 1234]
 CGudhi::witness_complex::Active_witness< Id_distance_pair, INS_range >Class representing a list of nearest neighbors to a given witness
 CGudhi::witness_complex::Active_witness_iterator< Active_witness, Id_distance_pair, INS_iterator >Iterator in the nearest landmark list
 CGudhi::alpha_complex::Alpha_complex< Kernel, Weighted >Alpha complex data structure
 CGudhi::alpha_complex::Alpha_complex_3d< Complexity, Weighted, Periodic >Alpha complex data structure for 3d specific case
 CGudhi::alpha_complex::Alpha_kernel_d< Kernel, Weighted >Alpha complex kernel container
 CGudhi::alpha_complex::Alpha_kernel_d< CGAL::Epeck_d< CGAL::Dynamic_dimension_tag >, false >
 CGudhi::Persistence_representations::arc_tan_of_persistence_of_point
 CGudhi::persistence_matrix::Matrix< PersistenceMatrixOptions >::BarType for a bar in the computed barcode. Stores the birth, death and dimension of the bar
 CGudhi::persistence_matrix::Base_matrix< Master_matrix >A basic matrix structure allowing to easily manipulate and access entire columns and rows, but not individual cells
 CGudhi::persistence_matrix::Base_matrix_with_column_compression< Master_matrix >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
 CGudhi::persistence_matrix::Base_pairing< Master_matrix >Class managing the barcode for Boundary_matrix if the option was enabled
 CGudhi::persistence_matrix::Base_swap< Master_matrix, Base_matrix >Class managing the column and row swaps in Base_matrix and Boundary_matrix
 CGudhi::cubical_complex::Bitmap_cubical_complex< T >Cubical complex represented as a bitmap
 CGudhi::cubical_complex::Bitmap_cubical_complex_base< T >Cubical complex represented as a bitmap, class with basic implementation
 CGudhi::skeleton_blocker::Blocker_iterator_around_vertex_internal< MapIteratorType, ReturnType >Iterator through the blockers of a vertex
 CGudhi::skeleton_blocker::Blocker_iterator_internal< MapIteratorType, ReturnType >Iterator through the blockers of a vertex
 CGudhi::persistence_matrix::Boundary_matrix< Master_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 faces of the filtration while maintaining a valid barcode
 CGudhi::coxeter_triangulation::Cartesian_product< Functions >Constructs the function the zero-set of which is the Cartesian product of the zero-sets of some given functions
 CGudhi::cech_complex::Cech_complex< Kernel, SimplicialComplexForCechComplex >Cech complex class
 CGudhi::persistence_matrix::Cell< Master_matrix >Matrix cell 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 cells are never explicited in the matrix
 CGudhi::persistence_matrix::Cell_column_index< index >Class managing the column index access of a cell
 CGudhi::coxeter_triangulation::Cell_complex< Out_simplex_map_ >A class that constructs the cell complex from the output provided by the class Gudhi::coxeter_triangulation::Manifold_tracing
 CGudhi::persistence_matrix::Cell_field_element< Field_element_type >Class managing the value access of a cell
 CGudhi::persistence_matrix::Chain_column_extra_properties< Master_matrix >Class managing the pivot and partitioning of columns in Chain_matrix
 CGudhi::persistence_matrix::Chain_matrix< Master_matrix >Matrix structure storing a compatible base of a filtered chain complex. See [zigzag]. The base is constructed from the boundaries of the faces in the complex. Allows the persistent homology to be computed, as well as representative cycles. Supports vineyards (see [vineyards]) and the removal of maximal faces while maintaining a valid barcode. Provides an access to its columns and rows
 CGudhi::persistence_matrix::Chain_pairing< Master_matrix >Class managing the barcode for Chain_matrix if the option was enabled
 CGudhi::persistence_matrix::Chain_representative_cycles< Master_matrix >Class managing the representative cycles for Chain_matrix if the option was enabled
 CGudhi::persistence_matrix::Chain_vine_swap< Master_matrix >Class managing the vine swaps for Chain_matrix
 CCoefficientFieldConcept describing the requirements for a class to represent a field of coefficients to compute persistent homology
 CGudhi::coxeter_triangulation::Coface_iterator< Permutahedral_representation >Iterator over the k-cofaces of a simplex given by its permutahedral representation
 CGudhi::persistence_matrix::Column_dimension_holder< Master_matrix >Class managing the dimension access of a column
 CGudhi::persistence_matrix::Base_matrix_with_column_compression< Master_matrix >::Column_typeType for columns. Only one for each "column class" is explicitely constructed
 CGudhi::coxeter_triangulation::Combination_iteratorClass that allows the user to generate combinations of k elements in a set of n elements. Based on the algorithm by Mifsud
 CGudhi::coxeter_triangulation::Constant_functionA class that encodes a constant function from R^d to R^k. This class does not have any implicit manifold in correspondence
 CGudhi::Persistence_representations::constant_scaling_function
 CGudhi::contraction::Contraction_visitor< EdgeProfile >Interface for a visitor of the edge contraction process
 CGudhi::contraction::Contraction_visitor< Profile >
 CGudhi::contraction::Cost_policy< EdgeProfile >Policy to specify the cost of contracting an edge
 CGudhi::cover_complex::Cover_complex< Point >Cover complex data structure
 CGudhi::persistence_matrix::Default_options< col_type, is_z2_only, FieldOperators >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
 CGudhi::persistence_matrix::Default_options< Column_types::INTRUSIVE_LIST, true >
 CGudhi::persistence_matrix::Default_options< Column_types::INTRUSIVE_LIST, true, persistence_fields::Zp_field_operators<> >
 CGudhi::persistence_matrix::Default_options< Column_types::INTRUSIVE_SET, true >
 CGudhi::persistence_diagram::DiagramPointConcept 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
 CGudhi::Persistence_representations::distance_from_diagonal_scaling
 CGudhi::persistence_matrix::Dummy_base_pairingEmpty structure. Inheritated 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
 CGudhi::persistence_matrix::Dummy_base_swapEmpty structure. Inheritated instead of Base_swap, when the column and row swaps are not enabled
 CGudhi::persistence_matrix::Dummy_cell_column_index_mixinEmpty structure. Inheritated instead of Cell_column_index, when the row access is disabled
 CGudhi::persistence_matrix::Dummy_cell_field_element_mixinEmpty structure. Inheritated instead of Cell_field_element, when PersistenceMatrixOptions::is_z2 is true
 CGudhi::persistence_matrix::Dummy_chain_pairingEmpty structure. Inheritated 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
 CGudhi::persistence_matrix::Dummy_chain_propertiesEmpty structure. Inheritated instead of Chain_column_extra_properties, when the columns are not meant for chain matrices
 CGudhi::persistence_matrix::Dummy_chain_representative_cyclesEmpty structure. Inheritated instead of Chain_representative_cycles, when the computation of the representative cycles were not enabled
 CGudhi::persistence_matrix::Dummy_chain_vine_pairingEmpty structure. Inheritated instead of Chain_barcode_swap, when the barcode is not stored
 CGudhi::persistence_matrix::Dummy_chain_vine_swapEmpty structure. Inheritated instead of Chain_vine_swap, when vine swappes are not enabled
 CGudhi::persistence_matrix::Dummy_dimension_holderEmpty structure. Inheritated instead of Column_dimension_holder, when the columns are not storing a dimension
 CGudhi::persistence_matrix::Dummy_matrix_dimension_holderEmpty structure. Inheritated instead of Matrix_max_dimension_holder or Matrix_all_dimension_holder, when the maximal dimension of a matrix is not stored
 CGudhi::persistence_matrix::Dummy_matrix_row_accessEmpty structure. Inheritated instead of Matrix_row_access, when the the row access is not enabled
 CGudhi::persistence_matrix::Dummy_row_accessEmpty structure. Inheritated instead of Row_access, if the row access is not enabled
 CGudhi::persistence_matrix::Dummy_ru_pairingEmpty structure. Inheritated 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
 CGudhi::persistence_matrix::Dummy_ru_representative_cyclesEmpty structure. Inheritated instead of RU_representative_cycles, when the computation of the representative cycles were not enabled
 CGudhi::persistence_matrix::Dummy_ru_vine_pairingEmpty structure. Inheritated instead of RU_pairing, when the barcode is not stored
 CGudhi::persistence_matrix::Dummy_ru_vine_swapEmpty structure. Inheritated instead of RU_vine_swap, when vine swappes are not enabled
 CGudhi::skeleton_blocker::Edge_iterator< SkeletonBlockerComplex >Iterator on the edges of a simplicial complex
 CGudhi::coxeter_triangulation::Embed_in_Rd< Function_ >Embedding of an implicit manifold in a higher dimension
 CGudhi::Euclidean_distanceCompute the Euclidean distance between two Points given by a range of coordinates. The points are assumed to have the same dimension
 CExtended_simplex_typeExtended simplex type data structure for representing the type of simplices in an extended filtration
 CGudhi::coxeter_triangulation::Face_iterator< Permutahedral_representation >Iterator over the k-faces of a simplex given by its permutahedral representation
 CGudhi::persistence_matrix::FieldOperatorsConcept of the field operator classes needed for the class Matrix
 CFilteredComplexThe 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
 CFiltrationValueValue type for a filtration function on a cell complex
 CGudhi::tangential_complex::Tangential_complex< Kernel_, DimensionTag, Concurrency_tag, Triangulation_ >::Fix_inconsistencies_infoType returned by Tangential_complex::fix_inconsistencies_using_perturbation
 CGudhi::coxeter_triangulation::Freudenthal_triangulation< Permutahedral_representation_ >A class that stores any affine transformation of the Freudenthal-Kuhn triangulation
 CGudhi::coxeter_triangulation::Freudenthal_triangulation< Permutahedral_representation< std::vector< int >, std::vector< std::vector< std::size_t > > > >
 CGudhi::coxeter_triangulation::Function_affine_plane_in_RdA class for the function that defines an m-dimensional implicit affine plane embedded in d-dimensional Euclidean space
 CGudhi::coxeter_triangulation::Function_chair_in_R3A class that encodes the function, the zero-set of which is a so-called "chair" surface embedded in R^3
 CGudhi::coxeter_triangulation::Function_iron_in_R3A class that encodes the function, the zero-set of which is a surface embedded in R^3 that ressembles an iron
 CGudhi::coxeter_triangulation::Function_lemniscate_revolution_in_R3A 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
 CGudhi::coxeter_triangulation::Function_moment_curve_in_RdA class for the function that defines an implicit moment curve in the d-dimensional Euclidean space
 CGudhi::coxeter_triangulation::Function_Sm_in_RdA class for the function that defines an m-dimensional implicit sphere embedded in the d-dimensional Euclidean space
 CGudhi::coxeter_triangulation::Function_torus_in_R3A class that encodes the function, the zero-set of which is a torus surface embedded in R^3
 CGudhi::coxeter_triangulation::Function_whitney_umbrella_in_R3A class that encodes the function, the zero-set of which is the Whitney umbrella surface embedded in R^3
 CGudhi::coxeter_triangulation::FunctionForImplicitManifoldThe concept FunctionForImplicitManifold describes the requirements for a type to implement an implicit function class used for example in Manifold_tracing
 CGudhi::skeleton_blocker::SkeletonBlockerDS::Graph_edgeThe type of edges that are stored the boost graph. An Edge must be Default Constructible and Equality Comparable
 CGudhi::skeleton_blocker::SkeletonBlockerDS::Graph_vertexThe type of vertices that are stored the boost graph. A Vertex must be Default Constructible and Equality Comparable
 Cstd::hash< Gudhi::persistence_matrix::Cell< Master_matrix > >Hash method for Gudhi::persistence_matrix::Cell
 Cstd::hash< Gudhi::persistence_matrix::Heap_column< Master_matrix > >Hash method for Gudhi::persistence_matrix::Heap_column
 Cstd::hash< Gudhi::persistence_matrix::Intrusive_list_column< Master_matrix > >Hash method for Gudhi::persistence_matrix::Intrusive_list_column
 Cstd::hash< Gudhi::persistence_matrix::Intrusive_set_column< Master_matrix > >Hash method for Gudhi::persistence_matrix::Intrusive_set_column
 Cstd::hash< Gudhi::persistence_matrix::List_column< Master_matrix > >Hash method for Gudhi::persistence_matrix::List_column
 Cstd::hash< Gudhi::persistence_matrix::Naive_vector_column< Master_matrix > >Hash method for Gudhi::persistence_matrix::Naive_vector_column
 Cstd::hash< Gudhi::persistence_matrix::Set_column< Master_matrix > >Hash method for Gudhi::persistence_matrix::Set_column
 Cstd::hash< Gudhi::persistence_matrix::Unordered_set_column< Master_matrix > >Hash method for Gudhi::persistence_matrix::Unordered_set_column
 Cstd::hash< Gudhi::persistence_matrix::Vector_column< Master_matrix > >Hash method for Gudhi::persistence_matrix::Vector_column
 CGudhi::Hasse_diagram::Hasse_diagram_cell< Incidence_type_, Filtration_type_, Additional_information_ >Data structure to store a cell in a Hasse diagram
 CGudhi::persistence_matrix::Heap_column< Master_matrix >Column class following the PersistenceMatrixColumn concept. Not compatible with row access
 CGudhi::Hooks_simplex_base_dummyNo hook when SimplexTreeOptions::link_nodes_by_label is false
 CGudhi::Hooks_simplex_base_link_nodesData structure to put all simplex tree nodes with same label into a list
 CGudhi::persistence_matrix::Id_to_index_overlay< Matrix_type, Master_matrix_type >Overlay for non-basic matrices replacing all input and output MatIdx indices of the original methods with IDIdx indices
 CGudhi::coxeter_triangulation::Implicit_manifold_intersection_oracle< Function_, Domain_function_ >An oracle that supports the intersection query on an implicit manifold
 CIndexingTagConcept describing an indexing scheme (see FilteredComplex) for applying continuous maps to a cell complex, and compute its persistent homology
 CGudhi::coxeter_triangulation::Integer_combination_iteratorClass that allows the user to generate combinations of k elements in a set of n elements. Based on the algorithm by Mifsud
 CGudhi::coxeter_triangulation::IntersectionOracleThe concept IntersectionOracle describes the requirements for a type to implement an intersection oracle class used for example in Manifold_tracing
 CGudhi::persistence_matrix::Intrusive_list_column< Master_matrix >Column class following the PersistenceMatrixColumn concept
 CGudhi::persistence_matrix::Intrusive_set_column< Master_matrix >Column class following the PersistenceMatrixColumn concept
 CGudhi::Simplex_tree_optimized_cofaces_rooted_subtrees_simplex_iterator< SimplexTree >::is_cofacePredicate to check whether an input SimplexTree::Node represents a coface of a simplex simp_, stored as a std::vector of SimplexTree::Vertex_handle sorted in decreasing Vertex_handle order
 CGudhi::spatial_searching::Kd_tree_search< Search_traits, Point_range >Spatial tree data structure to perform (approximate) nearest and furthest neighbor search
 CGudhi::spatial_searching::Kd_tree_search< K, Points >
 CGudhi::spatial_searching::Kd_tree_search< Kernel_, Point_range >
 CGudhi::Lazy_toplex_mapLazy toplex map data structure for representing unfiltered simplicial complexes
 CGudhi::coxeter_triangulation::Linear_transformation< Function_ >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
 CGudhi::persistence_matrix::List_column< Master_matrix >Column class following the PersistenceMatrixColumn concept
 CGudhi::coxeter_triangulation::Manifold_tracing< Triangulation_ >A class that assembles methods for manifold tracing algorithm
 CGudhi::persistence_matrix::Matrix< PersistenceMatrixOptions >Data structure for matrices, and in particular thought for matrices representing filtered complexes in order to compute persistence and/or representative cycles
 CGudhi::persistence_matrix::Matrix_all_dimension_holder< dimension_type >Class managing the maximal dimension of a face represented in the inheritating matrix, when the option of face removal is enabled
 CGudhi::persistence_matrix::Matrix_max_dimension_holder< dimension_type >Class managing the maximal dimension of a face represented in the inheritating matrix, when the option of face removal is not enabled
 CGudhi::persistence_matrix::Matrix_row_access< Row_type, Row_container_type, has_removable_rows, id_index >Class managing the row access for the inheritating matrix
 CGudhi::coxeter_triangulation::Mesh_meditStructure to store a mesh that can be output in Medit .mesh file format using the output_meshes_to_medit method
 CGudhi::persistence_fields::Multi_field_element< minimum, maximum >Class representing an element of a multi-field. The characteristics will corresponds to all prime numbers in the interval given as template
 CGudhi::persistence_fields::Multi_field_element_with_small_characteristics< minimum, maximum, Unsigned_integer_type, class >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
 CGudhi::persistence_fields::Multi_field_operatorsClass defining operators for a multi-field with "consecutive" charateristic range
 CGudhi::persistence_fields::Multi_field_operators_with_small_characteristicsClass defining operators for a multi-field with "consecutive" charateristic range, such that productOfAllCharacteristics ^ 2 fits into an unsigned int
 CGudhi::persistence_matrix::Naive_vector_column< Master_matrix >Column class following the PersistenceMatrixColumn concept
 CGudhi::coxeter_triangulation::Negation< Function_ >Constructs the "minus" function. The zero-set is the same, but the values at other points are the negative of their original value
 CGudhi::persistence_matrix::New_cell_constructor< Cell >Cell factory. Constructs and destroyes cell pointers with new and delete
 CGudhi::persistence_matrix::New_cell_constructor< Gudhi::persistence_matrix::Cell >
 CGudhi::Null_output_iterator
 CGudhi::tangential_complex::Tangential_complex< Kernel_, DimensionTag, Concurrency_tag, Triangulation_ >::Num_inconsistenciesType returned by Tangential_complex::number_of_inconsistent_simplices
 CGudhi::Off_readerOFF file reader top class visitor
 CGudhi::coxeter_triangulation::Ordered_set_partitionClass 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
 CGudhi::coxeter_triangulation::Ordered_set_partition_iteratorClass that allows the user to generate set partitions of a set {0,...,n-1} in k parts
 CGudhi::coxeter_triangulation::Permutahedral_representation< Vertex_, Ordered_set_partition_ >A class that stores the permutahedral representation of a simplex in a Coxeter triangulation or a Freudenthal-Kuhn triangulation
 CGudhi::coxeter_triangulation::Permutation_iteratorClass that allows the user to generate permutations. Based on the optimization of the Heap's algorithm by Sedgewick
 CGudhi::Persistence_representations::Persistence_heat_maps< Scalling_of_kernels >A class implementing persistence heat maps
 CGudhi::Persistence_representations::Persistence_heat_maps< constant_scaling_function >
 CGudhi::Persistence_interval_common< Filtration_type, Coefficient_field >
 CGudhi::Persistence_representations::Persistence_intervals
 CGudhi::Persistence_representations::Persistence_landscapeA class implementing persistence landscapes data structures
 CGudhi::Persistence_representations::Persistence_landscape_on_gridA class implementing persistence landscapes by approximating them on a collection of grid points
 CGudhi::persistence_diagram::PersistenceDiagramConcept of persistence diagram. It is a range of DiagramPoint. std::begin(diagram) and std::end(diagram) must return corresponding iterators
 CGudhi::persistence_matrix::PersistenceMatrixOptionsConcept of the template parameter for the class Matrix
 CPersistentHomologyConcept describing the requirements for a class to compute persistent homology
 CGudhi::coxeter_triangulation::PL_approximation< Function_, Triangulation_ >Constructs a piecewise-linear approximation of a function induced by an ambient triangulation
 CGudhi::contraction::Placement_policy< EdgeProfile >Policy to specify where the merged point had to be placed after an edge contraction
 CGudhi::Points_3D_off_reader< Point_3 >
 CGudhi::Points_3D_off_visitor_reader< Point_3 >OFF file visitor implementation according to Off_reader in order to read points from an OFF file
 CGudhi::Points_off_reader< Point_d >OFF file reader implementation in order to read points from an OFF file
 CGudhi::Points_off_visitor_reader< Point_d >OFF file visitor implementation according to Off_reader in order to read points from an OFF file
 CGudhi::persistence_matrix::Pool_cell_constructor< Cell >Cell factory. Uses Gudhi::Simple_object_pool, which is based on boost::object_pool, to construct and destroy cell pointer
 CGudhi::persistence_matrix::Pool_cell_constructor< Cell_type >
 CGudhi::persistence_matrix::Position_to_index_overlay< Matrix_type, Master_matrix_type >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
 CGudhi::coxeter_triangulation::Query_result< Simplex_handle >The result of a query by an oracle such as Implicit_manifold_intersection_oracle
 CGudhi::Persistence_representations::Real_valued_topological_dataThe concept Real_valued_topological_data describes the requirements for a type to implement a container that allows computations of its projections to R
 CGudhi::rips_complex::Rips_complex< Filtration_value >Rips complex data structure
 CGudhi::skeleton_blocker::Skeleton_blocker_simple_traits::Root_vertex_handleGlobal 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
 CGudhi::skeleton_blocker::SkeletonBlockerDS::Root_vertex_handleRoot_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
 CGudhi::persistence_matrix::Row_access< Master_matrix >Class managing the row access for the columns
 CGudhi::persistence_matrix::Matrix< PersistenceMatrixOptions >::RowCellCompCompaires two cells by their position in the row. They are assume to be in the same row
 CGudhi::persistence_matrix::RU_matrix< Master_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 faces while maintaining a valid barcode. Provides an access to its columns and rows
 CGudhi::persistence_matrix::RU_pairing< Master_matrix >Class managing the barcode for RU_matrix if the option was enabled
 CGudhi::persistence_matrix::RU_representative_cycles< Master_matrix >Class managing the representative cycles for RU_matrix if the option was enabled
 CGudhi::persistence_matrix::RU_vine_swap< Master_matrix >Class managing the vine swaps for RU_matrix
 CGudhi::persistence_matrix::Set_column< Master_matrix >Column class following the PersistenceMatrixColumn concept
 CGudhi::coxeter_triangulation::Set_partition_iteratorClass that allows the user to generate set partitions of a set {0,...,n-1} in k parts
 CGudhi::persistence_fields::Shared_multi_field_elementClass representing an element of a multi-field. If each instanciation of the class can represent another element, they all share the same characteritics. That is if the characteristics are set for one, they will be set for all the others. The characteristics can be set before instianciating the elements with the static Shared_multi_field_element::initialize method
 CGudhi::persistence_fields::Shared_multi_field_element_with_small_characteristics< Unsigned_integer_type, class >Class representing an element of a multi-field, such that productOfAllCharacteristics ^ 2 fits into the given Unsigned_integer_type template argument. If each instanciation of the class can represent another element, they all share the same characteritics. That is if the characteristics are set for one, they will be set for all the others. The characteristics can be set before instanciating the elements with the static Shared_multi_field_element_with_small_characteristics::initialize method
 CGudhi::persistence_fields::Shared_Zp_field_element< Unsigned_integer_type, class >Class representing an element of the \( \mathbb{F}_p \) field for any prime number \( p \). If each instanciation of the class can represent another element, they all share the same characteritics. That is if the characteristics are set for one, they will be set for all the others. The characteristics can be set before instianciating the elements with the static Shared_Zp_field_element::initialize method
 CGudhi::skeleton_blocker::Skeleton_blocker_simple_geometric_traits< GeometryTrait >::Simple_geometric_vertexVertex with a point attached
 CGudhi::skeleton_blocker::Simplex_around_vertex_iterator< SkeletonBlockerComplex, Link >
 CGudhi::skeleton_blocker::Simplex_coboundary_iterator< SkeletonBlockerComplex, Link >
 CGudhi::coxeter_triangulation::Simplex_comparator< Permutahedral_representation_ >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
 CGudhi::Simplex_tree< SimplexTreeOptions >Simplex Tree data structure for representing simplicial complexes
 CGudhi::Simplex_tree< Gudhi::Simplex_tree_options_fast_persistence >
 CGudhi::Simplex_tree_boundary_opposite_vertex_simplex_iterator< SimplexTree >Iterator over the simplices of the boundary of a simplex and their opposite vertices
 CGudhi::Simplex_tree_boundary_simplex_iterator< SimplexTree >Iterator over the simplices of the boundary of a simplex
 CGudhi::Simplex_tree_complex_simplex_iterator< SimplexTree >Iterator over the simplices of a simplicial complex
 CGudhi::Simplex_tree_node_explicit_storage< SimplexTree >Node of a simplex tree with filtration value and simplex key
 CGudhi::Simplex_tree_optimized_star_simplex_iterator< SimplexTree >Iterator over the simplices of the star of a simplex
 CGudhi::Simplex_tree_options_default
 CGudhi::Simplex_tree_options_full_featured
 CGudhi::Simplex_tree_options_minimal
 CGudhi::Simplex_tree_siblings< SimplexTree, MapContainer >Data structure to store a set of nodes in a SimplexTree sharing the same parent node
 CGudhi::Simplex_tree_siblings< Simplex_tree, Dictionary >
 CGudhi::Simplex_tree_simplex_vertex_iterator< SimplexTree >Iterator over the vertices of a simplex in a SimplexTree
 CGudhi::Simplex_tree_skeleton_simplex_iterator< SimplexTree >Iterator over the simplices of the skeleton of a given dimension of the simplicial complex
 CGudhi::coxeter_triangulation::SimplexInCoxeterTriangulationThe concept SimplexInCoxeterTriangulation describes the requirements for a type to implement a representation of simplices in Freudenthal_triangulation or in Coxeter_triangulation
 CSimplexKeyKey type used as simplex identifier
 CSimplexTreeOptionsConcept of the template parameter for the class Gudhi::Simplex_tree<SimplexTreeOptions>
 CGudhi::alpha_complex::SimplicialComplexForAlphaThe concept SimplicialComplexForAlpha describes the requirements for a type to implement a simplicial complex, that can be created from a Alpha_complex
 CGudhi::alpha_complex::SimplicialComplexForAlpha3dThe concept SimplicialComplexForAlpha3d describes the requirements for a type to implement a simplicial complex, that can be created from a Alpha_complex_3d
 CGudhi::cech_complex::SimplicialComplexForCechThe concept SimplicialComplexForCech describes the requirements for a type to implement a simplicial complex, that can be created from a Cech_complex
 CGudhi::cech_complex::SimplicialComplexForMEB
 CGudhi::rips_complex::SimplicialComplexForRipsThe 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
 CGudhi::witness_complex::SimplicialComplexForWitnessThe 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
 CGudhi::coxeter_triangulation::Size_iterator< T_it >Auxiliary iterator class for sizes of parts in an ordered set partition
 CGudhi::skeleton_blocker::Skeleton_blocker_complex< SkeletonBlockerDS >Abstract Simplicial Complex represented with a skeleton/blockers pair
 CGudhi::skeleton_blocker::Skeleton_blocker_complex< SkeletonBlockerGeometricDS >
 CGudhi::skeleton_blocker::Skeleton_blocker_complex_visitor< Vertex_handle >Interface for a visitor of a simplicial complex
 CGudhi::skeleton_blocker::Skeleton_blocker_complex_visitor< GeometricSimplifiableComplex::Vertex_handle >
 CGudhi::skeleton_blocker::Skeleton_blocker_off_flag_visitor_reader< Complex >Off reader visitor that can be passed to Off_reader to read a Skeleton_blocker_complex
 CGudhi::skeleton_blocker::Skeleton_blocker_off_reader< Complex >Class that allows to load a Skeleton_blocker_complex from an off file
 CGudhi::skeleton_blocker::Skeleton_blocker_off_visitor_reader< Complex >Off reader visitor that can be passed to Off_reader to read a Skeleton_blocker_complex
 CGudhi::skeleton_blocker::Skeleton_blocker_simplex< T >Abstract simplex used in Skeleton blockers data-structure
 CGudhi::cubical_complex::Bitmap_cubical_complex< T >::Skeleton_simplex_rangeA range containing all the cells of dimension at most k
 CGudhi::skeleton_blocker::SkeletonBlockerDSConcept 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
 CGudhi::Persistence_representations::Sliced_WassersteinA class implementing the Sliced Wasserstein kernel
 CGudhi::rips_complex::Sparse_rips_complex< Filtration_value >Sparse Rips complex data structure
 CGudhi::Persistence_representations::squared_distance_from_diagonal_scaling
 CGudhi::witness_complex::Strong_witness_complex< Nearest_landmark_table_ >Constructs strong witness complex for a given table of nearest landmarks with respect to witnesses
 CGudhi::witness_complex::Strong_witness_complex< std::vector< Gudhi::spatial_searching::Kd_tree_search< Kernel_, std::vector< Kernel_::Point_d > >::INS_range > >
 CGudhi::tangential_complex::Tangential_complex< Kernel_, DimensionTag, Concurrency_tag, Triangulation_ >Tangential complex data structure
 CGudhi::cubical_complex::Bitmap_cubical_complex_base< T >::Top_dimensional_cells_iteratorIterator through top dimensional cells of the complex. The cells appear in order they are stored in the structure (i.e. in lexicographical order)
 CGudhi::cubical_complex::Bitmap_cubical_complex_base< T >::Top_dimensional_cells_rangeRange corresponding to Top_dimensional_cells_iterator
 CGudhi::Toplex_mapToplex map data structure for representing unfiltered simplicial complexes
 CGudhi::Persistence_representations::Topological_data_with_averagesThe 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
 CGudhi::Persistence_representations::Topological_data_with_distancesThe 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
 CGudhi::Persistence_representations::Topological_data_with_scalar_productThe concept Topological_data_with_scalar_product describes the requirements for a type to implement a container that allows computations of scalar products
 CGudhi::coxeter_triangulation::Translate< Function_ >Translates the zero-set of the function by a vector. The underlying function corresponds to f(x-off), where off is the offset vector
 CGudhi::skeleton_blocker::Triangle_around_vertex_iterator< Complex, LinkType >Iterator over the triangles that are adjacent to a vertex of the simplicial complex
 CGudhi::skeleton_blocker::Triangle_iterator< SkeletonBlockerComplex >Iterator over the triangles of the simplicial complex
 CGudhi::coxeter_triangulation::TriangulationForManifoldTracingThe concept TriangulationForManifoldTracing describes the requirements for a type to implement a triangulation class used for example in Manifold_tracing
 CGudhi::persistence_matrix::Unordered_set_column< Master_matrix >Column class following the PersistenceMatrixColumn concept
 CGudhi::contraction::Valid_contraction_policy< EdgeProfile >Policy to specify if an edge contraction is valid or not
 CGudhi::persistence_matrix::Vector_column< Master_matrix >Column class following the PersistenceMatrixColumn concept
 CGudhi::Persistence_representations::Vector_distances_in_diagram< F >A class implementing persistence vectors
 CGudhi::Persistence_representations::Vectorized_topological_dataThe concept Vectorized_topological_data describes the requirements for a type to implement a container that allows vectorization
 CGudhi::skeleton_blocker::SkeletonBlockerDS::Vertex_handle
 CGudhi::coxeter_triangulation::Vertex_iterator< Permutahedral_representation >Iterator over the vertices of a simplex represented by its permutahedral representation
 CGudhi::skeleton_blocker::Vertex_iterator< SkeletonBlockerComplex >Iterator on the vertices of a simplicial complex
 CVertexHandleHandle type for the vertices of a cell complex
 CGudhi::Persistence_representations::weight_by_setting_maximal_interval_to_have_length_one
 CGudhi::witness_complex::Witness_complex< Nearest_landmark_table_ >Constructs (weak) witness complex for a given table of nearest landmarks with respect to witnesses
 CGudhi::witness_complex::Witness_complex< std::vector< Gudhi::spatial_searching::Kd_tree_search< Kernel_, std::vector< Kernel_::Point_d > >::INS_range > >
 CGudhi::persistence_fields::Z2_field_elementClass representing an element of the \( \mathbb{F}_2 \) field
 CGudhi::persistence_fields::Z2_field_operatorsClass defining operators for the \( \mathbb{F}_2 \) field
 CGudhi::persistence_fields::Zp_field_element< characteristic, Unsigned_integer_type, class >Class representing an element of the \( \mathbb{F}_p \) field for any prime number \( p \)
 CGudhi::persistence_fields::Zp_field_operators< Unsigned_integer_type, class >Class defining operators for the \( \mathbb{F}_p \) field for any prime number \( p \)