Minimum Spanning Tree Algorithm

Cholleti Vikas · International Journal of Computer Applications · 2010

An algorithm for minimum spanning tree [1] is discussed here.Apart from the traditional Kruskal's [2] and Prim's [3] algorithm for finding the minimum spanning tree, yet another algorithm for the same purpose is described here.Initially we form a forest and then we convert the forest into the minimum spanning tree Categories and Subject DescriptorsAlgorithm C.4 (Data Structures)

Read the paper · More papers on PaperTik