2 votes 2 votes Algorithms algorithms directed-graph dynamic-programming virtual-gate-test-series + – Hradesh patel asked Oct 6, 2016 • edited Apr 14, 2019 by Lakshman Bhaiya Hradesh patel 622 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Kapil commented Oct 6, 2016 reply Follow Share Statement 1 is implementing johnson's algorithm, which uses BF as a subroutine and even dijkstra . and the whole complexity = BF + Dijkstra, so noway it can be faster than BF alone. 0 votes 0 votes Hradesh patel commented Oct 6, 2016 reply Follow Share @habib+@kapilp plz check statement2 is false because dynamic programming satisfied globally- structure property its not locally..... and statement 1 already u explain...but johnson's algorithm is a part of syllabus or not ... 1 votes 1 votes sushmita commented Dec 3, 2016 reply Follow Share yeah is johnsons algo in syllabus?? 0 votes 0 votes Please log in or register to add a comment.
