0 0 votes Algorithms algorithms shortest-path ace-test-series bellman-ford + – Vignesh Kamath 2.2k views answer comment Share Follow Print See all 6 Comments 6 6 Comments reply Show 3 previous comments Rahul Jain25 commented Jan 17, 2017 reply Follow flag Bellman ford works, it detects negative cycle, but here it is not asked whether it is computing correctly or not. It is just asking what is values after 4 iteration, I know we cannot have correct answer but it is asking what is summ after 4th iteration. 0 0 replyShare Pavan Kumar Munnam commented Jan 17, 2017 reply Follow flag and what are the sequence of edges, if i take different sequences different results will come 0 0 replyShare Rahul Jain25 commented Jan 17, 2017 reply Follow flag Yes thats right, also source is not specified and many sequence are possible. 0 0 replyShare Please log in or register to add a comment.
0 0 votes Bellman-Ford algorithm works on graphs that don't contain any cycles with negative weights. Here EBCDE make a cycle with negative weights of value -1. So Bellman-Ford algorithm is not applicable. Arnab Bhadra answered Apr 3, 2017 Arnab Bhadra comment Share Follow See 1 comment 1 1 comment reply pradeepchaudhary commented Nov 28, 2018 reply Follow flag Sir...Most Respectfully ,Actually The Algorithm you are talking about is is Dijkstra Algorithm and not the Bellman Ford....Bellman ford In fact used to detect the negative weight cycle. 0 0 replyShare Please log in or register to add a comment.
0 0 votes Answer According to Me is 35. Tell Me if Correct to get the solution..... pradeepchaudhary answered Nov 28, 2018 pradeepchaudhary comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes https://www-m9.ma.tum.de/graph-algorithms/spp-bellman-ford/index_en.html create the graph and run the algorithm. debasish paramanik answered Sep 13, 2020 debasish paramanik comment Share Follow 0 reply Please log in or register to add a comment.
