Home

Decision One

Shortest Paths in Networks

Dijkstra's Algorithm

  1. Label 1st vertex
  2. Temporarily label all vertices you can reach from 1st vertex
  3. Choose the vertex with the lowest temporary label and box it permanentely
  4. Temporarily label all the vertices which can newly be reached from the permanently boxed vertices and adjust others downwards
  5. Repeat 3. and 4. until destination vertex is perminantely boxed
An example of the box used in Dijkstra's Algorithm Fig 1. An example of the box used in Dijkstra's Algorithm.