|
CGAL 6.0 - CGAL and the Boost Graph Library
|
#include <CGAL/boost/graph/iterator.h>
A bidirectional circulator with value type boost::graph_traits<Graph>::halfedge_descriptor over all halfedges having the same vertex as source.
Let h be a halfedge of graph g. For a Halfedge_around_source_circulator havc with h = *havc; the following holds: next(opposite(h,g),g) == *++havc.
| Graph | must be a model of the concept HalfedgeGraph
|