Q113
Which of the following is true?
A.
Prim's algorithm can also be used for disconnected graphs
B.
Kruskal's algorithm can also run on the disconnected graphs
AnswerC.
Prim's algorithm is simpler than Kruskal's algorithm
D.
In Kruskal's sort edges are added to MST in decreasing order of their weights
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board