Shortest Path Problems Using Dijkstra's Algorithm

What this note covers

1. What Is a Shortest Path Problem?
2. Dijkstra's Algorithm — How It Works
3. Recording the Working Table
4. Worked Example: Brisbane Suburban Road Network
5. Shortest Path vs Minimum Spanning Tree — A Critical Distinction
6. Tracing the Shortest Path After the Algorithm
7. Exam Technique and Common Pitfalls

7 sections · 12 key terms & formulas · 6 common mistakes