From: Andreas Fabri (andreas.fabri_at_[hidden])
Date: 2007-01-29 07:59:26
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_CGAL
> <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_at_[hidden]
> http://listarchives.boost.org/mailman/listinfo.cgi/boost-users