1 votes 1 votes rajoramanoj asked Nov 1, 2017 rajoramanoj 438 views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments Rupendra Choudhary commented Nov 1, 2017 reply Follow Share use bellman-ford , here just you have to replace lower weight with higher weight , in that way , eventually from some particular source , you'll have longest path to other vertices. bellman-ford follows dynamic approach. 0 votes 0 votes rajoramanoj commented Nov 1, 2017 reply Follow Share yes got it thank u... 0 votes 0 votes sandeepjkh commented Nov 2, 2017 reply Follow Share Dynamic is correct because dynamic covers all possibilities 0 votes 0 votes Please log in or register to add a comment.