Q7
In which scenario is Dijkstra's algorithm not suitable for finding the shortest path?
A.
When the graph is unweighted.
B.
When there are negative weight edges.
AnswerC.
When the graph is sparse.
D.
When the graph is unweighted.
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board