What type of approach does Dijkastra algo uses: Dp or Greedy?? also about Bellman ford algo??
ACtually Djikstra can be regarded as both dp and greedy … It greedily selects the minimum weight node that has not yet been processed .Moreover , after that it check whether the value is global optimum or not using dp . There is always a debate on the Djikstra’s Algo for this …You can read more at this
<br/
<br/
<br/
Bellman Ford Algo is Dynamic Programming without any doubts … You can learn this algo at the link of geeksforgeeks