Dijkestra single source shortest path algorithm works if all-05669

Dijkestra's single source shortest path algorithm works if all edges weights are non-negative and there are negative cost cycles.

This multiple choice question (MCQ) is related to the book/course vu cs502 Fundamentals of Algorithms. It can also be found in vu cs502 Final Term - Quiz No.3.