From e68da7b985ea80024d581e2d834ac414996aeffb Mon Sep 17 00:00:00 2001 From: Andreas Fabri Date: Fri, 15 Sep 2006 15:17:47 +0000 Subject: [PATCH] small fixes --- BGL/doc_tex/BGL_ref/DirectedEmbeddedGraph.tex | 42 ++++++++----------- BGL/doc_tex/BGL_ref/HalfedgeGraph.tex | 8 ++-- .../BGL_ref/VertexPointPropertyMap.tex | 2 +- 3 files changed, 22 insertions(+), 30 deletions(-) diff --git a/BGL/doc_tex/BGL_ref/DirectedEmbeddedGraph.tex b/BGL/doc_tex/BGL_ref/DirectedEmbeddedGraph.tex index 8219157c9b4..722ae2496ed 100644 --- a/BGL/doc_tex/BGL_ref/DirectedEmbeddedGraph.tex +++ b/BGL/doc_tex/BGL_ref/DirectedEmbeddedGraph.tex @@ -46,22 +46,22 @@ and such ordering can be used to define the following edge relations: An edge \ccc{'v: x->y'} is said to be the {\em opposite} of edge \ccc{'u: a->b'} iff \ccc{a} $==$ \ccc{y} and \ccc{b} $==$ \ccc{c}. -\item[Rotational Succesor] +\item[Rotational Successor] An edge \ccc{'v: s->q'} is said to be the {\em rotational succesor} of edge \ccc{'u: s->p'} iff \ccc{v} is the {\em first} edge found by a counter-clockwise rotation of \ccc{u} around the source vertex \ccc{s}. -\item[Rotational Predeccesor] +\item[Rotational Predecessor] An edge \ccc{'v: s->q'} is said to be the {\em rotational predeccesor} of edge \ccc{'u: s->p'} iff \ccc{v} is the {\em first} edge found by a clockwise rotation of \ccc{u} around the source vertex \ccc{s}. -\item[Linear Succesor] +\item[Linear Successor] An edge \ccc{'v: b->c'} is said to be the {\em linear succesor} of edge \ccc{'u:a->b'} iff \ccc{v} is the rotational succesor of the opposite of v. -\item[Linear Predeccesor] +\item[Linear Predecessor] An edge \ccc{'v: b->c'} is said to be the {\em linear predeccesor} of edge \ccc{'u:a->b'} iff \ccc{v} is the opposite of the rotational predeccesor of v. @@ -85,7 +85,7 @@ Following the BGL interface, the following graph operations are defined as free typename boost::graph_traits::edge_descriptor opposite_edge(typename boost::graph_traits::edge_descriptor e, Graph const& g ); } - {Returns the {\em opposite} of e.\\ + {Returns the {\em opposite} of \ccc{e}.\\ If the resulting edge does not belong to \ccc{g} the result is a \ccc{null} (default constructed) edge.\\ (non-const version ommited) } @@ -95,7 +95,7 @@ Following the BGL interface, the following graph operations are defined as free typename boost::graph_traits::edge_descriptor next_edge_ccw(typename boost::graph_traits::edge_descriptor e, Graph const& g ); } - {Returns the {\em rotational succesor} of e.\\ + {Returns the {\em rotational succesor} of \ccc{e}.\\ If the resulting edge does not belong to \ccc{g} the result is a \ccc{null} (default constructed) edge.\\ (non-const version ommited) } @@ -105,54 +105,48 @@ Following the BGL interface, the following graph operations are defined as free typename boost::graph_traits::edge_descriptor next_edge_cw(typename boost::graph_traits::edge_descriptor e, Graph const& g ); } - {Returns the {\em rotational predeccesor} of e.\\ - If the resulting edge does not belong to \ccc{g} the result is a \ccc{null} (default constructed) edge.\\ - (non-const version ommited) - } + {Returns the {\em rotational predeccesor} of \ccc{e}.\\ + If the resulting edge does not belong to \ccc{g} the result is a \ccc{null} (default constructed) edge. } \ccFunction {template typename boost::graph_traits::edge_descriptor next_edge(typename boost::graph_traits::edge_descriptor e, Graph const& g ); } - {Returns the {\em linear succesor} of e.\\ - If the resulting edge does not belong to \ccc{g} the result is a \ccc{null} (default constructed) edge.\\ - (non-const version ommited) - } + {Returns the {\em linear succesor} of \ccc{e}.\\ + If the resulting edge does not belong to \ccc{g} the result is a \ccc{null} (default constructed) edge. } \ccFunction {template typename boost::graph_traits::edge_descriptor prev_edge(typename boost::graph_traits::edge_descriptor e, Graph const& g ); } - {Returns the {\em linear predeccesor} of e.\\ - If the resulting edge does not belong to \ccc{g} the result is a \ccc{null} (default constructed) edge.\\ - (non-const version ommited) - } + {Returns the {\em linear predeccesor} of \ccc{e}.\\ + If the resulting edge does not belong to \ccc{g} the result is a \ccc{null} (default constructed) edge. } \ccFunction {template - typename CGAL::Embeeded_graph_traits::Point const& + typename CGAL::embedded_graph_traits::Point const& get_point(typename boost::graph_traits::vertex_descriptor v, Graph const& g ); } - {Returns the generalized point embeeding the vertex \ccc{v}.\\ - The exact nature of the point depends on the embeeding of the graph and is + {Returns the generalized point embedding the vertex \ccc{v}.\\ + The exact nature of the point depends on the embedding of the graph and is specified by the concrete model.} \ccFunction {template void set_point(typename boost::graph_traits::vertex_descriptor v ,Graph& g - ,typename CGAL::Embeeded_graph_traits::Point p + ,typename CGAL::embedded_graph_traits::Point p ); } - {Sets \ccc{p} as the embeeding of the vertex \ccc{v}. + {Sets \ccc{p} as the embedding of the vertex \ccc{v}. } \ccHasModels \ccRefIdfierPage{boost::graph_traits< CGAL::Polyhedron_3 const > }\\ \ccRefIdfierPage{boost::graph_traits< CGAL::Polyhedron_3 > }\\ -\ccRefIdfierPage{CGAL::Embeeded_graph_traits< CGAL::Polyhedron_3 > }\\ +\ccRefIdfierPage{CGAL::embedded_graph_traits< CGAL::Polyhedron_3 > } \end{ccRefConcept} diff --git a/BGL/doc_tex/BGL_ref/HalfedgeGraph.tex b/BGL/doc_tex/BGL_ref/HalfedgeGraph.tex index 251aee74012..ac6629ff22e 100644 --- a/BGL/doc_tex/BGL_ref/HalfedgeGraph.tex +++ b/BGL/doc_tex/BGL_ref/HalfedgeGraph.tex @@ -69,15 +69,13 @@ Following the {\sc Bgl} interface, the following graph operations are defined as \ccFunction {template - std::pair < typename CGAL::Halfedge_graph_traits::undirected_edge_iterator - ,typename CGAL::Halfedge_graph_traits::undirected_edge_iterator + std::pair < typename CGAL::halfedge_graph_traits::undirected_edge_iterator + ,typename CGAL::halfedge_graph_traits::undirected_edge_iterator > undirected_edges(Graph const& g ); } {Returns a pair of iterators representing the range [begin,end) - of undirected edges in this graph.\\ - (non-const version ommited) - } + of undirected edges in this graph.} \ccHasModels \ccRefIdfierPage{CGAL::halfedge_graph_traits< CGAL::Polyhedron_3 const > }\\ diff --git a/BGL/doc_tex/BGL_ref/VertexPointPropertyMap.tex b/BGL/doc_tex/BGL_ref/VertexPointPropertyMap.tex index f510d2c8bd3..10da37eb135 100644 --- a/BGL/doc_tex/BGL_ref/VertexPointPropertyMap.tex +++ b/BGL/doc_tex/BGL_ref/VertexPointPropertyMap.tex @@ -33,7 +33,7 @@ providing mutable access to the geometric embedding of a graph vertex {Indicates that this property is an lvalue (it can be mutated).} \ccNestedType{value_type;} - {The point type which represent the embeeding of a vertex.} + {The point type which represent the embedding of a vertex.} \ccTypedef{value_type& reference;} {The result type of the map operator.}