GUDHI 2.1.0 as released by upstream in a tarball.upstream/2.1.0

1 files changed, 6 insertions, 4 deletions

diff --git a/doc/Simplex_tree/Intro_simplex_tree.h b/doc/Simplex_tree/Intro_simplex_tree.h
index f5b72ff6..6b80d1c9 100644
--- a/doc/Simplex_tree/Intro_simplex_tree.h
+++ b/doc/Simplex_tree/Intro_simplex_tree.h
@@ -67,16 +67,18 @@ Information of the Simplex Tree:
 Number of vertices = 10   Number of simplices = 98 \endcode
  * 
  * \li <a href="_simplex_tree_2example_alpha_shapes_3_simplex_tree_from_off_file_8cpp-example.html">
- * Simplex_tree/example_alpha_shapes_3_simplex_tree_from_off_file.cpp</a> - Simplex tree is computed and displayed from a 3D alpha
- * complex (Requires CGAL, GMP and GMPXX to be installed)
- * 
+ * Simplex_tree/example_alpha_shapes_3_simplex_tree_from_off_file.cpp</a> - Simplex tree is computed and displayed
+ * from a 3D alpha complex (Requires CGAL, GMP and GMPXX to be installed).
  * 
+ * \li <a href="_simplex_tree_2graph_expansion_with_blocker_8cpp-example.html">
+ * Simplex_tree/graph_expansion_with_blocker.cpp</a> - Simple simplex tree construction from a one-skeleton graph with
+ * a simple blocker expansion method.
+ *
  * \subsection filteredcomplexeshassecomplex Hasse complex
  * 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.
  * 
- * \copyright GNU General Public License v3.
  * @}
  */