Use Kruskal’s algorithm to find a minimum spanning tree for each of the graphs in 5 and 6. Indicate the order in which edges are added to form each tree.

6.

(a)

The minimum spanning tree for the given graph using Kruskal’s algorithm.

Given information:

A weighted connected graph is given as,

Calculation:

Kruskal’s minimum cost spanning tree algorithm states that, keep on adding the minimum cost edge except those who create the circuit, until we reach n−1 edges where n is the number of vertices in the given graph.

When we apply Kruskal’s algorithm then, edges are added in the following order

(b)

The minimum spanning tree for the given graph using Kruskal’s algorithm.