CGAL 5.6.1  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 incident to the same face or border.
Let h
be a halfedge of graph g
. For a Halfedge_around_face_circulator
hafc
with h = *hafc
the following holds: next(h,g) == *++hafc
.
Graph  must be a model of the concept HalfedgeGraph 