Hello, In the next release of CGAL you will find a probably better solution. We implemented a graph_traits specialization for the triangulation classes, plus the methods source, target,... as well as property maps for the edge weight which is the Euclidean distance. best regards, andreas miles mccoo wrote:
Hi,
I patched together code for Euclidean MST based on CGAL and Boost. I posted in on Wikipedia because I couldn't think of a more appropriate place.
http://en.wikipedia.org/wiki/Sample_Code_for_Euclidean_MST_using_Boost_and_C... <http://en.wikipedia.org/wiki/Sample_Code_for_Euclidean_MST_using_Boost_and_CGAL>
I would love to receive feedback on it. I hope someone finds it's useful.
Miles
------------------------------------------------------------------------
_______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users