Trees, spanning trees, Prim's algorithm and minimum connector problems

What this note covers

1. What a tree is, and the properties that follow
2. Spanning trees
3. Minimum spanning trees and minimum connector problems
4. Prim's algorithm, worked step by step
5. Ties, uniqueness and the variations examiners like
6. Presenting the answer so it earns full marks
7. This topic in Section One, without a calculator
8. How this is examined, and what separates a top answer

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