In our Star Student Project proposed system we are going to introduce a Minimum Spanning Tree (MST) for select the path from the source to the destination. The minimum spanning tree can be found in polynomial time. A minimum spanning tree (MST) of an edge-weighted graph is a spanning tree whose weight (the sum of the weights of its edges) is no larger than the weight of any other spanning tree.
https://www.blogger.com/blogger.g?blogID=4435256300017036823#allposts