b) Greedy
Prim’s algorithm follows a _______ approach to find a minimum spanning tree.
About Author
Hey there, its OnlineCertificationGuide here to help you out in your Journey in the study. So my friend share the site with your friends in case I am helpful to you.