What algorithm technique is used in the implementation of Prim\'s solution for t

Question

What algorithm technique is used in the implementation of Prim's solution for the minimum spanning tree?

a) Dynamic Programming Technique

b) Divide-and-Conquer Technique

c) Greedy Technique

d) More than one of the above

e) None of the above

I know that Prim's solution is a greedy algorithm but I guess I'm stuck on the word "technique." When I read "technique" in this question I think of a priorty queue. This leads me to think that the answer is none of the above. Am I over thinking this? Is the answer simply greedy technique? Please help.

Explanation / Answer

Your Option is correct Only.
i.e Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph.
Greedy algorithm means Technique only No doubt regarding this.

It is Like Technique only To find a Minimum spanning tree for a weighted undirected graph.

Maximum correct answer is: Option c) Greedy Technique.

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.