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
πŸ’¬ Discuss
βœ… Correct Answer: (A) prim’s algorithm initialises with a vertex
Explanation: 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).

Explanation by: Mr. Dubey
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).

πŸ’¬ Discussion

πŸ“Š Question Analytics

πŸ‘οΈ
932
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
87%
Success Rate