1 1 vote True or False Explain Bellman Ford can never find shortest path of a graph Floyd Warshall can find shortest path of a graph Algorithms algorithms + – srestha 712 views answer comment Share Follow Print See all 4 Comments 4 4 Comments reply Rupendra Choudhary commented Oct 28, 2017 reply Follow flag what do you mean by shortest path of a graph? Bellman-ford is a single source shortest path algo , it can find the shortest path from source to all remaining vertices of graph. Floyd-warshall is a All pair shortest path algo , it can find shortest path b/w every possible pair of vertices. 1 1 replyShare srestha commented Oct 28, 2017 reply Follow flag It is given, if a graph contains -ve weight cycle, then no shortest path exists. So, bellman ford cannot find shortest path in that case 0 0 replyShare Rupendra Choudhary commented Oct 28, 2017 reply Follow flag Yes! that is a true statement but even Floyd-warshall doesn't work in that scenario. https://cs.stackexchange.com/questions/2942/am-i-right-about-the-differences-between-floyd-warshall-dijkstra-and-bellman-fo 1 1 replyShare A_i_$_h commented Oct 28, 2017 reply Follow flag @srestha edit ur question to include the case of having negative weight cycle bellman and ford both wont work incase of negative weight cycle but they work for negative weight edges and dijikstras wont work for both negative weight edges and cycles 0 0 replyShare Please log in or register to add a comment.
