Explanation Given information: The following is the given graph − Calculation: The Kruskal’s algorithm follows the following steps to form the minimum spanning tree from the given graph- First Form- Add the edge with least weight. In the given graph { g , f } is the edge with least weight so add it into the tree. Now observe all the remaining edges and pick the edge with minimum weight and add it. Now there are two edges with minimum weights { a , b } and { a , e } , so add them also. Now, observe the remaining edges. The edges { a , g } { b , e } { e , f } are the small edges with weight 4 . Since the edge { b , e } forms the loop, it will never be added. So add the edge { a , g } to the tree. Next add { e , c } and { c , d } to the graph. Finally the following will be the edges in the minimum spanning tree obtained using Kruskal’s algorithm. { g , f } , { a , b } , { a , e } , { a , g } , { e , c } , { c , d } Another minimum spanning tree can be formed. Second Form- Instead of adding the edge { c , e } to the tree, the edge { b , c } can be added with same weight to form the spanning tree in step 4 To determine (b) To find out all the minimum spanning trees that can be obtained using Prim’s algorithm.

5th Edition

ISBN: 9780357035283

Author: EPP

Publisher: Cengage

See similar textbooks

Question

Chapter 10.6, Problem 9ES

To determine

(a)

To find out all the minimum spanning trees that can be obtained using Kruskal’s algorithm.

To determine

(b)

To find out all the minimum spanning trees that can be obtained using Prim’s algorithm.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 10.6, Problem 8ES

Chapter 10.6, Problem 10ES

Students have asked these similar questions

= Q6 What will be the allowable bearing capacity of sand having p = 37° and ydry 19 kN/m³ for (i) 1.5 m strip foundation (ii) 1.5 m x 1.5 m square footing and (iii)1.5m x 2m rectangular footing. The footings are placed at a depth of 1.5 m below ground level. Assume F, = 2.5. Use Terzaghi's equations. 0 Ne Na Ny 35 57.8 41.4 42.4 40 95.7 81.3 100.4

Q1 The SPT records versus depth are given in table below. Find qan for the raft 12% foundation with BxB-10x10m and depth of raft D-2m, the allowable settlement is 50mm. Elevation, m 0.5 2 2 6.5 9.5 13 18 25 No.of blows, N 11 15 29 32 30 44 0 estigate shear 12%

Chapter 10 Solutions

Discrete Mathematics With Applications

Ch. 10.1 - Let G be a graph and let v and w be vertices in G....Ch. 10.1 - A graph is connected if, any only if, _____.Ch. 10.1 - Removing an edge from a circuit in a graph does...Ch. 10.1 - An Euler circuit in graph is _____.Ch. 10.1 - Prob. 5TY Ch. 10.1 - Prob. 6TY Ch. 10.1 - Prob. 7TY Ch. 10.1 - If a graph G has a Hamiltonian circuit, then G has...Ch. 10.1 - A travelling salesman problem involves finding a...Ch. 10.1 - In the graph below, determine whether the...

Knowledge Booster

(a) To find out all the minimum spanning trees that can be obtained using Kruskal’s algorithm.

Solution Summary: The author explains how Kruskal's algorithm forms the minimum spanning tree from the given graph.

(a) To find out all the minimum spanning trees that can be obtained using Kruskal’s algorithm.

(b) To find out all the minimum spanning trees that can be obtained using Prim’s algorithm.

Want to see the full answer?

Chapter 10 Solutions

(a)

To find out all the minimum spanning trees that can be obtained using Kruskal’s algorithm.

(b)

To find out all the minimum spanning trees that can be obtained using Prim’s algorithm.