Q100
Which of the following is false about the Kruskal's algorithm?
A.
It is a greedy algorithm
B.
It constructs MST by selecting edges in increasing order of their weights
C.
It can accept cycles in the MST
AnswerD.
It uses union-find data structure
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board