Which of the following is false about Prim’s algorithm?

Which of the following is false about Prim’s algorithm? Correct Answer It constructs MST by selecting edges in increasing order of their weights

Prim’s algorithm can be implemented using Fibonacci heap and it never accepts cycles. And Prim’s algorithm follows greedy approach. Prim’s algorithms span from one vertex to another.

Related Questions

Which of the following statement is false about Prim’s algorithm?
Consider the undirected graph below: Using Prim's algorithm to construct a minimum spanning tree starting with node a, which one of the following sequences of edges represents a possible order in which the edges would be added to construct the minimum spanning tree?