DT Q37
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?
- Option : D
- Explanation : Option “A” and “B” produce disconnected components which is never allowed by primes algorithm In option “C” if vertex “A” is randomly chosen, then first edge must be (A,D) so option “D” is correct.
You must be logged in to post a comment.
You must be logged in to post a comment.