CGAL 5.5.3 - CGAL and the Boost Graph Library
EdgeListGraph Concept Reference

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.

◆ 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()

◆ target()

template<typename EdgeListGraph >
boost::graph_traits< EdgeListGraph >::vertex_descriptor target ( boost::graph_traits< EdgeListGraph >::edge_descriptor  e,
const EdgeListGraph g 
)
related