Question: Minimum Spanning Tree Given following weighted undirected graph, show the minimum spanning tree formed by Kruskal’s algorithm. (10) Algorithm Steps 1. Sort all the edges in non-decreasing order of their weight. 2. Pick the smallest edge from sorted set of edges. Check if it forms a cycle with the spanning tree formed so far. If cycle is not formed, include this edge. Else, discard it. 3. Repeat step#2 until there are (V-1) edges in the spanning tree. Show transcribed image text Question: Minimum Spanning Tree Given following weighted undirected graph, show the minimum spanning tree formed by Kruskal’s algorithm. (10) Algorithm Steps 1. Sort all the edges in non-decreasing order of their weight. 2. Pick the smallest edge from sorted set of edges. Check if it forms a cycle with the spanning tree formed so far. If cycle is not formed, include this edge. Else, discard it. 3. Repeat step#2 until there are (V-1) edges in the spanning tree.

## Expert Answer

Answer to Question: Minimum Spanning Tree Given following weighted undirected graph, show the minimum spanning tree formed by Krus…