\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.7 - CGAL and the Boost Graph Library
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members | Public Member Functions
CGAL::Vertex_around_target_circulator< Graph > Class Template Reference
CGAL and the Boost Graph Library Reference » Iterators and Circulators

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

Definition

A bidirectional circulator with value type boost::graph_traits<Graph>::vertex_descriptor over all vertices adjacent to the same vertex.

It circulates over the same halfedges as the Halfedge_around_target_circulator.

Template Parameters
Graphmust be a model of the concept HalfedgeGraph
Is Model Of:
BidirectionalCirculator

Public Member Functions

 Vertex_around_target_circulator ()
 
 Vertex_around_target_circulator (halfedge_descriptor h, const Graph &g)
 

Constructor & Destructor Documentation

template<typename Graph >
CGAL::Vertex_around_target_circulator< Graph >::Vertex_around_target_circulator ( )
template<typename Graph >
CGAL::Vertex_around_target_circulator< Graph >::Vertex_around_target_circulator ( halfedge_descriptor  h,
const Graph &  g 
)