songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

fix links

This commit is contained in:
Andreas Fabri 2015-01-29 10:04:03 +01:00
parent 520e47fc16
commit 567a557930
3 changed files with 4 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
BGL/doc/BGL/graph_traits.txt
View File

@ -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>.

3
Spatial_searching/doc/Spatial_searching/Spatial_searching.txt
View File

@ -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}

1
Spatial_searching/doc/Spatial_searching/dependencies
View File

@ -7,3 +7,4 @@ Stream_support
Kernel_d
Surface_mesh
Polyhedron
BGL