Self doubt

Question

What is the difference between Dijkstra and Bellman Ford algorithm?

Will the shortest path given by both be same in following conditions :

a) All positive edge weights

b) Some negative edge weights without negative edge cycle

c) With negative edge cycles

Comments

Yes, I know.

---

If there is only positive edge weights then we can use either dijkstra or bellman Ford is that so?

---

yes...@vipin

Answer 1

If only (+)ve edge weight then both will give correct answer.

If there is (-)ve edge weight only then Dikstra's may or may not give correct answer but bellman ford will give correct answer.

If (-) ve edge weight cycle then bellman ford will report it if it is reachable from source and return answer as undefined.