Two algorithms that both find the minimum spanning tree. HL AI expects you to execute Kruskal's by hand on a weighted graph in Paper 2.
Practise Minimum spanning trees — Kruskal and Prim with AI marking
Open the full HL AI engine — every question in this unit is worked through with instant AI-graded feedback on your handwritten workings.
Open HL AI Functions →