retagged by
487 views
0 votes
0 votes
Which of the following procedure is suitable to find the longest path from a given vertex  to any other given vertex in a directed acyclic graph (weighted) with few negative edge weights.

A) Divide and Conquer

B)Greedy approach

C)Dynamic programming

D)All of these
retagged by

2 Answers

Related questions

0 votes
0 votes
1 answer
3
0 votes
0 votes
2 answers
4
screddy1313 asked Jan 26, 2019
679 views
can anyone explain how dijkstras will behave as BFS whwn a graph is unweighted?