From 567a557930cb7b41915f0586ff0a62c24d9edf5c Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 29 Jan 2015 10:04:03 +0100
Subject: [PATCH] fix links

---
 BGL/doc/BGL/graph_traits.txt                                  | 2 +-
 Spatial_searching/doc/Spatial_searching/Spatial_searching.txt | 3 ++-
 Spatial_searching/doc/Spatial_searching/dependencies          | 1 +
 3 files changed, 4 insertions(+), 2 deletions(-)

diff --git a/BGL/doc/BGL/graph_traits.txt b/BGL/doc/BGL/graph_traits.txt
index 87d826a3ecc..5b62c9e8b43 100644
--- a/BGL/doc/BGL/graph_traits.txt
+++ b/BGL/doc/BGL/graph_traits.txt
@@ -88,7 +88,7 @@ that is the default hash functor of `CGAL::Unique_hash_map`.
 
 Defined in `<CGAL/boost/graph/graph_traits_Triangulation_2.h>` and `<CGAL/boost/graph/graph_traits_Delaunay_triangulation_2.h>`
 
-We provide partial specialization for the classes `Triangulation_2` and `Delaunay_triangulation_2`
+We provide partial specialization for the classes `CGAL::Triangulation_2` and `CGAL::Delaunay_triangulation_2`
 so that they are model of the graph concepts
 <A HREF="http://www.boost.org/libs/graph/doc/BidirectionalGraph.html">`BidirectionalGraph`</A> and
 <A HREF="http://www.boost.org/libs/graph/doc/EdgeAndVertexListGraph.html">`EdgeAndVertexListGraph`</A>.
diff --git a/Spatial_searching/doc/Spatial_searching/Spatial_searching.txt b/Spatial_searching/doc/Spatial_searching/Spatial_searching.txt
index ca61d5d8445..22f9ccc4f70 100644
--- a/Spatial_searching/doc/Spatial_searching/Spatial_searching.txt
+++ b/Spatial_searching/doc/Spatial_searching/Spatial_searching.txt
@@ -376,7 +376,8 @@ Points are read from a `std::map`. The search tree stores integers of type `std:
 
 This example programs shows how to search the closest vertices of a `Surface_mesh` or, quite similar, of a 
 `Polyhedron_3`.
-Points are stored in the polygonal mesh. The search tree stores vertex descriptors. The value type of the iterator of the neighbor searching algorithm is `boost::graph_traits<Mesh>::vertex_descriptor`.
+Points are stored in the polygonal mesh. The search tree stores vertex descriptors.
+The value type of the iterator of the neighbor searching algorithm is \link  BGLSMGT `boost::graph_traits<Surface_mesh>::vertex_descriptor` \endlink.
 
 \cgalExample{Spatial_searching/searching_surface_mesh_vertices.cpp}
 
diff --git a/Spatial_searching/doc/Spatial_searching/dependencies b/Spatial_searching/doc/Spatial_searching/dependencies
index 81b09a3d80e..a18f64dabd4 100644
--- a/Spatial_searching/doc/Spatial_searching/dependencies
+++ b/Spatial_searching/doc/Spatial_searching/dependencies
@@ -7,3 +7,4 @@ Stream_support
 Kernel_d
 Surface_mesh
 Polyhedron
+BGL