1. Dijkstra’s algorithm is an iterative algorithm that provides us with the shortest path from one particular starting node to all other nodes in the graph. Again this is similar to the results of a breadth first search. Here is a video tutorial in 3 minutes
  2. Dijkstra's algorithm in 3 minutes — Review and example
Read next page