EdgeListGraph Class Reference

#include <Concepts/EdgeListGraph.h>

Definition

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

The concept EdgeListGraph refines the concept Graph and adds the requirement for traversal of all edges 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 EdgeListGraph >
std::pair< boost::graph_traits< EdgeListGraph >::edge_iterator, boost::graph_traits< EdgeListGraph >::edge_iterator >	edges (const EdgeListGraph &g)
template<typename EdgeListGraph >
boost::graph_traits< EdgeListGraph >::edges_size_type	num_edges (const EdgeListGraph &g)
template<typename EdgeListGraph >
boost::graph_traits< EdgeListGraph >::vertex_descriptor	source (boost::graph_traits< EdgeListGraph >::edge_descriptor e, const EdgeListGraph &g)
template<typename EdgeListGraph >
boost::graph_traits< EdgeListGraph >::vertex_descriptor	target (boost::graph_traits< EdgeListGraph >::edge_descriptor e, const EdgeListGraph &g)

Friends And Related Function Documentation

edges()

template<typename EdgeListGraph >

std::pair< boost::graph_traits< EdgeListGraph >::edge_iterator, boost::graph_traits< EdgeListGraph >::edge_iterator > edges ( const EdgeListGraph &  g )

related

returns an iterator range over all edges.

Examples

BGL_surface_mesh/surface_mesh_dual.cpp.

num_edges()

template<typename EdgeListGraph >

boost::graph_traits< EdgeListGraph >::edges_size_type num_edges ( const EdgeListGraph &  g )

related

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

Attention

num_edges() may return a number larger than std::distance(edges(g).first, edges(g).second). This is the case for implementations only marking edges deleted in the edge container.

source()

template<typename EdgeListGraph >

boost::graph_traits< EdgeListGraph >::vertex_descriptor source ( boost::graph_traits< EdgeListGraph >::edge_descriptor  e, const EdgeListGraph &  g  )

related

returns the source vertex of e.

Examples

BGL_polyhedron_3/incident_vertices.cpp, BGL_polyhedron_3/kruskal.cpp, BGL_polyhedron_3/kruskal_with_stored_id.cpp, BGL_surface_mesh/seam_mesh.cpp, BGL_surface_mesh/surface_mesh_dual.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 BGL_triangulation_2/emst_regular.cpp.

target()

template<typename EdgeListGraph >

boost::graph_traits< EdgeListGraph >::vertex_descriptor target ( boost::graph_traits< EdgeListGraph >::edge_descriptor  e, const EdgeListGraph &  g  )

related

returns the target vertex of e.

Examples

BGL_polyhedron_3/kruskal.cpp, BGL_polyhedron_3/kruskal_with_stored_id.cpp, BGL_polyhedron_3/normals.cpp, BGL_surface_mesh/seam_mesh.cpp, BGL_surface_mesh/surface_mesh_dual.cpp, BGL_triangulation_2/emst.cpp, BGL_triangulation_2/emst_cdt_plus_hierarchy.cpp, and BGL_triangulation_2/emst_regular.cpp.