A

Admin • 802.91K Points
Coach

Q. Which of the following is true?

  • (A) prim’s algorithm initialises with a vertex
  • (B) prim’s algorithm initialises with a edge
  • (C) prim’s algorithm initialises with a vertex which has smallest edge
  • (D) prim’s algorithm initialises with a forest
Explanation by: Admin
steps in prim’s algorithm: (i) select any vertex of given graph and add it to mst (ii) add the edge of minimum weight from a vertex not in mst to the vertex in mst; (iii) it mst is complete the stop, otherwise go to step (ii).

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.