\( \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
VertexListGraph Concept Reference
Concepts

Definition

The concept VertexListGraph refines the concept Graph and adds the requirement for traversal of all vertices in a graph.

Refines:
Graph
Has Models:

CGAL::Polyhedron_3

CGAL::Surface_mesh

Related Functions

(Note that these are not member functions.)

template<typename VertexListGraph >
std::pair< boost::graph_traits
< VertexListGraph >
::vertex_iterator,
boost::graph_traits
< VertexListGraph >
::vertex_iterator > 		vertices (const VertexListGraph &g)
 
template<typename VertexListGraph >
boost::graph_traits
< VertexListGraph >
::ver_size_type 		num_vertices (const VertexListGraph &g)
 

Friends And Related Function Documentation

template<typename VertexListGraph >
boost::graph_traits< VertexListGraph >::ver_size_type num_vertices ( const VertexListGraph &  g)
related

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

Attention
num_vertices() may return a number larger than std::distance(vertices(g).first, vertices(g).second). This is the case for implementations only marking vertices deleted in the vertex container.
Examples:
BGL_surface_mesh/surface_mesh_dual.cpp.
template<typename VertexListGraph >
std::pair< boost::graph_traits< VertexListGraph >::vertex_iterator, boost::graph_traits< VertexListGraph >::vertex_iterator > vertices ( const VertexListGraph &  g)
related

returns an iterator range over all vertices.

Examples:
BGL_polyhedron_3/distance.cpp, BGL_polyhedron_3/incident_vertices.cpp, BGL_polyhedron_3/kruskal.cpp, BGL_polyhedron_3/kruskal_with_stored_id.cpp, BGL_surface_mesh/prim.cpp, BGL_surface_mesh/surface_mesh_dual.cpp, and Surface_mesh_skeletonization/simple_mcfskel_example.cpp.