mirror of https://github.com/CGAL/cgal
polish
This commit is contained in:
parent
61baefa79a
commit
3fbdc2deed
|
|
@ -1312,7 +1312,7 @@ OutputIterator
|
||||||
adjacent_vertices(Vertex_handle v, OutputIterator vertices) const;
|
adjacent_vertices(Vertex_handle v, OutputIterator vertices) const;
|
||||||
|
|
||||||
/*!
|
/*!
|
||||||
Returns the degree of a vertex, that is, the number of adjacent vertices.
|
Returns the degree of `v`, that is, the number of adjacent vertices.
|
||||||
\pre `v` \f$ \neq\f$ `Vertex_handle()`, `t`.`is_vertex(v)`.
|
\pre `v` \f$ \neq\f$ `Vertex_handle()`, `t`.`is_vertex(v)`.
|
||||||
*/
|
*/
|
||||||
size_type degree(Vertex_handle v) const;
|
size_type degree(Vertex_handle v) const;
|
||||||
|
|
|
||||||
|
|
@ -960,7 +960,7 @@ OutputIterator
|
||||||
adjacent_vertices(Vertex_handle v, OutputIterator vertices) const;
|
adjacent_vertices(Vertex_handle v, OutputIterator vertices) const;
|
||||||
|
|
||||||
/*!
|
/*!
|
||||||
Returns the degree of a vertex, that is, the number of incident vertices.
|
Returns the degree of `v`, that is, the number of incident vertices.
|
||||||
\pre `v` \f$ \neq\f$ `Vertex_handle()`, `tds.is_vertex(v)`.
|
\pre `v` \f$ \neq\f$ `Vertex_handle()`, `tds.is_vertex(v)`.
|
||||||
*/
|
*/
|
||||||
size_type degree(Vertex_handle v) const;
|
size_type degree(Vertex_handle v) const;
|
||||||
|
|
|
||||||
|
|
@ -1669,7 +1669,7 @@ OutputIterator
|
||||||
finite_adjacent_vertices(Vertex_handle v, OutputIterator vertices) const;
|
finite_adjacent_vertices(Vertex_handle v, OutputIterator vertices) const;
|
||||||
|
|
||||||
/*!
|
/*!
|
||||||
Returns the degree of a `v`, that is, the number of incident vertices.
|
Returns the degree of `v`, that is, the number of incident vertices.
|
||||||
The infinite vertex is counted.
|
The infinite vertex is counted.
|
||||||
\pre `v != Vertex_handle()`, `t.is_vertex(v)`.
|
\pre `v != Vertex_handle()`, `t.is_vertex(v)`.
|
||||||
*/
|
*/
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue