Free November promotion: everything is free until 30 November 2026 — every subject, unlimited practice.
Subjects / LC Applied Mathematics / Modelling with networks and graphs (spec Strand 2)

Minimum spanning trees

Use Prim's and Kruskal's algorithms to connect all vertices at minimum total weight.

In review 5th Year6th Year HigherOrdinary
Helps to know first: Graphs and networks
15practice questions

Match the pairs: 1 · Multiple choice: 6 · Numeric answer: 4 · Put in order: 3 · Short answer: 1

Each question has up to three hints, a worked explanation, and is tracked in your progress and review plan.

Practise this topic

Try a question

Multiple choice
In Kruskal's algorithm, which edge is added at each step?
Choose one answer
Hint 1

Kruskal's algorithm looks at the whole list of edges.

Create a free account to save your progress.