Loading [MathJax]/extensions/TeX/AMSsymbols.js
 
CGAL 6.0.1 - CGAL and the Boost Graph Library
All Classes Namespaces Files Functions Variables Typedefs Enumerations Friends Modules Pages
Loading...
Searching...
No Matches
VertexListGraph Concept Reference

Definition

Concept from the Boost Graph Library. See https://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.

Refines
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)
 returns an iterator range over all vertices.
 
template<typename VertexListGraph >
boost::graph_traits< VertexListGraph >::vertices_size_type num_vertices (const VertexListGraph &g)
 returns an upper bound of the number of vertices of the graph.
 

Friends And Related Function Documentation

◆ num_vertices()

template<typename VertexListGraph >
boost::graph_traits< VertexListGraph >::vertices_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.