How can I use the Delaunay triangulation to output a matrix with all the connections in the triangulation and their distances?

Question

I want to use the Delaunay triangulation to calculate the minimum spanning tree for a network for an array of coordinates. How can I obtain all the edges from the triangulation