Dijkstra's Shortest Path Algorithm - A Complete Story (Algorithm, Example, Complexity and Proof)

preview_player
Показать описание
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.

Chapters
0:00 A walk in Amsterdam
0:58 graph theory model
1:46 Intuition
2:33 Relax
3:41 An example
8:22 Pseudo code & Complexity
10:00 Proof of correctness
13:14 Negative weight
13:35 The humble (programmer)

#algorithm #dijkstra #aligorithm #graphtheory #maze #artificialintelligence #complexity #shortestpath #navigation #computerscience #manim #soME4 #soMEpi
Рекомендации по теме
Комментарии
Автор

This is such a hidden gem, thanks for making these videos!

alitarhini
Автор

very nice, make sure to submit this to #SoMEpi (deadline is Aug18)

jkzero