CGAL and the Boost Graph Library Reference

Andreas Fabri and Fernando Cacciola and Ron Wein

This package provides a framework for interfacing CGAL data structures with the algorithms of the BGL. It allows to run graph algorithms directly on CGAL data structures which are model of the BGL graph concepts, for example the shortest path algorithm on a Delaunay triangulation in order to compute the Euclidean minimum spanning tree. Furthermore, it introduces a new graph concept, the HalfedgeEdgeGraph. This concept describes graphs which are embedded on surfaces.

Introduced in: CGAL 3.3
BibTeX: cgal:cfw-cbgl-13b
License: LGPL

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<T,DC> >
• boost::graph_traits< CGAL::Polyhedron_3<T> >
• 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

Modules
	Concepts
	Enums
	Traits Classes
	Helper Classes