The index printed in the book was erroneously constructed using an old data file. Please replace it with this revised Index (in PDF).
In the condition for second while loop, replace
The pseudo-code for Baruvka's algorithm is correct only for graphs with unique edge weights. Incidentally, if the edge weights in G are not initially unique, we can impose uniqueness by numbering the vertices 1 to n and taking the new weight of each edge e=(u,v), written so that u is numbered less than v, to be (w(e),u,v), where w(e) is the old weight of e and we use a lexicographic comparator for the new weights.