%% Copyright (c) 2006 SciSoft. All rights reserved. %% %% This file is part of CGAL (www.cgal.org); you may redistribute it under %% the terms of the Q Public License version 1.0. %% See the file LICENSE.QPL distributed with CGAL. %% %% Licensees holding a valid commercial license may use this file in %% accordance with the commercial license agreement provided with the software. %% %% This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE %% WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. %% %% %% %% Author(s) : Fernando Cacciola \ccRefChapter{CGAL and the Boost Graph Library\label{ref-chapter-BGL}} \ccChapterAuthor{Andreas Fabri \and Fernando Cacciola \and Ron Wein} This chapter introduces the concepts and classes that allow to interface \cgal\ data structures with the algorithms of the {\sc Bgl}, as well as a new graph concept. \section{Classified Reference Pages} \ccHeading{Concepts} \ccRefConceptPage{HalfedgeGraph} \ccHeading{Enums} \ccRefIdfierPage{boost::edge_index_t}\\ \ccRefIdfierPage{CGAL::edge_is_border_t}\\ \ccRefIdfierPage{CGAL::vertex_is_border_t}\\ \ccRefIdfierPage{CGAL::vertex_point_t} \ccHeading{Classes} \ccRefIdfierPage{boost::graph_traits< CGAL::Arrangement_2 > }\\ \ccRefIdfierPage{boost::graph_traits< CGAL::Polyhedron_3 > }\\ \ccRefIdfierPage{CGAL::halfedge_graph_traits< CGAL::Polyhedron_3 > }\\ \ccRefIdfierPage{boost::graph_traits< CGAL::Triangulation_2 >}\\ \ccRefIdfierPage{CGAL::Triangulation_vertex_base_with_id_2}\\ \ccRefIdfierPage{CGAL::HalfedgeDS_vertex_max_base_with_id}\\ \ccRefIdfierPage{CGAL::HalfedgeDS_halfedge_max_base_with_id}\\ \ccRefIdfierPage{CGAL::HalfedgeDS_face_max_base_with_id}\\ \ccRefIdfierPage{CGAL::Polyhedron_items_with_id_3} % +------------------------------------------------------------------------+ %%RefPage: end of main body, begin of footer % EOF % +------------------------------------------------------------------------+