Consider the undirected graph below: Using Prim's algorithm to construct a…
GATE · 2004 · IT
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?
- A.
(E, G), (C, F), (F, G), (A, D), (A, B), (A, C)
- B.
(A, D), (A, B), (A, C), (C, F), (G, E), (F, G)
- C.
(A, B), (A, D), (D, F), (F, G), (G, E), (F, C)
- D.
(A, D), (A, B), (D, F), (F, C), (F, G), (G, E)
Attempted by 289 students.
Sign up free to check your answer
Sign up freeLoading lesson…