CGAL 6.0 - CGAL and the Boost Graph Library
|
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.
GraphRelated 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) |
returns an iterator range over all edges. | |
template<typename EdgeListGraph > | |
boost::graph_traits< EdgeListGraph >::edges_size_type | num_edges (const EdgeListGraph &g) |
returns an upper bound of the number of edges of the graph. | |
template<typename EdgeListGraph > | |
boost::graph_traits< EdgeListGraph >::vertex_descriptor | source (boost::graph_traits< EdgeListGraph >::edge_descriptor e, const EdgeListGraph &g) |
returns the source vertex of e . | |
template<typename EdgeListGraph > | |
boost::graph_traits< EdgeListGraph >::vertex_descriptor | target (boost::graph_traits< EdgeListGraph >::edge_descriptor e, const EdgeListGraph &g) |
returns the target vertex of e . | |
|
related |
returns an upper bound of the number of edges of the graph.
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.