Definitions, Euler's formula and shortest path problems

What this note covers

1. Network Terminology: The Building Blocks
2. Euler's Formula for Planar Graphs
3. Shortest Path Problems: Concepts and Setup
4. Shortest Path by Inspection
5. Dijkstra's Algorithm: Step-by-Step Method
6. Applying These Concepts: Exam Strategy
7. Summary of Key Formulas and Rules

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