Dijkstra's algorithm
Consider a directed weighted graph. We are looking for the shortest paths from one vertex to the others. We assign so-called "temporary" and "permanent" labels to the vertices. At each stage, the smallest temporary label becomes permanent, and at the next stage, paths from the vertex with this label to accessible (neighboring) vertices are found. See M.N. Kirsanov's book "Graphs in Maple."
On this page of the site you can watch the video online Dijkstra's algorithm with a duration of hours minute second in good quality, which was uploaded by the user Kirsanov2011 20 June 2012, share the link with friends and acquaintances, this video has already been watched 156,343 times on youtube and it was liked by 3.3 thousand viewers. Enjoy your viewing!
