Bellman-Ford in 5 minutes — Step by step example

Step by step instructions showing how to run Bellman-Ford on a graph.

[triandot]

7 years ago, better explanation than any modern source

[jrumac]

you got me through my undergrad DS&A course and now i've come back to you for interview prep. thank you!!!

[BharatSingh-zklx]

Tomorrow is my exam and this has saved my day . Thanks a lot man🙌

[nerdalert-yt]

You are a saint. Your small lessons provide more value than several hours of lecture by my prof. Keep it up.

[mehdibadaoui]

it's unbelievable how well you explain the algoritms

[JovanaaaSK]

Thank you so much ! It's just pretty amazing how we spent 2 sessions of 2 hours in an amphitheatre trying to learn this and turn the algorithm by following the literal code, and here I got it in literally 5 minutes. I'm so eternally grateful.

[forthehomies]

Only video on Bellman-Ford that cemented my understanding.

[HowlingDeath]

You're the best algo teacher I have ever seen sir

[lunaticnomad]

This guy is the best in this kind of content, clear speech with concise teachings.
🙏 BLESS 🙏

[oXOXo]

Wow my professor took about 20min to explain this and I didn't really get it. I thought it was hard, but after watching your video in 1/4th the time I am able to explain to others how to run the algorithm, and truly understand it. Turns out it isn't hard at all - just need someone good like you to explain it! Thanks a ton.

[mingHiewNN]

Thank you so much for your fantastic work! I found learning these techniques by merely reading textbooks and listening to university lecturers pretty bland and counter-intuitive, but fortunately your visualized examples have given me a much clearer picture. in fact I started to understand the all the previously incomprehensible texts and pseudo-codes just after having seen your videos, and I would very much appreciate if you have any plans in the future to share further videos on NP-complete problems and approximation algorithms. Have a nice day!

[huzaifamohsin]

I've have exam in half an hour and here I am watching this video! Thanks Man!

[deep.space.]

Instead of only outputting the distance, it would be nice to add that, for each node one can keep track of the parent node where the current shortest distance is found, then traverse backwards from the destination to the source to obtain the shortest path.

[버그헌터_기브르]

jeez if the professor at our uni could explain it this way. simple and straight forward to the point. thanks a lot

[RandomShowerThoughts]

I think this might be one of the best explanations I've seen, I just couldn't understand why we'd need to perform more than 1 iteration. But it makes sense because we don't know how to learn the node, hence, the requirement for more edges. We may finish early, but we need to discover all the possible shortest paths before that.

[mazenessam]

i was litterly in a middle of a half an hour exam and i didnot know what was this algorithm i opened youtube and found you and litterly in less than 2 mins i understood it and solved the exam thanks bro ❤❤

[Anushkumar-lqhv]

I finally understood Bellman-Ford. Thanks for the working example.

[estebancarrasco]

I have a discrete mathematics test coming up, and thanks to you, now i understand better. Thanks¡

[nksdp]

You have the lightest and best understandable pseudo-code i've seen !
Thanks a lot !

[jixbro]

I've never seen better explanation about Bellman-Ford than this video. Thanks a lot!