\( \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.11.1 - CGAL and the Boost Graph Library
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members | Related Functions
HalfedgeListGraph Concept Reference
Concepts

Definition

The concept HalfedgeListGraph refines the concept HalfedgeGraph and adds the requirements for traversal of all halfedges in the graph.

Refines:
HalfedgeGraph
Has Models:

CGAL::Polyhedron_3

CGAL::Surface_mesh

Related Functions

(Note that these are not member functions.)

template<typename HalfedgeListGraph >
std::pair< boost::graph_traits
< HalfedgeListGraph >
::halfedge_iterator,
boost::graph_traits
< HalfedgeListGraph >
::halfedge_iterator > 		halfedges (const HalfedgeListGraph &g)
 
template<typename HalfedgeListGraph >
boost::graph_traits
< HalfedgeListGraph >
::halfedge_size_type 		num_halfedges (const HalfedgeListGraph &g)
 

Friends And Related Function Documentation

template<typename HalfedgeListGraph >
std::pair< boost::graph_traits< HalfedgeListGraph >::halfedge_iterator, boost::graph_traits< HalfedgeListGraph >::halfedge_iterator > halfedges ( const HalfedgeListGraph &  g)
related

returns an iterator range over all halfedges.

template<typename HalfedgeListGraph >
boost::graph_traits< HalfedgeListGraph >::halfedge_size_type num_halfedges ( const HalfedgeListGraph &  g)
related

returns an upper bound of the number of halfedges of the graph.

Attention
num_halfedges() may return a number larger than std::distance(halfedges(g).first, halfedges(g).second). This is the case for implementations only marking halfedges deleted in the halfedge container.