Dijkstra's Algorithm Visualized and Explained

This video should give you a quick overview of Dijkstra's Algorithm.

Notes:
- 'A' could be closed from the start. It doesn't matter.
- 'F' could have been part of the open node list. Since it's the final node, I chose not to, but it's up to you.

The animations are made with my tool Alvis.

Feel free to leave a comment if you find a mistake. You can also open an issue on GitHub.

Thanks for watching!

[abdullahomarsayeem]

This video deserves millions of views. Short and to the point.

[Brodyaga]

Thanks for the video! Great explanation

[zoxemo]

how this useful video has 1.3 millions views and only 5 coms?

[techno]

A -> C -> B -> E -> F = 2 + 1 + 2 + 1 = 6