Which of the following is false about Prim’s algorithm?
(a) It is a greedy algorithm
(b) It constructs MST by selecting edges in increasing order of their weights
(c) It never accepts cycles in the MST
(d) It can be implemented using the Fibonacci heap
The question was posed to me in an interview for internship.
I want to ask this question from Minimum Spanning Tree in chapter Minimum Spanning Tree of Data Structures & Algorithms II