Q. Which of the following is false about the Kruskal’s algorithm?
✅ Correct Answer: (C)
it can accept cycles in the mst
Explanation: kruskal’s algorithm is a greedy algorithm to construct the mst of the given graph. it constructs the mst by selecting edges in increasing order of their weights and rejects an edge if it may form the cycle. so, using kruskal’s algorithm is never formed.