A

Admin • 832.70K Points
Coach

Q. 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

Explanation by: Admin

prim’s algorithm can be implemented using fibonacci heap and it never accepts cycles. and prim’s algorithm follows greedy approach. prim’s algorithms

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.