Graph Data Structure 4. Dijkstra’s Shortest Path Algorithm

[@daringdarius5686]

I don't know if you know this, and this is 4 years late, but this is one of the cleanest, easiest to understand video's (conceptually-wise) for Dijkstra's. I've seen several, but this! This is the best one. :)

[@ComputerScienceLessons]

Great to hear! :)KD

[@vijayalakshmi0714]

@@ComputerScienceLessons lol, but i'm listening even now, best explanation. Keep it up

[@eatbreathedatascience9593]

I agree fully. Best !

[@tudorradu5848]

@@ComputerScienceLessons He's right! It was veryyy easy to understand. Thank you

[@555aboud]

stunning, clear explanation. Thank you so much!!!

[@royazut550]

!!!finally a good and simple explanation oh tears of joy... may the gods bless you with bugless codes

[@neelparekh9846]

"May the gods bless you with bug-less codes." I'm going to use that a lot.

[@neptechbyte]

haha epic comment bro

[@adityapappu4963]

This is literally one of the cleanest, simplest, no-nonsense beautiful explanations of an algorithm I have ever watched on KZbin. Amazing. To-the-point. Crisp. And so easy to understand and digest. THANK YOU.

[@reiniervanleeuwen9815]

This has to be the best explanation of Dijkstra's Shortest Path algorithm... Thanks a lot!

[@assansanogo1343]

FINALLY SOME CLEAR STUFF. almost crying

[@OscarSotomayor]

jaja...you made my day

[@MinecraftLetstime]

Me too!!

[@SkyWalker9669]

said what i wanna say

[@exactzero]

HAHAHAHAHA

[@veggieblues]

mood

[@ietskaag552]

Seriously, I've been looking at so many pseudocodes and incomprehensible python scripts without any clear explanation on how the algorithm actually works. I salute you. This has helped me so much. I can't thank you enough.

[@ComputerScienceLessons]

Yo are most welcome :)KD

[@TANEM315]

You sir are BY FAR the BEST teacher of algorithms on KZbin or anywhere else I've seen algorithm lectures. THANK YOU FOR POSTING THIS! With your well-paced, methodical style you could probably teach anything!!!!

[@SouravendraKrishnaDeb]

We won't be visiting A, again. Me: CRIES LOUDLY

[@ComputerScienceLessons]

A was no fun. :) KD

[@ashutoshthite]

🦍🦍😂😂

[@trulyharsh]

Wiz Khalifa's "See You Again" Plays in The Background

[@小薇-x6g]

i laughed hard reading this

[@YesIlikebananasSo]

You’re hilarious

[@matthewsattam1982]

Extremely clear, extremely well put together visually. Well done, and thank you.

[@ComputerScienceLessons]

I really appreciate your comment. Thanks.

[@trellas3689]

extremely

[@taruchitgoyal3735]

I haven't found a better tutorial than this for understanding and computing distances using Dijkstra's algorithm. Thank you so much.

[@ComputerScienceLessons]

You are most welcome :)KD

[@Jbbubanic5434]

I can't believe how well done this video was made. I appreciate your hard work at a visual representation of this algorithm.

[@mikelanigan9601]

I must commend the quality and clarity of this video: it is by far the best video I've seen on KZbin to date on the subject of explaining Dijkstra's Algorithm. There are so many other videos that do not deal with the problem of keep a record of the shortest route sufficiently systematically enough, in my opinion. This video is systematic, showing the use of a table to perform the algorithm very clearly. Instruction of this level is not accidental; my congratulations to those involved in its production and execution. You have done the domain of Computer Science the world of good. Keep up the great work!

[@ComputerScienceLessons]

Thanks for the great comment Mike.

[@amine_fadssi]

The best video on the internet explaining the Dijkstra’s algorithm, thanks a lot sir.

[@ComputerScienceLessons]

You're welcome :)KD

[@tartarus1322]

I wish I could upvote this more than once. It is honestly a brilliant, clear, and concise explanation

[@ComputerScienceLessons]

You are very kind. Thanks. :) KD

[@chinthalaadireddy2165]

