\( \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.5 - CGAL and the Boost Graph Library
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
FaceListGraph Concept Reference
Concepts

Definition

The concept FaceListGraph refines the concept FaceGraph and adds the requirement for traversal of all faces in a graph.

Refines:
FaceGraph
Has Models:
CGAL::Polyhedron_3

Notations

G
A type that is a model of FaceListGraph.
g
An object of type G.

Associated Types

Type Description
boost::graph_traits<G>::face_iterator Iterator over all faces.
boost::graph_traits<G>::faces_size_type Unsigned integer type for number of faces.

Valid Expressions

Expression returns Description
faces(g) std::pair<face_iterator, face_iterator> An iterator range over all faces.
num_faces(g) faces_size_type An upper bound of the number of faces of the graph.
Attention
num_faces() may return a number larger than std::distance(faces(g).first, faces(g).second). This is the case for implementations only marking faces deleted in the face container.