CGAL 4.3 - CGAL and the Boost Graph Library
|
#include <CGAL/boost/graph/graph_traits_Arrangement_2.h>
The class graph_traits
is a partial specialization of boost::graph_traits
for the class CGAL::Arrangement_2
.
It provides the types associated to the graph concepts BidirectionalGraph
and EdgeAndVertexListGraph
.
The const specialization, boost::graph_traits< CGAL::Arrangement_2<Traits,Dcel> const>
is also defined, using the constant handles in the arrangement.
Types | |
typedef unspecified_type | vertex_iterator |
An iterator corresponding to CGAL::Arrangement_2::Vertex_iterator , with the difference that its value type is a vertex descriptor and not CGAL::Arrangement_2::Vertex . | |
typedef unspecified_type | edge_iterator |
An iterator corresponding to CGAL::Arrangement_2::Halfedge_iterator with the difference that its value type is an edge descriptor and not CGAL::Arrangement_2::Halfedge . | |
typedef unspecified_type | in_edge_iterator |
An edge iterator which only iterates over the incoming edges around a vertex. More... | |
typedef unspecified_type | out_edge_iterator |
An edge iterator which only iterates over the outgoing halfedges around a vertex. More... | |
CGAL::Arrangement_2::Vertex_handle | vertex_descriptor |
The vertex descriptor. | |
CGAL::Arrangement_2::Halfedge_handle | edge_descriptor |
The edge descriptor. | |
boost::disallow_parallel_edge_tag | edge_parallel_category |
Indicates that this graph does support multiedges. | |
boost::bidirectional_graph_tag | traversal_category |
Indicates that this graph is bidirectional. | |
Arrangement_2::size_type | vertices_size_type |
The size type of the vertex list. | |
Arrangement_2::size_type | edges_size_type |
The size type of the edge list. | |
Arrangement_2::size_type | degree_size_type |
The size type of the adjacency list. | |
typedef unspecified_type boost::graph_traits< CGAL::Arrangement_2< T, DC > >::in_edge_iterator |
An edge iterator which only iterates over the incoming edges around a vertex.
It corresponds to a CGAL::Arrangement_2::Halfedge_around_vertex_circulator
with the difference that its value type is an edge descriptor and not CGAL::Arrangement_2::Halfedge
.
typedef unspecified_type boost::graph_traits< CGAL::Arrangement_2< T, DC > >::out_edge_iterator |
An edge iterator which only iterates over the outgoing halfedges around a vertex.
It corresponds to a CGAL::Arrangement_2::Halfedge_around_vertex_circulator
with the difference that its value type is an edge descriptor and not CGAL::Arrangement_2::Halfedge
.