Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 1234]
 CGudhi::cubical_complex::Bitmap_cubical_complex_base< T >::All_cells_iteratorIterator 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_rangeAll_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< Kernel >
 CGudhi::alpha_complex::Alpha_complex_3d< Complexity, Weighted, Periodic >Alpha complex data structure for 3d specific case
 CGudhi::alpha_complex::Alpha_complex_3d< Complexity, false, false >
 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_base< double >
 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::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< SimplicialComplexForProximityGraph, ForwardPointRange >Cech complex data structure
 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
 CCoefficientFieldConcept describing the requirements for a class to represent a field of coefficients to compute persistent homology
 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::cubical_complex::counterThis is an implementation of a counter being a vector of integers
 CGudhi::cover_complex::Cover_complex< Point >Cover complex data structure
 CGudhi::cover_complex::Cover_complex< std::vector< double > >
 CCritical_points< SkBlComplex >
 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
 CEdge_collapsor< SkBlComplex >
 CEdge_contractor< SkBlComplex >
 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
 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
 CGudhi::cubical_complex::Bitmap_cubical_complex< T >::Filtration_simplex_rangeFiltration_simplex_range provides the ranges for Filtration_simplex_iterator
 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
 CFurthest_point_epsilon_net< SkBlComplex >
 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
 CGudhi::Hasse_diagram::Hasse_diagram_cell< Incidence_type_, Filtration_type_, Additional_information_ >Data structure to store a cell in a Hasse diagram
 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
 CIs_manifold< SkBlComplex >
 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
 CLloyd_builder< SkBlComplex >
 CGudhi::coxeter_triangulation::Manifold_tracing< Triangulation_ >A class that assembles methods for manifold tracing algorithm
 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::Minimal_enclosing_ball_radiusCompute 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::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::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
 CPersistence_compute< SkBlComplex >
 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
 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::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::coxeter_triangulation::Set_partition_iteratorClass that allows the user to generate set partitions of a set {0,...,n-1} in k parts
 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< Simplex_tree_options_full_featured >
 CGudhi::Simplex_tree_options_fast_persistence
 CGudhi::Simplex_tree_options_full_featured
 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::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 >Auxillary 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_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_rangeClass needed for compatibility with Gudhi. Not useful for other purposes
 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< Nearest_landmark_table >
 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_rangeTop_dimensional_cells_iterator_range class provides ranges for Top_dimensional_cells_iterator_range
 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::contraction::Valid_contraction_policy< EdgeProfile >Policy to specify if an edge contraction is valid or not
 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
 CVertex_collapsor< SkBlComplex >
 CGudhi::skeleton_blocker::SkeletonBlockerDS::Vertex_handle
 CGudhi::skeleton_blocker::Vertex_iterator< SkeletonBlockerComplex >Iterator on the vertices of a simplicial complex
 CVertexHandleHandle type for the vertices of a cell complex
 CView_parameter
 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< Nearest_landmark_table >
 CGudhi::witness_complex::Witness_complex< std::vector< Gudhi::spatial_searching::Kd_tree_search< Kernel_, std::vector< Kernel_::Point_d > >::INS_range > >
GUDHIdev  Version 3.5.0  - C++ library for Topological Data Analysis (TDA) and Higher Dimensional Geometry Understanding.  - Copyright : MIT Generated on Sun May 1 2022 09:19:32 for GUDHIdev by Doxygen 1.9.1