Dijkstra’s Algorithm is the prime example for ___________
(a) Greedy algorithm
(b) Branch and bound
(c) Back tracking
(d) Dynamic programming
I have been asked this question in an international level competition.
My question is from Shortest Path topic in portion Shortest Path of Data Structures & Algorithms II