0 votes 0 votes Is Bellman ford considered as Greedy Algorithm or Dynamic programming? If both then please explain approaches in both methods. Thanks Algorithms self-doubt + – Ashwin Kulkarni asked Nov 18, 2017 Ashwin Kulkarni 697 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Namit Dhupar commented Nov 18, 2017 reply Follow Share http://www.geeksforgeeks.org/dynamic-programming-set-23-bellman-ford-algorithm/ 0 votes 0 votes Ashwin Kulkarni commented Nov 18, 2017 reply Follow Share So we should always consider bellman ford as dynamic? I mean sometimes in match the pair we have both options. 0 votes 0 votes Rupendra Choudhary commented Nov 18, 2017 reply Follow Share Hello Ashwin why do you think , an algorithm can follow both approaches ? Bellman-ford follows dynamic approach. it relaxes every edge n-1 times , not like dijkstra's approach , in which edge is relaxed once and when it is relaxed , it will never reconsider it , means it's mentality is like 'my local optimal solution will become global optimal so i don't care , i will just relax once every edge and it's then done for me.' while bellman-ford is a mature guy who knows that partially i can mistake so better to reconsider choices and then only claim the global solution. 4 votes 4 votes Ashwin Kulkarni commented Nov 19, 2017 reply Follow Share Haha. Perfect example! Thank you @Rupendra Choudhary 0 votes 0 votes Please log in or register to add a comment.
