✨ Free preview
🌳
Minimum spanning trees
Use Kruskal’s or Prim’s algorithm to find the minimum spanning tree that connects every vertex at least cost.
⏱ 20 min❓ 10 questions
What you'll be able to do
- ✔I can describe trees and spanning trees and know a spanning tree has n − 1 edges
- ✔I can apply Kruskal’s and Prim’s algorithms to find a minimum spanning tree
- ✔I can use a minimum spanning tree to solve practical cost problems
How this works
- 1Read the short explanations first — they teach you what you need before each question.
- 2Answer each question, then tap Check. A right answer moves you on automatically; if it's wrong, you'll see a friendly explanation of why.
- 3Finish all 3 steps to see your score — sign in and subscribe to unlock the full lesson and save it.
What's inside
10 questions and 1 quick teaching card, including:
- 🔢Number answer — Work out the answer and type the number.
👪Grown-up tip: sit alongside younger learners for the first few lessons. Read the questions together and chat about the explanations — that's where the real learning sticks.
Sign in and subscribe to unlock the full lesson and save your progress.
Curriculum: AC9M10SP02