Which one of the following algorithm design techniques is used by Prim's algorithm in constructing a minimum spanning tree for a connected weighted graph?

1

Divide and Conquer

2

Greedy method

3

Dynamic Programming

4

Backtracking

5
Question Not Attempted

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation