CGAL 2D Delaunay Triangulation: How to get all the edges

How to get/iterate over all the edges in the 2D delaunay graph in CGAL (C++)开发者_运维知识库?

For example, in MATLAB this is just edges(dt).

You simply need to use members functions All_edges_iterator all_edges_begin()
All_edges_iterator all_edges_end()
to get the iterator range over edges.

It is documented on the Triangulation_2 page here

Note that you will get edges incident to the infinite vertex together with finite edges.