CGudhi::cubical_complex::Bitmap_cubical_complex_base< T >::All_cells_iterator | Iterator through all cells in the complex (in order they appear in the structure – i.e. in lexicographical order) |
CGudhi::cubical_complex::Bitmap_cubical_complex_base< T >::All_cells_range | All_cells_range class provides ranges for All_cells_iterator |
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::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::cubical_complex::Bitmap_cubical_complex_periodic_boundary_conditions_base< T > | Cubical complex with periodic boundary conditions represented as a bitmap |
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::cech_complex::Cech_complex< SimplicialComplexForProximityGraph, ForwardPointRange > | Cech complex data structure |
►CCoefficientField | Concept describing the requirements for a class to represent a field of coefficients to compute persistent homology |
CGudhi::persistent_cohomology::Field_Zp | Structure representing the coefficient field \(\mathbb{Z}/p\mathbb{Z}\) |
CGudhi::persistent_cohomology::Multi_field | Structure representing coefficients in a set of finite fields simultaneously using the chinese remainder theorem |
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::Contraction_visitor_remove_popable< Profile > | Visitor to remove popable blockers after an edge contraction |
►CGudhi::contraction::Cost_policy< EdgeProfile > | Policy to specify the cost of contracting an edge |
CGudhi::contraction::Edge_length_cost< EdgeProfile > | Return a cost corresponding to the squared length of the edge |
CGudhi::cubical_complex::counter | This is an implementation of a counter being a vector of integers |
CGudhi::cover_complex::Cover_complex< Point > | Cover complex data structure |
CGudhi::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 |
CGudhi::Persistence_representations::distance_from_diagonal_scaling | |
CGudhi::skeleton_blocker::Edge_iterator< SkeletonBlockerComplex > | Iterator on the edges of a simplicial complex |
CGudhi::Euclidean_distance | Compute the Euclidean distance between two Points given by a range of coordinates. The points are assumed to have the same dimension |
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 |
CGudhi::cubical_complex::Bitmap_cubical_complex< T >::Filtration_simplex_range | Filtration_simplex_range provides the ranges for Filtration_simplex_iterator |
CFiltrationValue | Value type for a filtration function on a cell complex |
CGudhi::tangential_complex::Tangential_complex< Kernel_, DimensionTag, Concurrency_tag, Triangulation_ >::Fix_inconsistencies_info | Type returned by Tangential_complex::fix_inconsistencies_using_perturbation |
►CGudhi::skeleton_blocker::SkeletonBlockerDS::Graph_edge | The type of edges that are stored the boost graph. An Edge must be Default Constructible and Equality Comparable |
CGudhi::skeleton_blocker::SkeletonBlockerGeometricDS< GeometryTrait >::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 |
►CGudhi::skeleton_blocker::SkeletonBlockerDS::Graph_vertex | The type of vertices that are stored the boost graph. A Vertex must be Default Constructible and Equality Comparable |
CGudhi::skeleton_blocker::SkeletonBlockerGeometricDS< GeometryTrait >::Graph_vertex | Vertex that stores a point |
►CIndexingTag | Concept describing an indexing scheme (see FilteredComplex) for applying continuous maps to a cell complex, and compute its persistent homology |
CGudhi::linear_indexing_tag | Tag for a linear ordering of simplices |
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_map | Lazy toplex map data structure for representing unfiltered simplicial complexes |
CGudhi::Minimal_enclosing_ball_radius | Compute the radius of the minimal enclosing ball between Points given by a range of coordinates. The points are assumed to have the same dimension |
CGudhi::Null_output_iterator | |
CGudhi::tangential_complex::Tangential_complex< Kernel_, DimensionTag, Concurrency_tag, Triangulation_ >::Num_inconsistencies | Type returned by Tangential_complex::number_of_inconsistent_simplices |
CGudhi::Off_reader | OFF file reader top class visitor |
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_representations::PSSK | |
CGudhi::Persistence_interval_common< Filtration_type, Coefficient_field > | |
CGudhi::Persistence_representations::Persistence_intervals | |
CGudhi::Persistence_representations::Persistence_landscape | A class implementing persistence landscapes data structures |
CGudhi::Persistence_representations::Persistence_landscape_on_grid | A class implementing persistence landscapes by approximating them on a collection of grid points |
CGudhi::persistence_diagram::PersistenceDiagram | Concept of persistence diagram. It is a range of DiagramPoint . std::begin(diagram) and std::end(diagram) must return corresponding iterators |
►CPersistentHomology | Concept describing the requirements for a class to compute persistent homology |
CGudhi::persistent_cohomology::Persistent_cohomology< FilteredComplex, CoefficientField > | Computes the persistent cohomology of a filtered complex |
►CGudhi::contraction::Placement_policy< EdgeProfile > | Policy to specify where the merged point had to be placed after an edge contraction |
CGudhi::contraction::First_vertex_placement< EdgeProfile > | Places the contracted point onto the first point of the edge |
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_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 |
CGudhi::rips_complex::Rips_complex< Filtration_value > | Rips complex data structure |
CGudhi::skeleton_blocker::SkeletonBlockerDS::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 |
CGudhi::skeleton_blocker::Skeleton_blocker_simple_traits::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 |
CGudhi::skeleton_blocker::Skeleton_blocker_simple_geometric_traits< GeometryTrait >::Simple_geometric_vertex | Vertex with a point attached |
CGudhi::skeleton_blocker::Simplex_around_vertex_iterator< SkeletonBlockerComplex, Link > | |
CGudhi::skeleton_blocker::Simplex_coboundary_iterator< SkeletonBlockerComplex, Link > | |
CGudhi::Simplex_tree< SimplexTreeOptions > | Simplex Tree data structure for representing simplicial complexes |
CGudhi::Simplex_tree_options_fast_persistence | |
CGudhi::Simplex_tree_options_full_featured | |
CSimplexKey | Key type used as simplex identifier |
CSimplexTreeOptions | Concept of the template parameter for the class Gudhi::Simplex_tree<SimplexTreeOptions> |
CGudhi::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 |
CGudhi::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 |
CGudhi::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 |
CGudhi::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 |
CGudhi::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 |
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_geometric_complex< SkeletonBlockerGeometricDS > | Class that represents a geometric complex that can be simplified. The class allows access to points of vertices |
►CGudhi::skeleton_blocker::Skeleton_blocker_complex_visitor< Vertex_handle > | Interface for a visitor of a simplicial complex |
CGudhi::skeleton_blocker::Dummy_complex_visitor< Vertex_handle > | A dummy visitor of a simplicial complex that does nothing |
CGudhi::skeleton_blocker::Print_complex_visitor< Vertex_handle > | A visitor that prints the visit information |
►CGudhi::skeleton_blocker::Skeleton_blocker_complex_visitor< GeometricSimplifiableComplex::Vertex_handle > | |
►CGudhi::skeleton_blocker::Dummy_complex_visitor< GeometricSimplifiableComplex::Vertex_handle > | |
CGudhi::contraction::Skeleton_blocker_contractor< GeometricSimplifiableComplex, EdgeProfile > | Class that allows to contract iteratively edges of a simplicial complex |
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::skeleton_blocker::Skeleton_blocker_sub_complex< ComplexType > | Simplicial subcomplex of a complex represented by a skeleton/blockers pair |
►CGudhi::skeleton_blocker::Skeleton_blocker_link_complex< ComplexType > | 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 |
CGudhi::skeleton_blocker::Skeleton_blocker_link_superior< ComplexType > | 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 |
CGudhi::cubical_complex::Bitmap_cubical_complex< T >::Skeleton_simplex_range | Class needed for compatibility with Gudhi. Not useful for other purposes |
►CGudhi::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 |
►CGudhi::skeleton_blocker::Skeleton_blocker_simple_traits | Simple traits that is a model of SkeletonBlockerDS and can be passed as a template argument to Skeleton_blocker_complex |
CGudhi::skeleton_blocker::Skeleton_blocker_simple_geometric_traits< GeometryTrait > | Simple traits that is a model of SkeletonBlockerGeometricDS and can be passed as a template argument to Skeleton_blocker_geometric_complex |
►CGudhi::skeleton_blocker::SkeletonBlockerGeometricDS< GeometryTrait > | Concept for template class of Skeleton_blocker_geometric_complex . It must specify a GeometryTrait which contains a Point definition |
CGudhi::skeleton_blocker::Skeleton_blocker_simple_geometric_traits< GeometryTrait > | Simple traits that is a model of SkeletonBlockerGeometricDS and can be passed as a template argument to Skeleton_blocker_geometric_complex |
CGudhi::Persistence_representations::Sliced_Wasserstein | A 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::witness_complex::Euclidean_strong_witness_complex< Kernel_ > | Constructs strong witness complex for given sets of witnesses and landmarks in Euclidean space |
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_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) |
CGudhi::cubical_complex::Bitmap_cubical_complex_base< T >::Top_dimensional_cells_range | Top_dimensional_cells_iterator_range class provides ranges for Top_dimensional_cells_iterator_range |
CGudhi::Toplex_map | Toplex map data structure for representing unfiltered simplicial complexes |
CGudhi::Persistence_representations::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 |
CGudhi::Persistence_representations::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 |
CGudhi::Persistence_representations::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 |
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::contraction::Valid_contraction_policy< EdgeProfile > | Policy to specify if an edge contraction is valid or not |
CGudhi::contraction::Dummy_valid_contraction< EdgeProfile > | Policy that accept all edge contraction |
CGudhi::contraction::Link_condition_valid_contraction< EdgeProfile > | Policy that only accept edges verifying the link condition (and therefore whose contraction preserving homotopy type) |
CGudhi::Persistence_representations::Vector_distances_in_diagram< F > | A class implementing persistence vectors |
CGudhi::Persistence_representations::Vectorized_topological_data | The concept Vectorized_topological_data describes the requirements for a type to implement a container that allows vectorization |
CGudhi::skeleton_blocker::SkeletonBlockerDS::Vertex_handle | |
CGudhi::skeleton_blocker::Vertex_iterator< SkeletonBlockerComplex > | Iterator on the vertices of a simplicial complex |
CVertexHandle | Handle 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::witness_complex::Euclidean_witness_complex< Kernel_ > | Constructs (weak) witness complex for given sets of witnesses and landmarks in Euclidean space |