Question

values of the A matrix for each pass through the outer loop. how 15. Figure 7.10 16. Graph for Exercises 1-4 Kruskal's For Exercises 21-24 Graph for Exercises 1-4 For Exercises 17-20, use Prim's algorithm to find a minimal spanning tree for the graph in the 22. Graph for Exercise 18 25. Give an example to sho 25, spanning tree algorithm, 26. Let a be the arc 27. A city plans to lay out bik 17. Graph for Exercises 1-4 18. 20. of lowest w is shown in the figure. (S are not shown in the map 19. 2 28. Assume that arc we spanning tree for t spanning tree couk tained by adding a. Find a spannin Kruskals algorithn is another algorithm for finding a mini si syaning tree in a conneted graph u

question 20
discrete 2

Answer 1

for any doubt please comment . Rate ..

No of values in the given graph is 9. So 9 spinning tree has 8 edges. We start with any arbitrary vertex say(1) the nearest number of U is (3) so (1, 3) is the first edge selectively. Consider the set of vertex {1, 3}. The vertex 4 is the nearest neighbour of {1, 3} So we choose (3, 4) as next edge. Now v = {1, 3, 4} & E = {(1, 3), (3, 4)} Now the vertex {2} is nearest neighbour of U = {1, 3, 4} so we choosed (1, 2) us the next edge such that v = {1, 2, 3, 4, 2} & E = {(1, 3), (3, 4), (1, 2)} Now the nearest neighbour of v is vertex 6 so we choose edge (3, 6) such that v = {1, 2, 3, 4} & E = {(1, 3), (3, 4), (1, 2), (3, 6)}