|
CGAL 6.0 - CGAL and the Boost Graph Library
|
The concept FaceListGraph refines the concept FaceGraph and adds the requirement for traversal of all faces in a graph.
| boost::graph_traits<FaceListGraph>::face_iterator | A face iterator (obtained via |
FaceGraph 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. | |
|
related |
returns an upper bound of the number of faces of the graph.
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.