@@ComputerScienceLessons But really it's awesome video.. the best info in the least possible time.. Thank you so much from India 🥰

[@Monochones87]

Lovely, this has been the clearest explanation I've seen so far for Dijkstra's algo. Seriously, thank you so much!

[@ComputerScienceLessons]

Thanks for saying so. You're most welcome :)KD

[@johnstorm589]

Even 6 years later, this is still the best explanation ever

[@extremedifficulty9786]

Even 8 years later, this is still the best explanation ever

[@ronglass5968]

The VERY clearest and well-paced explanation by far! Thanks!

[@ComputerScienceLessons]

You are too kind :)KD

[@smith1923]

This is by far the best video I've seen on this algorithm. It is clear and doesn't skip any steps.

[@ComputerScienceLessons]

Thank you :)KD

[@Museko]

I'm watching a bunch of your videos to review for my Algorithms exam. Thanks a bunch for making these!

[@ComputerScienceLessons]

Thanks for the comment. It's good to hear you're finding them useful. :)

[@mikefriedman9573]

Absolutely the best explanation. Cleared up any and all lingering questions in my mind.

[@babakbekhradmanesh871]

Thanks for your extraordinary explanation. This is literally one of the simplest explanations of an algorithm I have ever watched on KZbin.

[@ComputerScienceLessons]

Thank you. You are very welcome:)KD

[@ComputerScienceLessons]

Hi FTP My scenario is for a non-directed graph (you can go backwards and forwards on any edge), so all the nodes can indeed be reached. However, for a directed graph, some nodes may be unreachable from the given start, as you have intimated. Dijkstra's algorithm finds the shortest paths only to the nodes that can be reached from the starting node. (if there is no path to a node from the start, it's irrelevant). The loop will end when all 'reachable' vertices have been visited. By the way, Dijkstra's algorithm doesn't work if the graph edges have negative weights.

[@handalz]

Appreciate this video. Watched a number of others about Dijkstra's Algorithm and couldn't understand HOW and at what stage another path is evaluated. It wasn't until I saw the graph and how we can track the changes that it somehow brought the entire algorithm into crystal clear focus. Thanks!

[@ComputerScienceLessons]

You are most welcome :)KD

[@Aca99100]

I have never seen a video with such clear and step-by-step explanations. Good job here!

[@ComputerScienceLessons]

I appreciate the comment. Thanks. :) KD

[@ammarulhassan5851]

After spending lots of time on other videos and stuff finally, I have understood "Dijkstra’s" Thanks to this LEGEND.

[@ComputerScienceLessons]

You are most welcome :)KD

[@Moggery]

Fantastically clear and concise. Makes my revision an absolute dream, I can’t thank you enough. 10/10

[@ComputerScienceLessons]

Thank you. Delighted to help :)KD

[@nitesh4146]

This is the best video on Dijstra's Shortest path algorithm I have viewed on KZbin. Kudos!

[@lewistian7975]

BEST explanation of Dijkstra's algorithm EVER!

[@5he1tied]

This is the fourth video I had to watch. Only one that explains clearly, thanks.

[@alpharussel653]

An entire computer science degree courses embedded in this amazing channel. Thank you. Not all heroes wear a cap.

[@Satharus]

Thank you! This is the single best video explaining the algorithm on KZbin.

[@lawrencedennison-hall9642]

Such a clear and coherent explanation. Watched the Craig n Dave video on this previously but this is such a clearer explanation. Understand this now cheers!

[@ComputerScienceLessons]

Glad you found it useful. There is nevertheless some good stuff on Craig n Dave's channel :)KD

[@jackych5055]

man this Dijkstra guy deserved a nobel prize for it

[@ComputerScienceLessons]

He was a clever chap! :)KD

[@daringcalf]

I've watched this the time it was uploaded. I've no idea what it was but I still passed the CCNP exams and found a good job. Now 8 years after that, I fully understand what a priority queue is and what a great man Mr. Dijkstra is, yet I cannot find a decent job and have been unemployed for over a year.

[@aquilazyy1125]

