CGAL 4.6 - CGAL and the Boost Graph Library
|
#include <CGAL/boost/graph/iterator.h>
A bidirectional circulator 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_circulator
havc
with h = *havc;
the following holds: next(opposite(h,g),g) == *++havc
.
Graph | must be a model of the concept HalfedgeGraph |
Public Types | |
typedef void(Halfedge_around_source_circulator::* | bool_type )() const |
Public Member Functions | |
Halfedge_around_source_circulator () | |
Halfedge_around_source_circulator (halfedge_descriptor hd, const Graph &g) | |
Halfedge_around_source_circulator (vertex_descriptor vd, const Graph &g) | |
void | this_type_does_not_support_comparisons () const |
operator bool_type () const | |
bool | operator== (void *) const |
Friends | |
class | boost::iterator_core_access |