|
CGAL 6.0 - CGAL and the Boost Graph Library
|
#include <CGAL/boost/graph/iterator.h>
A bidirectional iterator with value type boost::graph_traits<Graph>::vertex_descriptor over all vertices adjacent to the same vertex.
It iterates over the same halfedges as the Halfedge_around_target_iterator.
| Graph | must be a model of the concept HalfedgeGraph
|