For each of the graphs in 9 and 10, find all minimum spanning trees that can be obtained using (a) Kruskal’s algorithm and (b) Prim’s algorithm starting with vertex a or t. Indicate the order in which edges are added to form each tree.
To find out all the minimum spanning trees that can be obtained using Kruskal’s algorithm.
The following is the given graph −
The Kruskal’s algorithm follows the following steps to form the minimum spanning tree from the given graph-
Finally the following will be the edges in the minimum spanning tree obtained using Kruskal’s algorithm.
Another minimum spanning tree can be formed.
Instead of adding the edge to the tree, the edge can be added with same weight to form the spanning tree in step 4
To find out all the minimum spanning trees that can be obtained using Prim’s algorithm.
Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!Get Started