Presentation Rubric for “another” algorithm for arriving at
minimal spanning tree.
Your minimal spanning tree presentation must have:
___Definition of minimal spanning tree
(10 points)
___A real world application for a minimal spanning other
than Ethernet networks, trains, and bridges
(10 points)
___Research and report on another algorithm besides Kruskal’s
for arriving at a minimal spanning tree.
(20 points)
The report should:
___ give the reader some background on the algorithm
(20 points)
___and teach the reader how to make weighted network into a
minimal spanning tree. Pictures are a must.
(20 points)
___Compare and contrast your findings with Kruskal’s
Algorithm as appropriate.
(20 points)
