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

CGAL::Surface_mesh

CGAL::Linear_cell_complex_for_combinatorial_map

Related Functions

(Note that these are not member functions.)

template<typename FaceListGraph >
std::pair< boost::graph_traits
< FaceListGraph >
::face_iterator,
boost::graph_traits
< FaceListGraph >
::face_iterator > 		faces (const FaceListGraph &g)
 
template<typename FaceListGraph >
boost::graph_traits
< FaceListGraph >
::face_size_type 		num_faces (const FaceListGraph &g)
 

Friends And Related Function Documentation

template<typename FaceListGraph >
std::pair< boost::graph_traits< FaceListGraph >::face_iterator, boost::graph_traits< FaceListGraph >::face_iterator > faces ( const FaceListGraph &  g)
related

returns an iterator range over all faces.

Examples:
BGL_polyhedron_3/normals.cpp, BGL_surface_mesh/surface_mesh_dual.cpp, and Polygon_mesh_processing/face_filtered_graph_example.cpp.
template<typename FaceListGraph >
boost::graph_traits< FaceListGraph >::face_size_type num_faces ( const FaceListGraph &  g)
related

returns 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.