title: How to find out Euclidean Minimum Spanning tree using CGAL library?
body: <p>I have a set of 2-D points, and considering every point connected to every other one with an "edge" with weight equal to the distance between them, I need to find the MST of the resulting graph.
  I am using the fact that EMST is always a subgraph of the delaunay triangulation of this field. I need the triangles' as a list of edges to make a graph from it and then run Kruskal over it.</p>
  
  <p>Also, Do I have to go the Delaunay triangulation way, or is there a direct function for it?</p>
  
  <p>Kindly give a sample code for figuring out which headers to include, which namespace to use etc. with your answer for either question, if possible.</p>