Question: Given the undirected graph G = (V,E) below, which of the following is true for minimal spanning tree (MST) of G? 4 00 B
Given the undirected graph G = (V,E) below, which of the following is true for minimal spanning tree (MST) of G? 4 00 B 4 2 2 4 3 3 A. The MST from Prim's algorithm differs from the MST from Kruskal's algorithm. B. Both algorithms add the edge (A,B) to MST. C. Both algorithms add the edge (C,D) to MST. D. Both algorithms add a total of five edges to MST. E. Total cost of the MST from Prim's algorithm differs from the total cost of the MST from Kruskal's algorithm. Given the undirected graph G = (V,E) below, which of the following is true for minimal spanning tree (MST) of G? 4 00 B 4 2 2 4 3 3 A. The MST from Prim's algorithm differs from the MST from Kruskal's algorithm. B. Both algorithms add the edge (A,B) to MST. C. Both algorithms add the edge (C,D) to MST. D. Both algorithms add a total of five edges to MST. E. Total cost of the MST from Prim's algorithm differs from the total cost of the MST from Kruskal's algorithm.
Step by Step Solution
There are 3 Steps involved in it
The detailed answer for the above question is provided below Solution The correct answer is B Both a... View full answer
Get step-by-step solutions from verified subject matter experts
