CGAL users discussion list

[jasmine2210 <>]

Hello,

I'm trying to run CGAL with Boost Graph Library - Kruskal Minimum Spanning
Tree with my input. The code is exactly in this url:
https://doc.cgal.org/4.2/CGAL.CGAL.CGAL-and-the-Boost-Graph-Library/html/BGL_triangulation_2_2emst_8cpp-example.html

My input is

0. 0.
1. 1.
0. 2.
1. 0.

But when I run it, the output is not nice. This is the output of edges in
minimum spanning tree (EMST). Each line is an edge which is a pair of
points.

(0 6.95331e-310) - (0 0)
(1 1) - (1 0)
(1 1) - (0 2)

However, when I print the Delaunay Triangulation, the output is as expected.

(0 0) - (0 2)
(0 0) - (1 1)
(1 1) - (0 2)
(1 1) - (1 0)
(0 0) - (1 0)

I think it should be (0,0) in the first line in output of EMST. Moreover, I
don't think it's correct that the edge (0 0) - (0 0) is in the EMST. Could
you please let me know where is the root cause of my issue.



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Boost-Kruskal-Minimum-Spanning-Tree-tp4659990.html
Sent from the cgal-discuss mailing list archive at Nabble.com.