0 votes 0 votes Which of the following procedure is suitable to find longest path from given vertex to any other vertex in Directed Acyclic Graph? Answer: Dynamic Programming. Why Greedy Algorithm cant be applied here? Algorithms made-easy-test-series algorithms dynamic-programming + – Shamim Ahmed asked Nov 26, 2018 edited Mar 4, 2019 by akash.dinkar12 Shamim Ahmed 379 views answer comment Share Follow See 1 comment See all 1 1 comment reply Hemanth_13 commented Nov 26, 2018 reply Follow Share I think we can apply Greedy Here https://www.geeksforgeeks.org/find-longest-path-directed-acyclic-graph/ 0 votes 0 votes Please log in or register to add a comment.