CGAL 6.0 - CGAL and the Boost Graph Library
|
The concept HalfedgeListGraph
refines the concept HalfedgeGraph
and adds the requirements for traversal of all halfedges in the graph.
boost::graph_traits<HalfedgeListGraph>::halfedge_iterator | A halfedge iterator (obtained via |
HalfedgeGraph
Related Functions | |
(Note that these are not member functions.) | |
template<typename HalfedgeListGraph > | |
std::pair< boost::graph_traits< HalfedgeListGraph >::halfedge_iterator, boost::graph_traits< HalfedgeListGraph >::halfedge_iterator > | halfedges (const HalfedgeListGraph &g) |
returns an iterator range over all halfedges. | |
template<typename HalfedgeListGraph > | |
boost::graph_traits< HalfedgeListGraph >::halfedge_size_type | num_halfedges (const HalfedgeListGraph &g) |
returns an upper bound of the number of halfedges of the graph. | |
|
related |
returns an upper bound of the number of halfedges of the graph.
num_halfedges()
may return a number larger than std::distance(halfedges(g).first, halfedges(g).second)
. This is the case for implementations only marking halfedges deleted in the halfedge container.