CGAL users discussion list

[Pierre Cagne <>]

The face iterator goes in random order.

If you want to use spanning tree on the dual graph then do exactly that. Use the adaptation to BGL to receive a BGL graph of the dual arrangement, and use one of boost algorithms for spanning trees.

Thanks a lot.

I saw in the doc how to have the dual of an arrangement graph. But I couldn't find any documentation about the template type CGAL::Dual<class Arr_graph> or it's internal representation... I will look into BLG as you say.

--

Pierre Cagne

Etudiant à l'Ecole Normale Supérieure de Paris

Attachment: PGP.sig
Description: This is a digitally signed message part