A spanning tree for an undirected graph is a sub-graph which includes all vertices but has no cycles. There can be several spanning trees for a graph. A weighted undirected graph can have several spanning trees One of the spanning trees has smallest sum of all the weights associated with the edges. This tree is called minimum spanning tree (MST). Find the MST in the following graph using Kruskal Algorithm. V=a, b, c, d, e, f, g, h, i, j and E=(a, b, 12), (a, b, 3), (a, j, 13), (b, c, 12), (b, d, 2), (b, h, 4), (b, i, 25), (c, d, 7), (c, j, 5), (e, f, 11), (e, j, 9), (f, g, 15), (f, h, 14), (g, h, 6), (h, d, 20), (h, i, 1) . Note: Numeric value is the weight of the corresponding edge. -A spanning tree for an undirected graph is a sub-graph which includes all vertices but has no cycles. There can be several spanning trees for a graph. A weighted undirected graph can have several span

"Do you want an original answer to this question?


Yes No

"Is this question part of your assignment? Essay
.We Can Help!

Order Now