CGAL::Halfedge_around_source_iterator< Graph > Class Template Reference

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

Definition

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

A bidirectional iterator with value type boost::graph_traits<Graph>::halfedge_descriptor over all halfedges having the same vertex as source.

Let h be a halfedge of graph g. For a Halfedge_around_source_iterator havi with h = *havi; the following holds: Either ++havi is the past the end iterator, or next(opposite(h,g),g) == *++havi.

Template Parameters

Graph

must be a model of the concept HalfedgeGraph

Is Model Of:

BidirectionalIterator