\( \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.12.1 - CGAL and the Boost Graph Library
VertexListGraph Concept Reference


Concept from the Boost Graph Library. See http://www.boost.org/libs/graph/doc/VertexListGraph.html.

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

Has Models:
See Boost Graph Traits Specializations
See also
Graph Concepts

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

◆ num_vertices()

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

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

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.

◆ vertices()