|
CGAL 4.7 - 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 |
| typedef void(Halfedge_around_source_circulator::* CGAL::Halfedge_around_source_circulator< Graph >::bool_type)() const |
| CGAL::Halfedge_around_source_circulator< Graph >::Halfedge_around_source_circulator | ( | ) |
| CGAL::Halfedge_around_source_circulator< Graph >::Halfedge_around_source_circulator | ( | halfedge_descriptor | hd, |
| const Graph & | g | ||
| ) |
| CGAL::Halfedge_around_source_circulator< Graph >::Halfedge_around_source_circulator | ( | vertex_descriptor | vd, |
| const Graph & | g | ||
| ) |
| CGAL::Halfedge_around_source_circulator< Graph >::operator bool_type | ( | ) | const |
| bool CGAL::Halfedge_around_source_circulator< Graph >::operator== | ( | void * | ) | const |
| void CGAL::Halfedge_around_source_circulator< Graph >::this_type_does_not_support_comparisons | ( | ) | const |
|
friend |