Source code online books for professionals by professionals

a SLIGhtLY DIFFereNt perSpeCtIVe
In their historical overview of minimum spanning tree algorithms, ronald L. Graham and pavol hell outline 
three algorithms that they consider especially important and that have played a central role in the history of the 
problem. the first two are the algorithms that are commonly attributed to Kruskal and prim (although the second 
one was originally formulated by vojteˇch Jarník in 1930), while the third is the one initially described by Boru˚vka. 
Graham and hell succinctly explain the algorithms as follows. a partial solution is a spanning forest, consisting 
of a set of fragments (components, trees). Initially, each node is a fragment. In each iteration, edges are added, 
joining fragments, until we have a spanning tree.