Mathematica DeMYSTiFied

⁵Here is a brief description for the ambitious reader. We first build a list called neighbors which in the i th position contains a list of all vertices adjacent (connected by an edge to) vertex number i. We then prepare to enter a While loop by initializing two sets of vertices: leaves and freeVertices. Initially, leaves consists of the neighbors of root, and free vertices consists of all vertices except root and leaves. We also initialize the tree, which starts out as the set of all edges that connect the leaves to the root. Each element of tree is a triple {v, d, w}, where vertex v is connected to vertex w and v is a distance d from the root. In the While loop we repeatedly do the following: we go through each vertex v in freeVertices, find ...