CGAL::Halfedge_around_target_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 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.

Template Parameters

Graph

must be a model of the concept HalfedgeGraph

Is Model Of:

BidirectionalIterator

Examples:

BGL_polyhedron_3/incident_vertices.cpp, and BGL_polyhedron_3/transform_iterator.cpp.