Dijkstra's algorithm
Moving from Bellman-Ford into the Dijsktra's algorithm.
Moving from Bellman-Ford into the Dijsktra's algorithm.
Figuring out shortest-path problem from the BF to the A* algorithm.
Greedy solution of the Pyramid Slide Down.
Solving a problem in different ways.