This is very enlightening. I’ve come up with a similar algorithm myself that uses a simple width-first or depth-first search, but I’ve never thought of that we should first calculated the vertex with the least known distance! Thanks for sharing it.

[@ComputerScienceLessons]

Don't thank me, thank this guy :)KD en.wikipedia.org/wiki/Edsger_W._Dijkstra

[@lukewood2662]

Finally, it took me almost a whole week to get it, finally I understood enough to build this damn thing myself. REALLY appreciate it, man. If I knew how to recommend videos to The Odin Project as learning reference, you would be there.

[@ComputerScienceLessons]

Delighted to help. There's something very satisfying when you get the code working :)KD

[@selvalooks]

i used to think this "Dijkstra’s Shortest Path Algorithm" is not for me to understand :) , now i can do it even getting from sleep after watching this video , thanks a ton !!!

[@MimicalThought]

We are learning about Dijkstra's Shortest Path in my Data Communications course and this video explains the algorithm much more clearly than my professor had attempted to explain in our lecture video / notes. Thank you very much, in just 10 minutes I was able to understand something I was spending 30-60 minutes on. Well done!! :)

[@hadeneh]

I signed in just to like this video.

[@magicianwizard4294]

and to comment apparently

[@hariprasathgcse3381]

U r loyal

[@SpaceDisco1]

It's really interesting, how sometimes one thorough example can clear up everything.

[@sanseverything900]

Thank you for including the psuedo-code at the end. Really helped me get an idea of how I should structure my own code!

[@ComputerScienceLessons]

Glad to help :)KD

[@Jack-hd3ov]

After watching about 5 videos on this algorithm, yours has made it crystal clear. Thank you.

[@ComputerScienceLessons]

You're very welcome. :)KD

[@Jack-hd3ov]

@@ComputerScienceLessons Your A* explanation is also the best I found

[@markh1791]

The clearest, and most succinct, explanation of Dijkstra's algo I've seen. Thanks!

[@TourGuideFTW]

The way you explained the algorithm was just great, thanks a lot for making this video!

[@ComputerScienceLessons]

Tnx for the feedback :)

[@swethapuskoor7314]

Computer Science can you explain bellman ford too

[@timuralmamedov1900]

Great explanation! Finally, I understood it. The table really helps to not get lost. Thank you so much!

[@ricp]

This explanation is by far the Best I've seen.. This is crystal clear , thank you very much!

[@ComputerScienceLessons]

You are very welcome, and thank you :)KD

[@whiningmachine]

Fantastic explanation. Indeed, it's the best, clearest, simplest, and most useful resource by far that I've found after hours of searching. Thanks for making it!

[@ComputerScienceLessons]

Thank you - and you are most welcome :)KD

[@ice_cube918]

This is the best explanation of Dijkstra's algorithm I have seen!! I especially like the last summary part.

[@ComputerScienceLessons]

Thank you. Glad to help :)KD

[@drowmik]

I'm a programming lover man who have no computer science degree. I have seen many videos but this is the best and easiest way to explain the algo... Thanks a lot.. want more

[@ComputerScienceLessons]

Thanks for the comment. Plenty more on the way.

[@ayasswain]

Wonderfully explained. The best video i have come across so far on Djikstra's Algorithm.

[@leox8888]

Really appreciate this video. As a network engineer, i have read many book about how SPF works but this one is the best. And i can also develop the code based on this video. One thing I was stuck for a while is when having the directed graph (shorted path), it is a bit tricky to print all the shortest path considering ecmp case.

[@tundet8963]

Excellent work, Clarity, and explanation at all stages. Thanks, keep up the good work

[@dawnjinx4962]

I FINALLY UNDERSTAND THANK YOU SO MUCH!!!! This was the most concise and easy to follow video I've managed to find on this algorithm

[@ComputerScienceLessons]

You are most welcome. I usually ask my students to check their understanding by working through it with a different graph. :)KD

[@andresnieves9018]

If you can't explain it simply, you don't understand it well enough. Beautifully done. Thank you!

[@MinecraftLetstime]

By far the best video for explaining this algorithm! Perfect.

[@ayasswain]

