CGAL::Halfedge_around_face_iterator< Graph > Class Template Reference

#include <CGAL/boost/graph/iterator.h>

Definition

A bidirectional iterator 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_iterator hafi with h = *hafi the following holds: Either ++hafi is the past the end iterator, or next(h,g) == *++hafi.

Template Parameters

Graph

must be a model of the concept HalfedgeGraph

Is Model Of:

BidirectionalIterator