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)
template<typename VertexListGraph >
boost::graph_traits< VertexListGraph >::vertices_size_type	num_vertices (const VertexListGraph &g)

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.

Examples:

BGL_triangulation_2/dijkstra.cpp, and BGL_triangulation_2/dijkstra_with_internal_properties.cpp.

vertices()

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/copy_polyhedron.cpp, 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_polyhedron_3/range.cpp, BGL_surface_mesh/connected_components.cpp, BGL_surface_mesh/gwdwg.cpp, BGL_surface_mesh/prim.cpp, BGL_surface_mesh/seam_mesh.cpp, BGL_surface_mesh/surface_mesh_partition.cpp, BGL_triangulation_2/dijkstra.cpp, BGL_triangulation_2/dijkstra_with_internal_properties.cpp, BGL_triangulation_2/emst.cpp, BGL_triangulation_2/emst_cdt_plus_hierarchy.cpp, and Property_map/dynamic_properties.cpp.