Which algorithm is commonly used for finding the minimum spanning tree?
a) Dijkstra’s Algorithm
b) Prim’s Algorithm
c) Ford-Fulkerson Algorithm
d) Hungarian Method
Welcome!
This community is for professionals and enthusiasts of our products and services.
Share and discuss the best content and new marketing ideas, build your professional profile and become a better marketer together.
This question has been flagged
117
Views
