IJSRP, Volume 4, Issue 9, September 2014 Edition [ISSN 2250-3153]
Dr.D vijayalakshmir, R.kalaivani
A spanning tree of a connected graph is a sub graph that is a tree and connects all the verticestogether. A single graph can have many different spanning trees. We can also assign a weight to each edge, which is a number representing how unfavorable it is, and use this to assign a weight to a spanning tree by computing the sum of the weights of the edges in that spanning tree. A minimum spanning tree (MST) or minimum weight spanning tree is then a spanning tree with weight less than or equal to the weight of every other spanning tree. More generally, any undirected graph (not necessarily connected) has a minimum spanning forest, which is a union of minimum spanning trees for its components. Our objective is to find minimum cost (weight) spanning tree using the algorithm which is based on the weight matrix of weighted graph.