Which algorithm is often used to find a minimum spanning tree?
a) Prim’s
b) Ford-Fulkerson
c) Hungarian
d) Bellman-Ford
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
96
Views
