Bellman Ford and Dijkstra Algos for single source shortest paths

(3 posts)

Tags:

shiva
guest
Posted 1 year ago #

What are the differences Bellman Ford and Dijkstra Algos for single source shortest paths?
kartik
Moderator
Posted 1 year ago #

Dijkstra and Bellman Ford are two algorithms for single source shortest path problem.

Dijkstra's Algo
1) Dijkstra is a Greedy based algorithm and similar to Prom's MST algo.
2) Dijkstra doesn't work for negative weight edges.
3) Time complexity of Dijkstra is O(|E| + |V|Log|V|)
4) Dijkstra's algorithm is usually the working principle behind link-state routing protocols, OSPF and IS-IS

Bellman-Ford's Algo
1) Bellman-Ford is a Dynamic Programming based algorithm.
2) Bellman-Ford worka for negative weight edges.
3) Time complexity of Bellman Ford takes O(|V||E|) time which can also be written as O(|V|^3)
4) A distributed variant of the Bellman–Ford algorithm is used in distance-vector routing protocols.
Sagar
guest
Posted 11 months ago #

Thanks a lot.

Reply

You must log in to post.