Project Support for : Ph.D/M.E/M.Tech/B.E/B.Tech/MCA/Msc/BCA/Diplomo

Department : Computer Science/ Information Technology/ Electronics

Star Student Project


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. This minimum spanning tree find out the minimum of weight for the nodes and then it calculate the Star Student Project best path between the source and the destination for transmission. This kind of proposed system can provide the efficient way of transmission between the source and destination.