How Dijkstra's Algorithm Works

preview_player
Показать описание
Dijkstra's Algorithm allows us to find the shortest path between two vertices in a graph. Here, we explore the intuition behind the algorithm — what information we need to keep track of, in what order we need to explore vertices, and what the limitations of the algorithm are.

***

Рекомендации по теме
Комментарии
Автор

This video is ridiculously underrated ((

beketmyrzanov
Автор

Came from Computerphile's video after not understanding, and this is just so much better! You made advanced concepts so easy to understand for beginners like me, thank you.

hongweichen
Автор

I cant stress how amazing these animations are! You are a livesaver for "self-learners" like us :)

aries
Автор

One thing I realized, visualization is more helpful to grasp a context than just reading about it.

supersakib
Автор

I've been agonizing over trying to understand this algorithm for a class for hours- and now I'm about halfway through this video, and I'm already feeling enlightened. It's FINALLY clicking. You're a lifesaver, mate!

Yell-Heah
Автор

THANK YOU for the part at 6:28 ! Nobody else seems to explain how to actually find the path, and not just it's length.

Mobin
Автор

I love learning based on examples and this is by far the best example of Dijkstra's algorithm I've seen so far. It covers a lot of aspects that might not be obvious at first. I haven't even learned Dijkstra yet, but it feels trivial to implement after knowing how simple graph algorithms like DFS or BFS work.

dominiorrr
Автор

Absoloute life saver. Got taught this by a teacher who literally doesn't know computer science so videos like this are vital.

penguinjuice
Автор

The animation is just outstanding!

A video on "how" you make these videos or just what inspired you to get started on this creative journey would be awesome.

Keep up the amazing work. I have subscribed and also pressed the bell icon. :)

prashanthvaidya
Автор

So far the best and easiest explainations i have ever seen on YT yet for dijkstra;s Algo. Great work !!! Thank you :)

whatsup_internet
Автор

A very helpful video. Just looking at code and some rambling explanation in a book made the algorithm as clear as mud in a beer bottle to me... but this video has made it so abundantly clear... and seeing how code is derived from it is more than helpful. Thanks so much for posting.

ozboomer_au
Автор

By far the best video on this subject I have ever seen, FANTASTIC job with those animations they are really good!

pend_deletepatrickguarente
Автор

It's amazing that I recognized this voice immediately and realized this random video I picked is actually from Brain! Thank you for all the hard work you've done!

jaylensung
Автор

This is the best explanation on Dijkstra's algorithm I've ever come across!! 🙌🙌

keitumetsemolefe
Автор

Please continue to do more of this video! Thank you so much for your content!!

soyandoat
Автор

Very great explanation, I just followed along Dikstra's algorithm in pseudo code and implemented pathfinding in Unity using it. This visual tool really helps explain the algorithm at hand! Great work.

demonking
Автор

Not only the video is underrated but the whole youtube channel is underrated. best of luck you spanning tree. This is the future of education. I feels so good when i look up to such unique educational channels.

artyCrafty
Автор

i have my Alevel Comp Sci paper 12 hours from now. I love you man. Youre a real life saver

qazizayad
Автор

This is so much better than some other ones I already saw....and that was a nice tip at the end, referring to the negative value.

KingstonFortune
Автор

I've been watching a few of your videos over the last day or so, and they're all just so good. You really have a knack for explaining complicated concepts with a clear, easy-to-grasp visual style. I think I'd describe your channel as "3blue1brown for computer science" :) I hope that comes off as complementary as it's intended. Kudos, and keep up the great work, I'm looking forward to more!

alliepiper