Graph Data Structure 4. Dijkstra’s Shortest Path Algorithm
ฝัง
- เผยแพร่เมื่อ 12 พ.ค. 2024
- This is the fourth in a series of computer science videos about the graph data structure. This is an explanation of Dijkstra’s algorithm for finding the shortest path between one vertex in a graph and another. Indeed, this explains how Dijkstra’s shortest path algorithm generates a set of information that includes the shortest paths from a starting vertex and every other vertex in the graph. It also mentions why Dijkstra’s shortest path algorithm is an example of a greedy algorithm.
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. :)
Great to hear! :)KD
@@ComputerScienceLessons lol, but i'm listening even now, best explanation. Keep it up
I agree fully. Best !
@@ComputerScienceLessons He's right! It was veryyy easy to understand. Thank you
stunning, clear explanation. Thank you so much!!!
FINALLY SOME CLEAR STUFF. almost crying
jaja...you made my day
Me too!!
said what i wanna say
HAHAHAHAHA
mood
We won't be visiting A, again.
Me: CRIES LOUDLY
A was no fun. :) KD
🦍🦍😂😂
Wiz Khalifa's "See You Again" Plays in The Background
i laughed hard reading this
!!!finally a good and simple explanation
oh tears of joy...
may the gods bless you with bugless codes
"May the gods bless you with bug-less codes."
I'm going to use that a lot.
haha epic comment bro
This is literally one of the cleanest, simplest, no-nonsense beautiful explanations of an algorithm I have ever watched on TH-cam. Amazing. To-the-point. Crisp. And so easy to understand and digest. THANK YOU.
The best video on the internet explaining the Dijkstra’s algorithm, thanks a lot sir.
You're welcome :)KD
This has to be the best explanation of Dijkstra's Shortest Path algorithm... Thanks a lot!
I signed in just to like this video.
and to comment apparently
U r loyal
Even 6 years later, this is still the best explanation ever
man this Dijkstra guy deserved a nobel prize for it
He was a clever chap! :)KD
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.
Extremely clear, extremely well put together visually. Well done, and thank you.
I really appreciate your comment. Thanks.
extremely
Absolutely the best explanation. Cleared up any and all lingering questions in my mind.
Great explanation! Finally, I understood it. The table really helps to not get lost. Thank you so much!
You sir are BY FAR the BEST teacher of algorithms on TH-cam or anywhere else I've seen algorithm lectures. THANK YOU FOR POSTING THIS! With your well-paced, methodical style you could probably teach anything!!!!
I can't believe how well done this video was made. I appreciate your hard work at a visual representation of this algorithm.
BEST explanation of Dijkstra's algorithm EVER!
I haven't found a better tutorial than this for understanding and computing distances using Dijkstra's algorithm. Thank you so much.
You are most welcome :)KD
It's really interesting, how sometimes one thorough example can clear up everything.
Thank you!
This is the single best video explaining the algorithm on TH-cam.
Excellent work, Clarity, and explanation at all stages. Thanks, keep up the good work
Thank you! This really helped me out with my assignment! Nice accent, clear explanation, and visually pleasing.
I'm watching a bunch of your videos to review for my Algorithms exam. Thanks a bunch for making these!
Thanks for the comment. It's good to hear you're finding them useful. :)
The clearest, and most succinct, explanation of Dijkstra's algo I've seen. Thanks!
By far the best video for explaining this algorithm! Perfect.
This is so far the best explanation I have seen, thank you so much!
Wonderfully explained. The best video i have come across so far on Djikstra's Algorithm.
The VERY clearest and well-paced explanation by far! Thanks!
You are too kind :)KD
This video is a definition of precise and concise explanation. Thank you very much.
I wish I could upvote this more than once. It is honestly a brilliant, clear, and concise explanation
You are very kind. Thanks. :) KD
@@ComputerScienceLessons But really it's awesome video.. the best info in the least possible time.. Thank you so much from India 🥰
An entire computer science degree courses embedded in this amazing channel. Thank you. Not all heroes wear a cap.
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!! :)
Best explanation I've ever seen of this. Thank you so much!
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.
I must commend the quality and clarity of this video: it is by far the best video I've seen on TH-cam 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!
Thanks for the great comment Mike.
The way you explained the algorithm was just great, thanks a lot for making this video!
Tnx for the feedback :)
Computer Science can you explain bellman ford too
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.
Don't thank me, thank this guy :)KD
en.wikipedia.org/wiki/Edsger_W._Dijkstra
This is the best video on Dijstra's Shortest path algorithm I have viewed on TH-cam. Kudos!
Lovely, this has been the clearest explanation I've seen so far for Dijkstra's algo. Seriously, thank you so much!
Thanks for saying so. You're most welcome :)KD
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.
Yo are most welcome :)KD
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!
You explained this so incredibly clearly! It's really not that hard at all! Thank you so much!
I have never seen a video with such clear and step-by-step explanations. Good job here!
I appreciate the comment. Thanks. :) KD
After spending lots of time on other videos and stuff finally, I have understood "Dijkstra’s" Thanks to this LEGEND.
You are most welcome :)KD
Thank you for including the psuedo-code at the end. Really helped me get an idea of how I should structure my own code!
Glad to help :)KD
This is the fourth video I had to watch. Only one that explains clearly, thanks.
If you can't explain it simply, you don't understand it well enough. Beautifully done. Thank you!
Crying in disbelief 😭😭. Finally some clear explanation. Thank youuuuu
You are very welcome. Glad to help. :) KD
Thanks for this! As others have said, this is one of the clearest explanations on youtube!
Fantastically clear and concise. Makes my revision an absolute dream, I can’t thank you enough. 10/10
Thank you. Delighted to help :)KD
Where have I seen that pic before?
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!
Glad you found it useful. There is nevertheless some good stuff on Craig n Dave's channel :)KD
Thanks for your extraordinary explanation. This is literally one of the simplest explanations of an algorithm I have ever watched on TH-cam.
Thank you. You are very welcome:)KD
This is by far the best video I've seen on this algorithm. It is clear and doesn't skip any steps.
Thank you :)KD
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 !!!
Thank you, Kevin. Very understandable and clear.
I had to watch this video two times in order to grasp the concept. Thank you!!
You are very welcome. I get my students to check their understanding by working through the algorithm with a different graph. :)KD
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!
You are most welcome :)KD
two hours of a boring lecture vs 10mins cool explanation. thanks mate
You're very welcome :)KD
This is a great video. You have provided a very simple but clear explanation.
Best video on Dijkstra I've seen so far. Thanks for doing it with so much clarity.
Very well explained! Best video so far on this algorithm. Thanks a ton.
Best explanation I could find. Thanks.
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
You are most welcome. I usually ask my students to check their understanding by working through it with a different graph. :)KD
great video ... you really have the spirit of a teacher ... thanks for making this one.
Excellent graphical and verbal explanation, very simple and coherent. Thanks for your video.
mannnn, i've been trying to find the missing link with this stuff and your video finally shined some light on the subject!
After watching about 5 videos on this algorithm, yours has made it crystal clear. Thank you.
You're very welcome. :)KD
@@ComputerScienceLessons Your A* explanation is also the best I found
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.
You are the best on explaining... Thanks a lot!
Man this content mind-blowing clear and simple explained, great work
This 10mins video >>> 45mins video from my lecturer. LEGEND🙏
Hi from Argentina. After watching 4 other videos I can say this is the best explained solution steps I've found so far. Thanks!!
Tnx
This is the single best and most simple explanation of Dijkstra's algorithm. It saved me multiple times.
Thank you so much.
Thank you for the kind comment
@@ComputerScienceLessons No need!
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
Thanks for the comment. Plenty more on the way.
Damn such a nice tutorial. Also you're making stuffs for VB, you're like the dream channel I've been searching.
Thanks James May. This was a great episode of Top Gear
Perfect!
keep it coming. Well explained
This explanation is by far the Best I've seen.. This is crystal clear , thank you very much!
You are very welcome, and thank you :)KD
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
You're too kind. Thanks you. :)KD
@@ComputerScienceLessons I thank you, recently passed my discrete maths exam :)
Best video on Dijkstra's by a considerable margin. Subbed.
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!
Thank you - and you are most welcome :)KD
Thank you for making this video! Great explanation!
Thank you for this brilliant explanation!
Extremely clear and well thought out video. Thanks for uploading!
You are very welcome. Thanks for the comment. :)KD
Brilliant. Very well-done and clear explanation. Thank you for this!
Thank you. You are most welcome :)KD
D E A D
Accidental!
kinda scary when it turns red lol
haha i saw this instantly, maybe its a sign :/
(ʘᗩʘ')
Me after my Data Structures and Algorithms final exam
I had closed the tab after watching video. Just remembered and came back to give a like. Great video
Thanks for coming back. Much appreciated. :)KD
This is the best explanation of Dijkstra's algorithm I have seen!! I especially like the last summary part.
Thank you. Glad to help :)KD
Finally, an example that makes sense, wonderful job!
Glad to help :)KD
This explains it perfectly. Thank you so much.
Really good show of the algorithm. thanks a lot.
Thanks to your clear explanations, I won't be visiting this video again.
Maybe just once more before the finals.
I hope you will be visiting 'A' :)KD
Amazing, thanks for making a clear explained video
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!
You are very kind. Thank you :)KD
You've just earned yourself a new subscription champ! Great video! I love it!
Thank you and you are most welcome :)
You know this is the best illustration and guideline for implementing it on youtube.
Thanks :) KD
I couldn’t have asked for a clearer video, thank you sir.
You're most welcome :)KD
Awesome video ! This made me clear how to simplify and program the Seam algorithm!
This is just phenomenal
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
You're welcome :)KD