Vidyalelo
Data Structure · Q106

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 106

Q106

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
Answer
C.
It never accepts cycles in the MST
D.
It can be implemented using the Fibonacci heap

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board