\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.6.1 - CGAL and the Boost Graph Library
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members
CGAL::Halfedge_around_face_iterator< Graph > Class Template Reference
Iterators and Circulators

#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
Graphmust be a model of the concept HalfedgeGraph
Is Model Of:
BidirectionalIterator