The best video on shortest path algorithm on KZbin. Some of other videos that comes at the top of the search result are crap. People have unnecessarily complicated the explanation.

[@ComputerScienceLessons]

Thanks for the comment. Much appreciated. :)

[@danielm7755]

You've just earned yourself a new subscription champ! Great video! I love it!

[@ComputerScienceLessons]

Thank you and you are most welcome :)

[@DentrifixoRam88]

Hi from Argentina. After watching 4 other videos I can say this is the best explained solution steps I've found so far. Thanks!!

[@ComputerScienceLessons]

Tnx

[@chrise202]

You know this is the best illustration and guideline for implementing it on youtube.

[@ComputerScienceLessons]

Thanks :) KD

[@ahmedsaid8180]

Thank you very much! I have been trying understand this algorithm for 5 hours and I finally got it now "thanks to you"!

[@ComputerScienceLessons]

You're most welcome :)KD

[@JamshadAhmad]

This video is a definition of precise and concise explanation. Thank you very much.

[@JaffarBrar]

Crying in disbelief 😭😭. Finally some clear explanation. Thank youuuuu

[@ComputerScienceLessons]

You are very welcome. Glad to help. :) KD

[@rabiakhan7338]

I've watched a lot of videos on this algorithm and let me tell you if you're watching this you are at the right place.. and thank you so much Sir!

[@ComputerScienceLessons]

You are very kind. Thank you :)KD

[@virendrabhati6685]

When I was doing MCA noone explain us in such a simple way...... Now it's so easy after this video... thanks for your kind information....

[@ComputerScienceLessons]

You are very welcome. It's a tricky topic. :)KD

[@miller5565]

I couldn’t have asked for a clearer video, thank you sir.

[@ComputerScienceLessons]

You're most welcome :)KD

[@canmalatyaloglu8690]

The fact that this explanation of Dijkstra's is way more easily understandable and to-the-point than the one Computerphile has is astounding. Slides ftw

[@ComputerScienceLessons]

You're too kind. Thanks you. :)KD

[@canmalatyaloglu8690]

@@ComputerScienceLessons I thank you, recently passed my discrete maths exam :)

[@KevinIaMmE94]

I had to watch this video two times in order to grasp the concept. Thank you!!

[@ComputerScienceLessons]

You are very welcome. I get my students to check their understanding by working through the algorithm with a different graph. :)KD

[@GavinLon]

This is a great video. You have provided a very simple but clear explanation.

[@supernenechi]

You explained this so incredibly clearly! It's really not that hard at all! Thank you so much!

[@lolking420]

This is the best explanation for Dijkstra's shortest path. Thank you so much

[@ComputerScienceLessons]

You are very welcome :)KD

[@dimensionalblade2778]

Damn such a nice tutorial. Also you're making stuffs for VB, you're like the dream channel I've been searching.

[@leonidsukharnikov2563]

Perfect video! Clear examples, understandable English and ... no profanity.

[@ComputerScienceLessons]

Glad you liked it. Thanks for the comment. :) KD

[@ThewOrldIssqUare]

Thanks for this! As others have said, this is one of the clearest explanations on youtube!

[@m_t_t_]

Thanks for actually including the way to find the shortest path between the start node and a certain node, alot of tutorials leave that out

[@ComputerScienceLessons]

You're welcome :)KD

[@amskumar]

Best video on Dijkstra I've seen so far. Thanks for doing it with so much clarity.

[@forestpfeiffer1370]

Finally, an example that makes sense, wonderful job!

[@ComputerScienceLessons]

Glad to help :)KD

[@ulfinawakjira1977]

This is by far the best video I've seen on this subject it made implementation very easy and the explanation is the best I've ever seen so thank you very much!

[@Amitielle666]

Finally a video explaining IT stuff without nearly not understandable indian accent!

[@md.saifulislamfaisal6546]

Exactly! ... :D

[@vigneshsankaranarayanan617]

grow up mate

[@lilsafmusic]

They are clever though so you can't hate em.

[@aabhishek4911]

better to eat curry than insects and dogs

[@-no-handle]

Oh look kid. That thing under this guy's butt is what fire looks like.

[@RustysAdventures]

