0 votes 0 votes Consider the statements True/ False Bellman Ford algorithm reports a shortest path from source to a destination only in a directed graph which has a negative cycle. Algorithms algorithms bellman-ford true-false + – VIKAS TIWARI asked Dec 13, 2017 • retagged Jul 6, 2022 by Lakshman Bhaiya VIKAS TIWARI 1.4k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply akash.dinkar12 commented Dec 13, 2017 reply Follow Share https://stackoverflow.com/questions/14785413/can-we-apply-bellman-ford-algorithm-to-undirected-graph 0 votes 0 votes Ashwin Kulkarni commented Dec 13, 2017 reply Follow Share False. BF works for undirected graphs also only condition is it shouldn't have negative wt cycle. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Bellman ford only finds whether a negative weight cycle is reachable from source or not. Ekta07_GATE answered Apr 29, 2019 Ekta07_GATE comment Share Follow See all 0 reply Please log in or register to add a comment.
