mst problems

(Latest Revision: Apr 19, 2020)

MST Problems

First MST Problem:

Suppose G=(V,E) is a connected undirected graph whose vertex set V is equal to {1,2,3,4,5,6,7}. Suppose that the edges of G are as follows, sorted by increasing weight.

edge  weight

{3, 5}   1
{1, 2}   2
{3, 7}   2
{2, 3}   2
{2, 7}   3
{3, 4}   4
{1, 4}   5
{4, 5}   5
{1, 6}   6
{3, 6}   7
{6, 7}   8

Use Kruskal's algorithm to determine the edges in a min cost spanning tree. In your answer, list the edges in the min cost spanning tree, and their weights, in the order that Kruskal's algorithm would find them.

Second MST Problem:

Make a drawing of the graph, showing the nodes, edges, and weights. Assuming that node #1 is the start node, list the edges of a min cost spanning tree in the order that they would be found by Prim's algorithm.

Directions For Submitting Solution:

Send an E-mail to
tester2@cs.csustan.edu
with this subject line:
CS 4440 MST Problem
(Copy & Paste that exact subject line. Get it right, or get no credit.)

In the message, first write the words
"Kruskal List," followed by the list of edges in the order that Kruskal's algorithm would choose them.
Write edges just like I did, in the form {x, y} z, where x and y are the ends of the edge and z is the cost.

Second in the message, write the words
"Prim List," followed by the list of edges in the order that Prim's algorithm would choose them.
Write edges just like I did, in the form {x, y} z, where x and y are the ends of the edge and z is the cost.