Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 1234]
 NGudhi
 Nalpha_complex
 Ncech_complex
 Ncontraction
 Ncover_complex
 Ncubical_complex
 Npersistence_diagram
 NPersistence_representations
 Npersistent_cohomology
 Nrips_complex
 Nskeleton_blocker
 Nspatial_searching
 Ntangential_complex
 Nwitness_complex
 CEuclidean_distanceCompute the Euclidean distance between two Points given by a range of coordinates. The points are assumed to have the same dimension
 Clinear_indexing_tagTag for a linear ordering of simplices
 CMinimal_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
 CNull_output_iterator
 COff_readerOFF file reader top class visitor
 CPersistence_interval_common
 CPoints_3D_off_reader
 CPoints_3D_off_visitor_readerOFF file visitor implementation according to Off_reader in order to read points from an OFF file
 CPoints_off_readerOFF file reader implementation in order to read points from an OFF file
 CPoints_off_visitor_readerOFF file visitor implementation according to Off_reader in order to read points from an OFF file
 CSimplex_treeSimplex Tree data structure for representing simplicial complexes
 CSimplex_tree_options_fast_persistence
 CSimplex_tree_options_full_featured
 CCoefficientFieldConcept describing the requirements for a class to represent a field of coefficients to compute persistent homology
 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
 CIndexingTagConcept describing an indexing scheme (see FilteredComplex) for applying continuous maps to a cell complex, and compute its persistent homology
 CPersistentHomologyConcept describing the requirements for a class to compute persistent homology
 CSimplexKeyKey type used as simplex identifier
 CSimplexTreeOptionsConcept of the template parameter for the class Gudhi::Simplex_tree<SimplexTreeOptions>
 CVertexHandleHandle type for the vertices of a cell complex
GUDHI  Version 2.2.0  - C++ library for Topological Data Analysis (TDA) and Higher Dimensional Geometry Understanding.  - Copyright : GPL v3 Generated on Tue Aug 14 2018 11:45:43 for GUDHI by Doxygen 1.8.13