Kruskal’s Algorithm is one of the most important algorithms for constructing minimum spanning trees. Receive instant feedback and explanations in practice mode. Test your accuracy and speed by tackling the challenging questions in test mode.
Kruskal’s Algorithm is an algorithm to find a minimum spanning tree for a connected weighted graph. That is, it finds a tree which includes every vertex where the total weight of all the edges in the tree is minimised. A single graph may have more than one minimum spanning tree.
Kruskal’s is a standard algorithm in A-level decision maths (D1) courses run by AQA, OCR, MEI and Edexcel.