Dijkstra's Shortest Path Algorithm

Algorithm

  1. Note the distances from a current (initial) node to all neighbouring nodes.
  2. Mark the current node as visited and move to the next node with the smallest distance and set it as the current node.
  3. If the destination node is marked visited, stop.
  4. Otherwise repeat at 1.

Notes

Performance