Use Prim's algorithm to compute the minimum spanning tree for the weighted graph. Start the algorithm at vertex A. Show the order in which the edges are added to the tree. A E 6 7 4 B D 3 Figure 10: A weighted graph shows 5 vertices, represented by circles, and 6 edges, represented by line segments. Vertices A, B, C, and D are placed at the corers of a rectangle, whereas verter E is at the center of the rectangle. The edges, A B, B D, A C, C D, A E, and E C, have the weights, 7, 3, 2, 4, 5, and 6, respectively.

15 10- B 5 D Apply the sorted edges algorithm to the graph above. Find the total cost of the resulting circuit.

1) Using either Prim's or Kruskal's algorithms, determine the cost of the minimum spannin tree which will connect all the vertices of the graph below. State which algorithm you used. 5) Sketch the minimum spanning tree. 5 A F 4 J 2 2 2 4 B 8 G 1 K 13 3 7 C 5 H 4 L 2 2 1 D 7 I 3 1 12 2 E 6 M

Find the minimum cost spanning tree on the graph above using Kruskal's algorithm. Which of the edges below are included in the minimum cost tree? BD CE DF CF AC BC BF CD EF AF BE AB DE AE AD IMAGE ATTACHED

U B BD □AC CE 0 BE AE CD AD ⒸAF OCF 15. AB ODE ODF BC BF EF 10 Find the minimum cost spanning tree on the graph above using Kruskal's algorithm. Which of the edges below are included in the minimum cost tree? ریا T E D

22 D 28 42 35. 45 20 B 44 E 29 A Find the minimum cost spanning tree on the graph above using Kruskal's algorithm. What is the total cost of the tree?

What is the minimum number of links L of an undirected network of N nodes? Select one: О а. 0 O b. N+1 C. N О с. O d. None of the above.

Use Kruskal's Algorithm to find the minimum spanning tree for the weighted graph. Give the total weight of the minimum spanning tree. Be O A. 12 3 43 B. K 4 X6 24 to 21 17 281 C 25 D 119 14 F Which of the following trees matches the shape of the minimum spanning tree? What is the total weight of the minimum spanning tree? The total weight is 10 E (.... O C. Is O D.