CGAL 6.0 - CGAL and the Boost Graph Library
Loading...
Searching...
No Matches
FaceListGraph Concept Reference

Definition

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

Associated Types
boost::graph_traits<FaceListGraph>::face_iterator

A face iterator (obtained via faces(g)) provides access to all of the faces in a graph. A face iterator type must meet the requirements of MultiPassInputIterator. The value type of the face iterator must be the same as the face descriptor of the graph.

Refines
FaceGraph
Has models
See Boost Graph Traits Specializations
See also
Graph Concepts

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)
 returns an iterator range over all faces.
 
template<typename FaceListGraph >
boost::graph_traits< FaceListGraph >::face_size_type num_faces (const FaceListGraph &g)
 returns an upper bound of the number of faces of the graph.
 

Friends And Related Function Documentation

◆ num_faces()

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.