Q20
In which of the following scenarios is Prim's algorithm more efficient than Kruskal's algorithm?
A.
When the graph is bipartite.
B.
When the graph has negative weights.
C.
When the graph is dense.
AnswerD.
When the graph is sparse.
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board