Modification of Prim's algorithm on complete broadcasting graph

Broadcasting is an information dissemination from one object to another object through communication between two objects in a network. Broadcasting for n objects can be solved by n - 1 communications and minimum time unit defined by inverted right perpendicular (2)log n inverted lift perpendicular In this paper, weighted graph broadcasting is considered. The minimum weight of a complete broadcasting graph will be determined. Broadcasting graph is said to be complete if every vertex is connected. Thus to determine the minimum weight of complete broadcasting graph is equivalent to determine the minimum spanning tree of a complete graph. The Kruskal's and Prim's algorithm will be used to determine the minimum weight of a complete broadcasting graph regardless the minimum time unit inverted right perpendicular (2)log n inverted lift perpendicular and modified Prim's algorithm for the problems of the minimum time unit inverted right perpendicular (2)log n inverted lift perpendicular is done. As an example case, here, the training of trainer problem is solved using these algorithms.