Bellmann Ford Algorithm is an example for ____________
(a) Dynamic Programming
(b) Greedy Algorithms
(c) Linear Programming
(d) Branch and Bound
I have been asked this question in final exam.
My question is taken from Shortest Path in chapter Shortest Path of Data Structures & Algorithms II