Q39
Which algorithm is used to find the longest path in a Directed Acyclic Graph (DAG)?
A.
Depth-First Search (DFS)
B.
BFS
C.
Dijkstra's Algorithm
D.
Dynamic Programming
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board