Express the algorithm devised in Exercise 22 in

Chapter , Problem 23E

(choose chapter or problem)

Express the algorithm devised in Exercise 22 in pseudocode.Sollin’s algorithm produces a minimum spanning tree from a connected weighted simple graph G = (V, E) by successively adding groups of edges. Suppose that the vertices in V are ordered. This produces an ordering of the edges where {u0, v0) precedes {u1, v1} if u0 precedes u1 or if u0 = u1 and v0 precedes v1. The algorithm begins by simultaneously choosing the edge of least weight incident to each vertex. The first edge in the ordering is taken in the case of ties. This produces a graph with no simple circuits, that is. a forest of trees (Exercise 24 asks for a proof of this fact). Next, simultaneously choose for each tree in the forest the shortest edge between a vertex in this tree and a vertex in a different tree. Again the first edge in the ordering is chosen in the case of ties. (This produces a graph with no simple circuits containing fewer trees than were present before this step; see Exercise 24.) Continue the process of simultaneously adding edges connecting trees until n — I edges have been chosen. At this stage a minimum spanning tree has been constructed.