Dijkstra's Algorithm - The Complete Story
Dijkstra's algorithm, a fundamental algorithm of finding the shortest path from one vertex to another in a graph.
We explain the algorithm with extremely clear animations, then we discuss its complexity, and finally we formally prove its correctness.
Analytics
Comments
7.3
I liked the visual graphs; it definitely helped explain the algorithm. One thing I'm wondering is if the algorithm ignores branches, or if it has to calculate the tree for the entire network. For example, if I want to figure out the best way to my friend's house across town, it doesn't make sense to consider a route that goes through a city halfway across the country. Would the algorithm quickly start ignoring such a branch at the beginning of its calculation?
6.3
Lovely video! More time with the equations on the screen as you walk through them or the proof would be good. That will help with following the actual line of reasoning. Loved the little homework question at the end!
5.1
It's ok. Some audio/video choices are distracting. The explanation is clear, at least for me who studied the algorithm at least twice in the past, but it doesn't go to great lengths to keep the viewer engaged.
7.1
Hello! Great video. I enjoyed watching it. I already knew about Dijkstra's algorithm, and I've programmed it several times. Here is my feedback:
1. I love how you started and ended the video with an anecdote from Dijkstra's life. I didn't know the story about the marriage, and it made me really happy.
2. Your visualizations are good. You can easily follow what you're saying along with the video.
3. The script was really easy to follow (though I’m not sure if that's because I already knew the algorithm, but it was straightforward). I also like that you used YouTube chapters.
4. Some visualizations can be improved, such as the one around minute 6:00. There are a lot of things happening, and it’s not easy to follow since some changes are small, the colors don’t make it clear quickly, or the animation is too fast. However, you do get the pattern of movement after a while.
5. The proofs by contradiction were really easy to follow, so congrats on that. The visualization could be a little clearer if you showed what "cost_via" and "w" represent on the graph in this section.
6. Great job with that cliffhanger: "In the next video..." I'm looking forward to it.
Thanks for the explanation, and I hope to see more videos like this one. Keep going!
6
Great Story as part of the video. It flowed well. The animations were great.
I would encourage you to eliminate the noise in your audio (use Noise Reduction effect in Audacity). I think you could also keep your background music on when you talk, but just turn it down.
6.6
good introduction
nice graphics
not always clear English pronounciation
useful examples
good choices of what to include in the video