edited by
379 views
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?
edited by

Please log in or register to answer this question.

Related questions

2 votes
2 votes
1 answer
3
Sumaiya23 asked Jan 29, 2018
2,095 views
The number of balance parenthesis possible with 5-pairs of parenthesis _________. [ Assume ( ) and (( )) is balance parenthesis but not ) ( ]
0 votes
0 votes
0 answers
4