Q.7 a) Prim-Kruskal's Algorithm: Assume that Prim and Kruskal have come together to design a new algorithm to find the minimum spanning tree where the edges are picked alternatively first using the Prim's approach and the second using the Kruskal's method. Write briefly the pseudo code of the algorithm, analyze its complexity and explain the MST found in the below graph using this approach. 8 B 9 E 5 1 3 11 7 D A 10 (Fig. 6)

          Q.7 a) Prim-Kruskal's Algorithm: Assume that Prim and Kruskal have come together to design a new algorithm to find the minimum spanning tree where the edges are picked alternatively first using the Prim's approach and the second using the Kruskal's method. Write briefly the pseudo code of the algorithm, analyze its complexity and explain the MST found in the below graph using this approach.
8
B
9
E
5
1
3
11
7
D
A
10
(Fig. 6)

Q.7 a) Prim-Kruskal's Algorithm: Assume that Prim and Kruskal have come together to design a new algorithm to find the minimum spanning tree where the edges are picked alternatively first using the Prim's approach and the second using the Kruskal's method. Write briefly the pseudo code of the algorithm, analyze its complexity and explain the MST found in the below graph using this approach.
8
B
9
E
5
1
3
11
7
D
A
10
(Fig. 6)

Added by Robyn M.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Steven Clarke

04/15/2023

Step 1

- Choose an arbitrary starting vertex for Prim's algorithm. Let's start with vertex A. Show more…

Show all steps

Thanks for your feedback!

Q.7 a) Prim-Kruskal's Algorithm: Assume that Prim and Kruskal have come together to design a new algorithm to find the minimum spanning tree where the edges are picked alternatively first using the Prim's approach and the second using the Kruskal's method. Write briefly the pseudo code of the algorithm, analyze its complexity and explain the MST found in the below graph using this approach. 8 B E 9 5 3 11 7 A 10 (Fig.6)