Bellman-Ford in 5 minutes - Step by step example

Step by step instructions showing how to run Bellman-Ford on a graph.
Bellman-Ford in 4 minutes - Theory: • Bellman-Ford in 4 minu...
Code: github.com/msambol/dsa/blob/m...
Source: Algorithms by S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani [www.amazon.com/Algorithms-San...]
LinkedIn: / michael-sambol

[@triandot]

7 years ago, better explanation than any modern source

[@saikatsaha1907]

Still better than anything else from 2023 😂

[@eliokuster4915]

yeah for real

[@naqibazim3544]

now, 8 years ago

[@micycle8778]

because every mf decides to hide the algorithm behind opaque notation

[@sub-hh5qg]

9 and still true…

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

[@xxbighotshotxx]

excellent work! I will be sure to pass this on to anyone else that needs help with this concept in my algorithms class

[@MichaelSambol]

+Cameron Ellis Thanks Cameron. Glad you enjoyed.

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

[@mehdibadaoui1658]

it's unbelievable how well you explain the algoritms

[@nksdp9776]

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

[@josefinkarlsson3712]

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

[@D3ebK]

Very eloquently demonstrated, Michael!

[@TransportFever2Live]

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

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

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

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

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

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

[@jaeyongim]

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

[@MichaelSambol]

You are welcome! Thanks for watching.

[@mdellertson]

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

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

[@mayankbaraskar]

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

[@lunaticnomad0]

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

[@leonleng7814]

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

[@Anushkumar-lq6hv]

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

[@shliang]

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

[@SatyamEdits]

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

[@gazebo543]

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

[@kellyharper753]

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

[@michaliskaseris2467]

Best tutorial out there! Good work mate!

[@JosephKJ]

Cant be better. Thanks a lot.

[@Lamya1111]

really good explanation! thank you, Michael.

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

[@ajnabee01]

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

[@버그헌터_기브르]

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

[@zackkite]

Excellent explanation. Very concise.

[@Jix2bro]

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

[@MichaelSambol]

Thank you!

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

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

[@armadonluvr]

very clear and concise, thanks a bunch man!

[@phjnarthana]

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

[@anerdwitdacamera204]

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

[@Guiguilamster]

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

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

[@huzaifamohsin]

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

[@whogotpwned]

Hope you managed to pass 👍😀

[@forthehomies7043]

Only video on Bellman-Ford that cemented my understanding.

[@estebancarrasco5823]

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

[@sanketsinha8933]

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

[@crazygeekman4068]

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

[@pawesosnowski253]

Awesome simple explanation, thanks!

[@marcorivera4776]

Clear and concise video, thanks!

[@Mark-fc7tu]

Very clear and informative. Thank you.

[@AdityaNand97]

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

[@tnvmadhav2442]

It is really good and concise ! Thank you

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

[@william0377]

genius, its clear and easy to understand, thanks man

[@oscarhenry7412]

Big thumbs up. Very well explained!

[@user-pd8zn6gq8b]

It helped me so much! Thank you :)

[@pasanmadu6495]

A comprehensive short and sweet video Than you!!!

[@sarveshpandey1125]

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

[@muhammadmuzammil2140]

Perfect explanation.. Thanks alot man

[@stephenlasky9348]

great video, short and to the point

[@charmingzhang8682]

Love this! I've been stuck for hours

[@-luca9982]

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

[@emilmehdixanl4420]

efficient and direct. Thank you.

[@avinashsingh4989]

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

[@manoelstilpen7443]

how can I get the critical path using this method ?

[@lynam5464]

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

[@slahfaguira3138]

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

[@lucaspenna6009]

You are awesome! Thank you for the explanation!

[@toufiqulislam5637]

Very nice explanation. Thanks a lot. Thumbs UP.

[@dino_xor]

Excellent explanation! Finally I could understand this! You got a new subscription here sir!

[@DALIProductions]

Man, you're amazing, thank you

[@harshdhaundiyal2241]

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

[@sandunrajapurage6493]

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

[@Alxsllrs]

thanks, you helped me in my time of need

[@folksgames7047]

Fast accurate videos. Thank you!

[@MichaelSambol]

+FolksGames Glad you enjoyed. Thanks for watching.

[@MsDingens]

nice, that was some good explaining man!

[@chrysoulabenou5843]

Thanks! Great and brief video :)

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

[@kotsos131]

excellent explanation! 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

[@iaa423]

Great video for a refresher!

[@MichaelSambol]

thank you!

[@debojyotisaha]

Thanks sir for giving this great explanation .

[@TuNguyen-ox5lt]

Great video . It helps me a lot . tk you pretty much

[@maximed207]

Thank you ! This is a great video :)

[@mouradmabrouk7328]

wow your explanation is the best bro keep it up

[@PriyanshiSharma0308]

Awesome video. Loved it.

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

[@YousraBenzeghiba]

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

[@fernandoandrade5585]

Doing the exact same thing now!

[@tored7656]

Nice greetings from Germany. Its a very good video :) Thank you

[@nidhishukla5879]

thanku sir much simpler explanation and exact point

[@user-gn1vu3ve9g]

Thank u. u r the god of teaching algorithm.

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

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

[@esraamohamed5601]

Thank you very much ...for all you have done

[@gedeonandrasmusic]

Awesome, very helpful!

[@ekaterinakurochkina8780]

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

[@abhichakladar5279]

If only lectures were as easy and straightforward as your tutorials

[@Saurav192]

The best video yet.....

[@elitiacandy1540]

So helpful. Thank you Keep going :)

[@SuperBodet]

Thank you from Algeria ! :D

[@ayusumardi]

Hi, you have an awesome video here and easy to understand. Can I request for you to make a video on Floyd-Warshall's Algorithm? Truly apprecited.

[@nitishbannur1145]

Very Very Helpful. Thank You!