Algorithms on graphs

Develop a program that searches for a MST of a given weighted graph. You should implement one of the two algorithms. You may select yourself which algorithm to impement.

Input file (text format):

•Other lines contain edges and their weights. Each line describes one edge as two incident vertices together with the edge’s weight, separated by space. Weights are fixed point decimal numbers; they should be represented with float numeric values.

Output file (text format):

For a graph with n vertices the output file should contain n lines. 

The first line represents the total weight of the MST and the other lines represent edges of the MST.