The Prim's algorithm for finding the minimum spanning tree is based on _______ approach.

1
Divide and Conquer
2
Dynamic Programming
3
Greedy
4
Backtracking
5
None of the above

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation