Bellman-Ford in 5 minutes - Step by step example

[@triandot]

7 years ago, better explanation than any modern source

[@saikatsaha1907]

Still better than anything else from 2023 😂

[@eliokuster4915]

yeah for real

[@q1bb0]

now, 8 years ago

[@micycle8778]

because every mf decides to hide the algorithm behind opaque notation

[@sub-hh5qg]

9 and still true…

[@jrumac]

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

[@MichaelSambol]

Crush it my dude

[@riddhivekariya9086]

​@@MichaelSambolplease upload more videos

[@mehdibadaoui1658]

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.

[@alexgarrett277]

I love how universities teach computer science like social studies

[@BharatSingh-zk8lx]

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

[@ibrahimovich1617]

+Bharat Singh Me either :p

[@sebastiansimon7557]

My exam is in two hours.

[@Divyanshuthegame]

I'm giving my exam.

[@9990490677]

You take an exam and not 'give' an exam. :)

[@tobedefined751]

what if he was at that moment handing in his exam?

[@nerdalert-y3t]

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

[@forthehomies7043]

Only video on Bellman-Ford that cemented my understanding.

[@HowlingDeath]

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

[@MichaelSambol]

🫡

[@deep.space.12]

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.

[@petosigut2271]

Very important, it is also missing in the pseudocode, the prev attribute is set to nil initially, but not changed in the update procedure

[@huzaifamohsin]

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

[@whogotpwned]

Hope you managed to pass 👍😀

[@lunaticnomad0]

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

[@nksdp9776]

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

[@jix2bro]

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

[@MichaelSambol]

Thank you!

[@mazenessam8326]

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 ❤❤

[@Lircking]

bruh

[@jaeyongim]

Straightforward and clear demonstration of the algorithm. Your video helped me a lot. Thanks :)

[@MichaelSambol]

You are welcome! Thanks for watching.

[@Anushkumar-lq6hv]

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

[@estebancarrasco5823]

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

[@o8XOX8o]

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.

[@버그헌터_기브르]

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

[@leonleng7814]

Thank u so much. It's the best Bellman Ford Descrption Video I've ever seen!

[@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!

[@MichaelSambol]

More on the way, thank you for watching.

[@SatyamEdits]

thank you so much...!!! 😢😢 i had tears in my eyes....it cleared completely all my doubts...

[@nightmareblocks]

Bless. Thank you so much. This makes WAY more sense than the pitiful amount of explanations on it in my class. I have my final in an hour and a half and you might have just saved me a world of hurt.

[@mayankbaraskar]

Thanks a lot man...I am going for exams and these 5-minute video will definitely add some marks to my paper...

[@phjnarthana]

This helped me a lot with my exams. Thanks a lot brother. You are a savior 😅

[@ajnabee01]

New knew Bellman Ford algorithm was so easy. Great content man 🔥

[@cyprianblunt1783]

Thanks for the video. It'll help me get through my homework and (maybe) final. I'll show this to anyone else stuck on this problem.

[@gargnakshatra]

Thanks Very Much, I Really Appreciate It. I have watched many videos on this topic in the last hour but You explained the BEST. THANKS, Michael!

[@FaizanAli-nl5ll]

Great excercise I like it..it's very useful for us and everybody...everybody can see this and learn this excercise easily from this channel.

[@brandoncazares8452]

This has very much saved my day for my final tomorrow. Thanks, Michael.

[@MichaelSambol]

Glad I could help! Good luck on your final, Brandon.

[@brandoncazares8452]

@@MichaelSambol Fantastic Michael. This video's helpful for me and glad I watched this.

[@abdullahkhalid9581]

Thank you! Already shared your channel with my friends. We have design & analysis of algorithms exam tomorrow and your videos are short and precise.

[@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.

[@MichaelSambol]

This should help too: github.com/msambol/dsa/blob/master/shortest_path/bellman_ford.py

[@ekaterinakurochkina8780]

Thank you very much. I couldn’t find anything useful on Russian, so I found this video and it help me

[@D3ebK]

Very eloquently demonstrated, Michael!

[@iaa423]

Great video for a refresher!

[@MichaelSambol]

thank you!

[@Sulerhy]

this is absolutely the best explanation for me who does not come from CS school. Thank you, now I can beat them lmao

[@sachinmagdum9796]

Nice! You may want to add how to check for negative-weight cycles.

[@yitzchakmeltz1309]

for sure something that's missing from this video. Especially when this is a big advantage for this algorithm

[@YousraBenzeghiba]

I am headed to my exam rightnow ...You saved my life

[@fernandoandrade5585]

Doing the exact same thing now!

[@abhichakladar5279]

If only lectures were as easy and straightforward as your tutorials

[@josefinkarlsson3712]

I LOVE YOUR VIDEOS!! I learn so much when you explain short and simple- THANK YOU!

[@chadkrause6574]

Good, easy, short explanation. These algorithms aren't hard, but everyone makes them really hard by making videos that are way too long and with unnecessary information. Show the algorithm first, then the detail. Good job!

[@slahfaguira3138]

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

[@kutilkol]

1:37, the picture is good (red arrow representing the inspected edge B->A), but the narrative is somewhat misleading. "Getting to B..." , more likely getting to edge B->A, we see that dist(B) = inf, so dist(A) don't get updated. Nice vid, tho, tx

[@TransportFever2Live]

Thank you, relaxing edges seems now so easy when drawn instead of all these number and steps in algorighms!

[@gazebo543]

Thank you! much better and simpler than so many ppt slides

[@TungTran-yp5yf]

i've watched your vid for about 3 mins or something and that makes me understand the algo more thoroughly than what my professor did at the previous class for an hour! Lmao =DD

[@sitadevimuthkhod3034]

Hey Michael! Your videos are really time saving and awesome! It would be a great help if you made such videos on string matching algorithms like KMP, Rabin Karp, Finite Automata and Naïve as well!

[@kellyharper753]

Thaaaaaaaaanks man............you saved my life...it's the best explanation of bellman-ford algo for me

[@jameshaynes5954]

No negative cycle detection int this video, which is a key part of Bellman Ford!!!

[@pasanmadu6495]

A comprehensive short and sweet video Than you!!!

[@ubaidurrehman4377]

Thanks a lot man, Tomorrow is my exam you have saved my day ......

[@-luca9982]

You are a god for every cs student! All hail Michael!

[@zackkite]

Excellent explanation. Very concise.

[@doomgao3571]

This is real eduation. Today's over 1k students' CS class with low pass rate can only be called a filter, it is not a class!

[@Guiguilamster]

You juste saved me one hour before my exam, thank you so much :D

[@tianzewang6734]

Wow that's amazing. 5 mins video wins 20 slides of our lecture

[@mouradmabrouk7328]

wow your explanation is the best bro keep it up

[@sandunrajapurage6493]

Woow, You saved lot of time. Thank You very much.

[@子72]

Thank u. u r the god of teaching algorithm.

[@Lamya1111]

really good explanation! thank you, Michael.

[@lynam5464]

Very very veryyyyy great for my prepare to exam tomorrow. Thank you!

[@AdityaNand97]

Great Illustration Sir. Thanks for the video...!

[@charmingzhang8682]

Love this! I've been stuck for hours

[@Mark-fc7tu]

Very clear and informative. Thank you.

[@toby0622]

Clear and easy to understand, great work. The only thing I'm concerning is that the speaking is a little bit to slow.

[@anerdwitdacamera204]

You must have spent a huge amount of time on drawing all these pictures. thank you so much!!!

[@ThefamousMrcroissant]

Kinda forgot the cycle detection there lad. If the algorithm still finds a better path after n-1 iterations a negative cycle must exist. Which is one of the great powers of Bellman-ford's.

[@it41tanmayaron26]

No algo can find shortest distance if there exists a negative cycle

[@kodyappleton6892]

@@it41tanmayaron26 Yes but it can detect one and return a message stating that one exists and that the shortest path is -∞

[@andreialeksanian7334]

better than my uni lecture. Thanks!

[@anonymoustravelvidz]

I think this is making it more confusing, you could make a line for each iteration, so we can the pattern as it moves through each iteration.

[@Noah-jz3gt]

this video helps a lot for my understanding.. finally...

[@michaliskaseris2467]

Best tutorial out there! Good work mate!

[@mdellertson]

Great explanation, very easy to understand. Thanks so much!

[@maingameapaman]

finally! a non indian accent bellman ford video!!!

[@oscarhenry7412]

Big thumbs up. Very well explained!

[@sanketsinha8933]

thanks so much your method of teaching is very detailed..thanks again for making this video!

[@nidhishukla_iitiankgp]

thanku sir much simpler explanation and exact point

[@crazygeekman4068]

Vidéo de qualité avec des sous-titres en Français écrits avec soin. Merci :)

[@chrysoulabenou5843]

Thanks! Great and brief video :)

