Q7
Which of the following is not a property of Dijkstra's algorithm?
A.
It finds the shortest path from a single source.
B.
It works efficiently with a priority queue.
C.
It requires a graph to be connected.
D.
It can handle negative weight edges.
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board