\( \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 4.5 - CGAL and the Boost Graph Library
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
CGAL and the Boost Graph Library Reference

emst-detail.png
Andreas Fabri, Fernando Cacciola, Philipp Moeller, and Ron Wein
This package provides a framework for interfacing CGAL data structures with the algorithms of the Boost Graph Library, or BGL for short. 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 several new graph concepts describing halfedge data structures.


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

Classified Reference Pages

Concepts

Properties

CGAL Classes Adapted for the Graph API

Different CGAL types have been adapted as graphs for the Bgl. All adapted types are listed here. The pages document which concepts they model, the properties they support, and any possible caveats that a user might encounter.

Helper Classes

Iterators and Circulators

Euler Operations

Modules

 Specializations of boost::graph_traits
 Bgl defines the class template boost::graph_traits as a uniform interface to the properties and types of graph types.
 
 Concepts
 We extend the Boost Graph Library(Bgl for short) with a set of new concepts.
 
 Properties
 The property tags model of the boost concept PropertyTag.
 
 Helper Classes
 
 Iterators and Circulators
 Several iterators and circulators are provided that enable to iterate through the halfedges incident to a given face or vertex.
 
 Euler Operations
 We call high level operations that maintain the validity of a halfedge graph Euler Operations.