A-Level Further Mathematics

Practice session

Which algorithm finds the minimum spanning tree by adding the cheapest edge that doesn't create a cycle, considering all edges sorted by weight?

Loading your practice session…