This video is a game changer. Understood it in one shot. Brilliant!

[@ComputerScienceLessons]

Thank you :)KD

[@Satharus]

This is the single best and most simple explanation of Dijkstra's algorithm. It saved me multiple times. Thank you so much.

[@ComputerScienceLessons]

Thank you for the kind comment

[@Satharus]

@@ComputerScienceLessons No need!

[@jacklimestone2559]

Thank you! This really helped me out with my assignment! Nice accent, clear explanation, and visually pleasing.

[@q1chen]

This 10mins video >>> 45mins video from my lecturer. LEGEND🙏

[@TheSmileyface103]

Thanks a lot man, this cleared a lot of confusion related to this algorithm. May you be blessed with bugless code!

[@ComputerScienceLessons]

You're very kind - but as I tell my students, you will learn more if your code doesn't work first time :)KD

[@TheSmileyface103]

@@ComputerScienceLessons hahaha fair point.

[@mmfawzy4850]

you are such great story teller, to learn algorithms as a story is fantastic, please continue ...

[@ComputerScienceLessons]

Thanks for the lovely comment. I working on some new videos at the moment.

[@mmfawzy4850]

@@ComputerScienceLessons Go on boss

[@ddddchannel837]

Extremely clear and well thought out video. Thanks for uploading!

[@ComputerScienceLessons]

You are very welcome. Thanks for the comment. :)KD

[@GANDHIXtv]

Best video on Dijkstra's by a considerable margin. Subbed.

[@nicolasgorse488]

Kevin, this is a great and super clear explanation, really !

[@ComputerScienceLessons]

Thanks for saying so :)

[@vinferothas]

I had closed the tab after watching video. Just remembered and came back to give a like. Great video

[@ComputerScienceLessons]

Thanks for coming back. Much appreciated. :)KD

[@theobserver4794]

two hours of a boring lecture vs 10mins cool explanation. thanks mate

[@ComputerScienceLessons]

You're very welcome :)KD

[@tranpaul4550]

Le me cry of joy because I find this absolute gem to prepare for the final.

[@ComputerScienceLessons]

Delighted to help. Remember, Dijkstra's is a greedy algorithm. It always selects the nearest node next, on the assumption that this will ultimately lead to the shortest overall path. It's common for an examiner to ask you to compare Dijkstra's algorithm with the A* algorithm . Good luck :)KD

[@tranpaul4550]

@@ComputerScienceLessons Wow man, my teacher did asked the question to compare Dijkstra's algorithm with the A* algorithm and Bellman-Ford. You are a god. Btw love your new series and waiting for more

[@rickyc1991]

Thanks to your clear explanations, I won't be visiting this video again. Maybe just once more before the finals.

[@ComputerScienceLessons]

I hope you will be visiting 'A' :)KD

[@hanbrianlee]

Omg.. out of like 10 dijkstra vids i attempted to eatch this is the best

[@nathanriches9547]

Thanks James May. This was a great episode of Top Gear

[@stuffboutthegovermet]

So easy to follow. Best video I’ve seen on this algorithm

[@Funnybone_FB]

Brilliant. Very well-done and clear explanation. Thank you for this!

[@ComputerScienceLessons]

Thank you. You are most welcome :)KD

[@young-julee7899]

D E A D

[@ComputerScienceLessons]

Accidental!

[@yunyizhu8358]

kinda scary when it turns red lol

[@MarkTheMadMan]

haha i saw this instantly, maybe its a sign :/

[@celsiusfahrenheit1176]

(ʘᗩʘ')

[@iansugg3496]

Me after my Data Structures and Algorithms final exam

[@victorpopa8724]

Thank you, sir. Thank you. Finally someone that can make it clear for a min span tree

[@ComputerScienceLessons]

Glad to be of service. Thanks for the kind comment. :)KD

[@josephantoniou3778]

This is the best concise explanation I found. Thanks

[@ComputerScienceLessons]

You're very welcome :)KD

[@abooth1707]

Best explanation I've ever seen of this. Thank you so much!

[@javadsabbagh8939]

Thank you, Kevin. Very understandable and clear.