\( \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.11.2 - CGAL and the Boost Graph Library
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
EdgeListGraph Concept Reference

Definition

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

Refines:
Graph
Has Models:

CGAL::Polyhedron_3

CGAL::Surface_mesh

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 >
::ver_size_type 
num_edges (const EdgeListGraph &g)
 
template<typename EdgeListGraph >
boost::graph_traits
< EdgeListGraph >
::vertex_descriptor 
source (boost::graph_traits< EdgeListGraph >::halfedge_descriptor h, const EdgeListGraph &g)
 
template<typename EdgeListGraph >
boost::graph_traits
< EdgeListGraph >
::vertex_descriptor 
target (boost::graph_traits< EdgeListGraph >::halfedge_descriptor h, const EdgeListGraph &g)
 

Friends And Related Function Documentation

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.
template<typename EdgeListGraph >
boost::graph_traits< EdgeListGraph >::ver_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.
template<typename EdgeListGraph >
boost::graph_traits< EdgeListGraph >::vertex_descriptor target ( boost::graph_traits< EdgeListGraph >::halfedge_descriptor  h,
const EdgeListGraph g 
)
related