#doubt

Question

difference between Bellmann ford and dijkstra's algorithm for -ve weight cycle graph

Comments

DIjkstra doesn't work for graphs with negative weight cycles, if they are reachable from source. To overcome that, we use Bellman-Ford algo.

---

Bellman ford also not work on -ve weight cycles

right?

but Bellman ford work on -ve weight edges

but Dijkstra not work for -ve weight edges

right?

---

Bellman-Ford will detect negative weight cycles and yes, will work on negative edges too.

Answer 1

in dijkstra

if there is a negative weight cycle then dijkstra will not work  .

if there is negative edge in the graph but not negative weight cycle then dijkstra may give the correct result

now come to bellman

if there is negative edge in the graph but not negative weight cycle then the bellman give the correct result

if there is a negative weight cycle then bellman ford say that cannot find the shortest path to that vertices because of negative weight cycle