Graph Data Structure 4. Dijkstra’s Shortest Path Algorithm 

FINALLY SOME CLEAR STUFF. almost crying

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. :)

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

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

This video is your shortest path to learn Dijkstra Algorithm.

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

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

I signed in just to like this video.

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.

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

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

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

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

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

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

BEST explanation of Dijkstra's algorithm EVER!

man this Dijkstra guy deserved a nobel prize for it

Thank you! This is the single best video explaining the algorithm on RU-vid.

I must commend the quality and clarity of this video: it is by far the best video I've seen on RU-vid 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!

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

D E A D

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

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

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

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

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

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

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

This is so far the best explanation I have seen, thank you so much!

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

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

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

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

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

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

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

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!! :)

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.

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.

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

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.

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

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

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

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

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!

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

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

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

Thank you, Kevin. Very understandable and clear.

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

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

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

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

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

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

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!

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!

Best explanation I could find. Thanks.

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

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

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

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

mannnn, i've been trying to find the missing link with this stuff and your video finally shined some light on the subject!

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

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

Man, thank you so much. Now you've got a new subscriber. Greeting from Medellín, Colombia.

Very well explained! Best video so far on this algorithm. Thanks a ton.

You are the best on explaining... Thanks a lot!

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

Finally, an example that makes sense, wonderful job!

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!

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

Man this content mind-blowing clear and simple explained, great work

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

Awesome video ! This made me clear how to simplify and program the Seam algorithm!

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

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

thank you I was really struggling implementing this algorithm in real coordinates, i realized coordinates are like grid/trees if you zoom it, and i could apply your ideas and explanation to find the shortest path available in a set of xyz 'real' coordinates! awesome.

This explains it perfectly. Thank you so much.

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

Excellent graphical and verbal explanation, very simple and coherent. Thanks for your video.

REALLY well explained. Nice and slow, nice and clear! Many thanks!

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

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

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

great video ... you really have the spirit of a teacher ... thanks for making this one.

Most efficient video on dijkstra's algorithm out there :)

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

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

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

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

Perfect! keep it coming. Well explained

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

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

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

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

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

Thank you for this brilliant explanation!

Very clear explanation. Well done!