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

emst-detail.png
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-14a
License: LGPL

Classified Reference Pages

Concepts

Enums

Classes

Modules

 Specializations of boost::graph_traits
 Specializations of boost::graph_traits for CGAL types.
 
 Concepts
 
 Enums
 
 Helper Classes
 

Classes

class  CGAL::halfedge_graph_traits< G >
 The class halfedge_graph_traits is a traits class for HalfedgeGraph. More...