CGAL 6.1 - CGAL and the Boost Graph Library

Loading...
Searching...
No Matches
List of all members
CGAL::Halfedge_around_target_iterator< Graph > Class Template Reference
Reference Manual » Iterators and Circulators

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

## Definition

template<typename Graph>
class CGAL::Halfedge_around_target_iterator< Graph >

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.