Notes on Dijkstra's Algorithm

1. A Small Example of How Dijkstra's Algorithm Operates (HTML)
   
   
2. The Previous Example Step-by-Step, with Data Structures (HTML)
   
   
3. The Same Example, with Graph Shown Represented as an Adjacency Matrix (PDF)
   
   
4. Pseudo-Code for The Adjacency Matrix Version of Dijkstra's Algorithm (HTML)
   
   
5. A Worst-Case Performance Analysis of The Adjacency Matrix Version of Dijkstra's Algorithm (HTML)
   
   
6. Thinking about How to Use an Edge List to Improve the Performance of Dijkstra's Algorithm (HTML)
   
   
7. Data Structures for the 'Priority Queue' Version of Dijkstra's Algorithm