diff options
| author | Marc Glisse <marc.glisse@inria.fr> | 2019-11-26 23:08:53 +0100 |
|---|---|---|
| committer | Marc Glisse <marc.glisse@inria.fr> | 2019-11-29 10:52:10 +0100 |
| commit | fe3bbb9b3de5001ba943d3be7109712847ec44ef (patch) | |
| tree | 342d67fdc5a661d2238e2444f1dd778647c5c0b1 /src/python/doc/simplex_tree_user.rst | |
| parent | 8ebfb8c5de9c55a20e3dafebc8f506ccb698bb68 (diff) | |
Fix various links for sphinx
and some minor doc changes along the way.
(why were we documenting a hasse diagram that doesn't exist?)
Diffstat (limited to 'src/python/doc/simplex_tree_user.rst')
| -rw-r--r-- | src/python/doc/simplex_tree_user.rst | 10 |
1 files changed, 3 insertions, 7 deletions
diff --git a/src/python/doc/simplex_tree_user.rst b/src/python/doc/simplex_tree_user.rst index aebeb29f..3df7617f 100644 --- a/src/python/doc/simplex_tree_user.rst +++ b/src/python/doc/simplex_tree_user.rst @@ -23,13 +23,9 @@ scheme. Implementation -------------- -There are two implementation of complexes. The first on is the Simplex_tree data structure. -The simplex tree is an efficient and flexible data structure for representing general (filtered) simplicial complexes. -The data structure is described in :cite`boissonnatmariasimplextreealgorithmica`. - -The second one is the Hasse_complex. The Hasse complex is a data structure representing explicitly all co-dimension 1 -incidence relations in a complex. It is consequently faster when accessing the boundary of a simplex, but is less -compact and harder to construct from scratch. +The :class:`simplex tree<gudhi.SimplexTree>` is an efficient and flexible data structure for representing general +(filtered) simplicial complexes. +The data structure is described in :cite:`boissonnatmariasimplextreealgorithmica`. Example ------- |