 greedy algorithm for the minimum spanning tree problem is shown in Figure 0.0. The solution S to be constructed and its cost f(S) are initialized to ![ $$\\varnothing $$ ](A000000_0_En_0_Chapter_IEq0.gif) and 0, respectively, in lines 0 and 0. The set of feasible ground set elements is initialized in line 0 with all 