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

polish

This commit is contained in:
Andreas Fabri 2025-07-15 11:03:47 +01:00
parent 61baefa79a
commit 3fbdc2deed
3 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_triangulation_3.h
View File

@ -1312,7 +1312,7 @@ OutputIterator
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)`.
*/
size_type degree(Vertex_handle v) const;

2
TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h
View File

@ -960,7 +960,7 @@ OutputIterator
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)`.
*/
size_type degree(Vertex_handle v) const;

2
Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h
View File

@ -1669,7 +1669,7 @@ OutputIterator
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.
\pre `v != Vertex_handle()`, `t.is_vertex(v)`.
*/