Bellman-Ford Algorithm

  • It can be implemented easily in a distributed manner.
  • Time complexity is O(VE).
  • It is slower than Dijkstra’s for an equivalent problem but more versatile because it is capable of handling graphs in which some of the edges weight are negative numbers.
  • It works on the principle of relaxation

--

--

--

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

How to measure your lawn

A brief insight into conditional probability

The Fundamentals of Algorithmic Complexity

White Chocolate Slab — 2Kg

Mathematics and Algorithms

Probabilité

Probabilité

RANDOMIZED ALGORITHM

The Basics of Hypothesis Testing

Hypothesis Testing: from www.getexcelsior.com

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
SAHIL SHARMA

SAHIL SHARMA

More from Medium

Introduction to Programming - What is Programming Paradigm?

FINDING ARTICULATION POINT IN A GRAPH

TIL 0621 Head First Java Ch.3 — Know Your Variables_2

RECURSION