Dijkstra's algorithm is one of the most prominent algorithms in computer science. It is used to determine shortest paths in graphs. In this video we review its operating principle on a small example and we provide a formal proof of correctness.
