Question 3
(a) Apply Kruskal's algorithm to find a minimum spanning tree and its weight for the graph on 6 vertices
v1, v2, v3, v4, v5, v6
with the following edges and weights respectively as in Table 1 below.
Set out your answers in the Table 2 below (see workshop video, Handout Example 5, or Week 8 practical questions 1 and 2). You may not need all given rows.
(b) Draw your spanning tree on the following set of vertices.
Students succeed in their courses by connecting and communicating with an expert until they receive help on their questions
Consult our trusted tutors.
Login | Sign Up
