outline of the algorithm let' restate the algorithm in graph terms (as opposed to cable tv terms)start with vertexput it in the tree then repeatedly do the following find all the edges from the newest vertex to other vertices that aren' in the tree put these edges in the priority queue pick the edge with the lowest weightand add this edge and its destination vertex to the tree do these steps until all the vertices are in the tree at that pointyou're done in step "newestmeans most recently installed in the tree the edges for this step can be found in the adjacency matrix after step the list will contain all the edges from vertices in the tree to vertices on the fringe extraneous edges in maintaining the list of linkswe went to some trouble to remove links that led to town that had recently become connected if we didn' do thiswe would have ended up installing unnecessary cable links in programming algorithm we must likewise make sure that we don' have any edges in the priority queue that lead to vertices that are already in the tree we could go through the queue looking for and removing any such edges each time we added new vertex to the tree as it turns outit is easier to keep only one edge from the tree to given fringe vertex in the priority queue at any given time that isthe queue should contain only one edge to each category vertex you'll see that this is what happens in the graphw workshop applet there are fewer edges in the priority queue than you might expectjust one entry for each category vertex step through the minimum spanning tree for figure and verify that this is what happens table shows how edges with duplicate destinations have been removed from the priority queue table edge pruning step number unpruned edge list pruned edge list (in priorityqueue ab ad ab ad de dc db ab de dc ab db (ab de bc dc be dc be de (be )bc (dc duplicate removed from priority queue