Kruskal's and Prim's Algorithms for Minimum Spanning Trees

What this note covers

1. Graphs, Trees, and Spanning Trees
2. Kruskal's Algorithm: Step-by-Step
3. Prim's Algorithm: Step-by-Step
4. Comparing the Two Algorithms and Verifying the MST
5. Real Australian Network Design Applications
6. Full Consolidation Example with Both Algorithms
7. Examination Technique and Presentation

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