CGAL 5.5.1  CGAL and the Boost Graph Library

#include <CGAL/boost/graph/iterator.h>
A bidirectional iterator with value type boost::graph_traits<Graph>::halfedge_descriptor
over all halfedges having the same vertex as target.
Let h
be a halfedge of graph g
. For a Halfedge_around_target_iterator
havi
with h = *havi;
the following holds: Either ++havi
is the past the end iterator, or opposite(next(h,g),g) == *++havi
.
Graph  must be a model of the concept HalfedgeGraph 