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

Restrict the HalfedgeGraph with properties often assumed in our algorithms

This commit is contained in:
Sébastien Loriot 2016-07-11 16:03:05 +02:00
parent 4c4e5b384f
commit 21ef19b67f
1 changed files with 7 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
BGL/doc/BGL/Concepts/HalfedgeGraph.h
View File

@ -16,7 +16,7 @@ the same vertex. We refer to \ref PkgBGLIterators for a description of
iterators and circulators for these halfedge cycles.
\cgalRefines <A HREF="http://www.boost.org/libs/graph/doc/Graph.html">`Graph`</A>
\cgalRefines <A HREF="http://www.boost.org/libs/graph/doc/IncidenceGraph.html">`IncidenceGraph`</A>
\cgalRefines <A HREF="http://www.boost.org/libs/graph/doc/PropertyGraph.html">`PropertyGraph`</A>
A model of `HalfedgeGraph` must have the interior property `vertex_point` attached to its vertices.
@ -55,5 +55,11 @@ Expression | Returns
`next(h, g)` | `halfedge_descriptor` | The next halfedge around its face.
`prev(h, g)` | `halfedge_descriptor` | The previous halfedge around its face.
`boost::graph_traits<G>::%null_halfedge()` | `halfedge_descriptor` | Returns a special halfedge that is not equal to any other halfedge.
\cgalHeading{Invariants}
`halfedge(edge(h,g))==h`
*/
class HalfedgeGraph {};