ABSTRACT
Perhaps the most surprising aspect of Kruskal's Algorithm is the process the people would like to take also guarantees a minimum spanning tree. It begins by denoting a starting vertex for the tree, similar to that of rooted trees that appear in this chapter. Both minimum spanning tree algorithms described in the chapter are efficient and optimal, and result in roughly the same computation requirements. It should be noted that many other algorithms exist and the study of minimum spanning trees did not originate with Kruskal and Prim. Most people have encountered a specific type of rooted tree: a family tree. In fact, much of the terminology for rooted trees comes not from a plant version of a tree but rather from genealogy and family trees. The chapter explores additional examples where trees, whether spanning, rooted, or something else, are used to answer questions of interest.
