CGAL and the Boost Graph Library
Reference Manual
Andreas Fabri, Fernando Cacciola, and Ron Wein
This chapter introduces the concepts and classes that allow to interface Cgal data structures
with the algorithms of the Bgl, as well as a new graph concept.
70.7 Classified Reference Pages
Concepts
HalfedgeGraph
Enums
boost::edge_index_t
CGAL::edge_is_border_t
CGAL::vertex_is_border_t
CGAL::vertex_point_t
Classes
boost::graph_traits< CGAL::Arrangement_2<Traits,Dcel> >
boost::graph_traits< CGAL::Polyhedron_3<Traits> >
CGAL::halfedge_graph_traits< CGAL::Polyhedron_3<Traits> >
boost::graph_traits< CGAL::Triangulation_2<GT, TDS> >
CGAL::Triangulation_vertex_base_with_id_2<TriangulationTraits_2, TriangulationVertexBase_2>
CGAL::HalfedgeDS_vertex_max_base_with_id<Refs>
CGAL::HalfedgeDS_halfedge_max_base_with_id<Refs>
CGAL::HalfedgeDS_face_max_base_with_id<Refs>
CGAL::Polyhedron_items_with_id_3
70.8 Alphabetical List of Reference Pages