CSC 490 – Computer Science Senior Seminar I Professor Gary
Locklair
Written Homework Assignment #3 Fall
2006
Chapter 22 in The New Turing Omnibus – Minimum Spanning Trees
Solve Problem 1 (create a “different” minimum spanning tree).
For each iteration of the MINSPAN algorithm, show:
a) the “contents” of L, (for example L = {CD:5, DG:7, BD:10}) and
b) show construction of the tree by identifying the order in which “bold” lines
(the tree) are created. That is, create a diagram and label the tree edges
with an ordinal number (1st, 2nd , 3rd, etc).
{15 points}
CSC 490 – Computer Science Senior Seminar I Professor Gary
Locklair
Written Homework Assignment #3 Fall
2006
Chapter 22 in The New Turing Omnibus – Minimum Spanning Trees
Solve Problem 1 (create a “different” minimum spanning tree).
For each iteration of the MINSPAN algorithm, show:
a) the “contents” of L, (for example L = {CD:5, DG:7, BD:10}) and
b) show construction of the tree by identifying the order in which “bold” lines
(the tree) are created. That is, create a diagram and label the tree edges
with an ordinal number (1st, 2nd , 3rd, etc).
{15 points}