Question 14101 – Mathematical-Reasoning
November 27, 2023Question 13943 – Algorithms
November 27, 2023Question 13897 – Algorithms
Consider the undirected graph below:
Using Prim’s algorithm to construct a minimum spanning tree starting with node a, which one of the following sequences of edges represents a possible order in which the edges would be added to construct the minimum spanning tree?
Correct Answer: E
Question 549 Explanation:
The final sequence is a-b, b-c, c-i, c-f, f-g, g-h, c-d, d-e
(a,b), (a,h), (g,h), (f,g), (c,f), (c,i), (c,d), (d,e)
(a,b), (b,h), (g,h), (g,i), (c,i), (c,f), (c,d), (d,e)
(a,b), (b,c), (c,i), (c,f), (f,g), (g,h), (c,d), (d,e)
(a,b), (g,h), (g,f), (c,f), (c,i), (f,e), (b,c), (d,e)
A and C
Subscribe
Login
0 Comments