[@shando_tube]

nothing will ever beat this vid

[@toufiqulislam5637]

Very nice explanation. Thanks a lot. Thumbs UP.

[@manoelstilpen7443]

how can I get the critical path using this method ?

[@william0377]

genius, its clear and easy to understand, thanks man

[@privateaccount4460]

Quick note others pointed out: Pseudo code forgets to actually implement prev. (My guess is, during the confusion of trying to make procedure update look mathematically formal instead of writing understandable code): instead of a min, equivalently do: sum = dist(u) + l(u, v) if sum < dist(v), then dist(v) = sum rev(v) = u (don't dist(u) +l(u, v) potentially twice per update, optimize!!!)

[@Saurav192]

The best video yet.....

[@JosephKJ]

Cant be better. Thanks a lot.

[@tioman42]

Exam in 2 hours. Saves my day!

[@harshdhaundiyal2241]

Great Video 🙌🙌🙌 Thanks It's been really helpful

[@pawesosnowski253]

Awesome simple explanation, thanks!

[@stephenlasky9348]

great video, short and to the point

[@leeamraa]

thank you! great tutorial!!! Please keep doing what you do. a suggestion to add how to find/check on the negative cycles.

[@MichaelSambol]

I should have mentioned that, apologies. Take a look at the code here, it should help: github.com/msambol/youtube/blob/master/shortest_path/bellman_ford.py#L44-L52. Thanks for watching!

[@marcorivera4776]

Clear and concise video, thanks!

[@AgPower1000]

In the algorithm you have a prev() table that you don't update next neither you use it on the animation. Other than that great job

[@debojyotisaha]

Thanks sir for giving this great explanation .

[@sarveshpandey1125]

It's such a perfect explanation. Please make a video on Master's Theorem.

[@avinashsingh4989]

It's an awesome video mate. Thank you very much..!

[@deepaksinghpana5097]

Thank you soo much man. You saved me.. (tomorrow is my exam)

[@shliang]

Great videos, I encourage you to make a full library of these

[@trevorg5938]

i have such a limited attention span you are perfect!

[@tnvmadhav2442]

It is really good and concise ! Thank you

[@Jake_2903]

you can ierate one more time after V-1 iterations, and if any edge is relaxed there is a negative cycle and yozu can return None, or neginf or whatever, this way it will work on graphs with negative cycles