1 votes 1 votes Can we find Negative weight cycles reachable from source in a graph using Dijkstra's Algorithm?? Algorithms algorithms greedy-algorithm dijkstras-algorithm descriptive + – Jithin Jayan asked Jul 21, 2016 • retagged Jun 23, 2022 by Lakshman Bhaiya Jithin Jayan 367 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes no, Dijkstra can't detect negative cycle so come up with wrong result at the end Bellman ford is used in case of negative weight cycle cse23 answered Jul 21, 2016 cse23 comment Share Follow See all 0 reply Please log in or register to add a comment.
