\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 5.0 - CGAL and the Boost Graph Library
Reference Manual
Here is a list of all modules:
[detail level 12]
 ▼CGAL and the Boost Graph Library Reference
 Specializations of boost::graph_traitsThe Bgl defines the class template boost::graph_traits as a uniform interface to the properties and types of graph types
 BGL Named ParametersThe algorithms of the Bgl often have many parameters with default values that are appropriate for most cases
 ConceptsWe extend the Boost Graph Library (Bgl for short) with a set of new concepts
 PropertiesThe property tags model of the boost concept PropertyTag
 Dynamic PropertiesThe dynamic property tags enable to associate information to simplices of a FaceGraph on the fly
 Helper ClassesSeveral classes that enable to store ids in vertices/halfedges/faces of a CGAL::Polyhedron_3, as well as adapters such as CGAL::Dual
 Helper FunctionsGeneric convenience functions for testing if an edge is a border edge, if a mesh is triangular, for conversion between models of different FaceGraph concepts, etc
 Iterators and CirculatorsSeveral iterators and circulators are provided that enable, for example, to iterate through the halfedges incident to a given face or vertex
 Selection FunctionsSeveral functions to enlarge or reduce a k-ring selection of vertices, edges, or faces
 Graph AdaptorsGraph adaptors are classes that build an interface over an existing graph to provide new functionalities
 Euler OperationsWe call high level operations that maintain the validity of a halfedge graph Euler Operations
 Partitioning OperationsMethods to split a mesh into subdomains, using the library METIS
 I/O FunctionsMethods to read and write graphs