Which algorithm is commonly used to find the shortest path in a network?
a) Ford-Fulkerson
b) Kruskal's
c) Dijkstra's
d) Hungarian
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
134
Views
