Dijkstra's algorithm solves the:
Show answerHide answer
Correct answer: (C) Single-source shortest path problem
Explanation
It needs non-negative edge weights.
Correct answer: (C) Single-source shortest path problem
Explanation
It needs non-negative edge weights.
This is question 147 of DSSSB TGT Computer Science Full Mock Test 3. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.